A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints

2018 ◽  
Vol 265 (3) ◽  
pp. 843-859 ◽  
Author(s):  
Lijun Wei ◽  
Zhenzhen Zhang ◽  
Defu Zhang ◽  
Stephen C.H. Leung
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Simulated Annealing Algorithm ◽  
Two Dimensional ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Loading Constraints ◽  
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.

scholarly journals A Multi-Start Algorithm for Solving the Capacitated Vehicle Routing Problem with Two-Dimensional Loading Constraints

2021 ◽  
Author(s):  
Leandro Pinto Fava ◽  
João Carlos Furtado ◽  
Gilson Augusto Helfer ◽  
Marko Beko ◽  
Sérgio Duarte Correia ◽  
...  
Keyword(s):  
Graph Theory ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Neighborhood Search ◽  
Two Dimensional ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Graph Modeling ◽  
Loading Constraints ◽  
Capacitated Vehicle

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

scholarly journals Uma revisão sistemática da literatura sobre o Problema de Roteirização de Veículos Capacitados com Restrições de Carregamento Bidimensional (2L-CVRP)

TRANSPORTES ◽  
2017 ◽  
Vol 25 (1) ◽  
pp. 61
Author(s):  
Bianca Passos Arpini ◽  
Rodrigo Alvarenga Rosa
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Two Dimensional ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Loading Constraints ◽  
Capacitated Vehicle

Roteirização e carregamento são dois aspectos centrais na gestão de distribuição logística. Recentemente, o pro-blema integrado de roteirização e carregamento tem atraído a atenção da comunidade de pesquisa operacional. Esse interesse se deve não só a seu enorme potencial de aplicação em situações reais, mas também aos desafios metodológicos para sua solução, pois se trata da combinação de dois problemas de elevada complexidade computacional. Este artigo tem por objetivo realizar uma revisão sistemática das principais publicações relacionadas ao Problema de Roteirização de Veículos Capacita-dos com Restrições de Carregamento Bidimensional (Capacitated Vehicle Routing Problem with Two-dimensional Loading Constraints – 2L-CVRP). O intuito é analisar o que foi publicado até o momento e identificar abordagens de solução, carac-terísticas incorporadas ao problema e lacunas de pesquisa que ainda não foram tratadas.

Sign in / Sign up

Export Citation Format

Share Document