Master'sOpen Access

Solution of capacitated vehicle routing problem with simulated annealing hybrid algorithm with initial solution created with fuzzy C and K-means algorithm

2020
0 views
0 downloads
Advisor: Prof. Dr. İbrahim Çil

Abstract (EN)

In this study, a popular problem, Vehicle Routing Problem (VRP), has been studied. In this problem, customers or cities should be visited and transported to the customer or city, starting from a point in the products. The aim is to deliver products by solving the transportation problem. While this problem seems easy to solve with a small number of cities or customers, it is not. Because it has to provide too many constraints. Therefore, this problem cannot be solved with the available computing power. As the number of customers increases, the calculations to be made increase exponentially, because all constraints must be met for each customer and a relatively good solution must be reached in a short time. Simulation Annealing (SA), a meta-heuristic method, was used to solve the problem in this study. In general, the SA algorithm is a repetitive process based on the variable temperature parameter that mimics the annealing process of metals. The biggest problem with this method for our study is that it randomly generates the initial solution used to start the algorithm. For this reason, because the search space used to reach the optimum solution is large, the solution time (or number of iterations) will increase. With a better initial solution, it will take less time to reach the optimum solution. Since the optimum solution we want to reach is the minimum distance, the routes have been clustered using K-means and Fuzzy c-mean to improve the initial solution. Due to fuzzy logic, each data can be included in more than one cluster between 0-1, since it will change the initial solution in every solution of the algorithm, there will be a case of approaching the optimum solution. Using the same data and the same parameters, the problem was solved with SA using a random starting solution and with an initial solution optimized SA with FCM. FCM reduced the initial search space by 57%. Therefore, FCM gave results closer to the optimum solution in the same solution time and the same number of rashes. Solution results are compared.

Author

Dr. Ahmet Fatih Eker

How to Cite

Ahmet Fatih Eker (Master Thesis). Solution of capacitated vehicle routing problem with simulated annealing hybrid algorithm with initial solution created with fuzzy C and K-means algorithm, 2020, Sakarya University.

Keywords

License

Tüm Hakları Saklıdır

This work is shared under the specified license terms.

More theses from Sakarya University