Open AccessSimultaneous Multi-Start Simulated Annealing for Capacitated Vehicle Routing Problem
Author(s) -
Arman Davtyan,
S. G. Khachatryan
Publication year - 2020
Publication title -
wseas transactions on computer research
Language(s) - English
Resource type - Journals
eISSN - 2415-1521
pISSN - 1991-8755
DOI - 10.37394/232018.2020.8.4
Subject(s) - simulated annealing , vehicle routing problem , metaheuristic , minification , mathematical optimization , computer science , combinatorial optimization , algorithm , routing (electronic design automation) , mathematics , computer network
A new metaheuristic algorithm is proposed for Capacitated Vehicle Routing Problem. CVRP is one of the fundamental problems in combinatorial optimization that deals with transport route minimization. The algorithm combines Simulated Annealing, multi-start and simultaneous computing techniques. A series of computational tests are conducted on several CVRP benchmarks and near-optimal solutions are obtained. The results indicate superior performance compared with Simulated Annealing