scholarly journals An improved two-phased heuristic algorithm for the capacitated vehicle routing problem and a case study

2020 ◽  
Vol 49 (4) ◽  
pp. 477
Author(s):  
M. K. D. D. Sandaruwan ◽  
D. M. Samarathunga ◽  
W. B. Daundasekara
Keyword(s):  
Vehicle Routing ◽  
Heuristic Algorithm ◽  
Vehicle Routing Problem ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Capacitated Vehicle

scholarly journals Comparative Study of Algorithms Metaheuristics Based Applied to the Solution of the Capacitated Vehicle Routing Problem

2020 ◽  
Author(s):  
Fernando Francisco Sandoya Sánchez ◽  
Carmen Andrea Letamendi Lazo ◽  
Fanny Yamel Sanabria Quiñónez
Keyword(s):  
Simulated Annealing ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Impact Analysis ◽  
Routing Problem ◽  
Capacitated Vehicle Routing Problem ◽  
Economic Impact Analysis ◽  
Transportation Sector ◽  
Capacitated Vehicle

This chapter presents the best-known heuristics and metaheuristics that are applied to solve the capacitated vehicle routing problem (CVRP), which is the generalization of the TSP, in which the nodes are visited by more than one route. To find out which algorithm obtains better results, there are 30 test instances used, which are grouped into 3 sets of problems according to the position of the nodes. The study begins with an economic impact analysis of the transportation sector in companies, which represents up to 20% of the final cost of the product. This case study focuses on the CVRP for its acronym capacitated vehicle routing problem, analyzing the best-known heuristics such as Clarke & Wright and sweep, and the algorithms GRASP and simulated annealing metaheuristics based.

Sign in / Sign up

Export Citation Format

Share Document