An Improved Simulated Annealing Algorithm with Crossover Operator for Capacitated Vehicle Routing Problem

2021 ◽  
pp. 100911
Author(s):  
İlhan İLHAN
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Crossover Operator ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Annealing Algorithm ◽  
Capacitated Vehicle

scholarly journals Simulated annealing algorithm for solving the capacitated vehicle routing problem: a case study of pharmaceutical distribution

2020 ◽  
Vol 4 (1) ◽  
pp. 41-49 ◽  
Author(s):  
Anak Agung Ngurah Perwira Redi ◽  
Fiki Rohmatul Maula ◽  
Fairuz Kumari ◽  
Natasha Utami Syaveyenda ◽  
Nanda Ruswandi ◽  
...  
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Pharmaceutical Distribution ◽  
Annealing Algorithm ◽  
Capacitated Vehicle

This study aims to find a set of vehicles routes with the minimum total transportation time for pharmaceutical distribution at PT. XYZ in West Jakarta. The problem is modeled as the capacitated vehicle routing problem (CVRP). The CVRP is known as an NP-Hard problem. Therefore, a simulated annealing (SA) heuristic is proposed. First, the proposed SA performance is compared with the performance of the algorithm form previous studies to solve CVRP. It is shown that the proposed SA is useful in solving CVRP benchmark instances. Then, the SA algorithm is compared to a commonly used heuristic known as the nearest neighborhood heuristics for the case study dataset. The results show that the simulated Annealing and the nearest neighbor algorithm is performing well based on the percentage differences between each algorithm with the optimal solution are 0.03% and 5.50%, respectively. Thus, the simulated annealing algorithm provides a better result compared to the nearest neighbour algorithm. Furthermore, the proposed simulated annealing algorithm can find the solution as same as the exact method quite consistently. This study has shown that the simulated annealing algorithm provides an excellent solution quality for the problem.

Study on Hybrid Genetic Algorithm for Capacitated Vehicle Routing Problem

2012 ◽  
Vol 178-181 ◽  
pp. 1769-1772
Author(s):  
Chun Yu Ren
Keyword(s):  
Genetic Algorithm ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Hybrid Genetic Algorithm ◽  
Search Efficiency ◽  
Crossover Operator ◽  
Real Numbers ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

Capacitated vehicle routing problem is logistics optimization indispensable part. The hybrid genetic algorithm is used to optimize the solution. Firstly, use sequence of real numbers coding so as to simplify the problem; Construct the initial solution to improve the feasibility; adopt some arithmetic crossover operator to enhance whole search ability of the chromosome. Secondly, use Boltzmann simulated annealing mechanism to improve the convergence speed and search efficiency. Finally, comparing to other algorithms, the results demonstrate the effectiveness and good quality.

scholarly journals Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows

2009 ◽  
Vol 3 (2) ◽  
pp. 87-100 ◽  
Author(s):  
Marcin Woch ◽  
Piotr Łebkowski
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Optimization Problems ◽  
Time Windows ◽  
High Quality ◽  
Routing Problem ◽  
Annealing Algorithm ◽  
Very High

This article presents a new simulated annealing algorithm that provides very high quality solutions to the vehicle routing problem. The aim of described algorithm is to solve the vehicle routing problem with time windows. The tests were carried out with use of some well known instances of the problem defined by M. Solomon. The empirical evidence indicates that simulated annealing can be successfully applied to bi-criterion optimization problems.

Sign in / Sign up

Export Citation Format

Share Document