An improved simulated annealing algorithm with crossover operator for capacitated vehicle routing problem
Küçük Resim Yok
Tarih
2021
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Elsevier
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
The capacitated vehicle routing problem (CVRP) is one of the commonly studied issues today. It belongs to the class of NP-hard problems and has a high time complexity. Therefore, the solution of the CVRP was focused in this study. An improved simulated annealing algorithm with crossover operator, called ISA-CO, was proposed. A population based simulated annealing algorithm was used in the proposed algorithm. The solutions in the popu-lation were developed through the local search operators, including swap, scramble, insertion, and reversion. The improved 2-opt algorithm was used to develop the routes making up the solution. The partially mapped crossover (PMX) and the order crossover (OX) operators were applied to the solutions in the population to accelerate the convergence. A mix selection method was used to ensure the balance between exploitation and exploration. The ISA-CO was tested on 91 well-known benchmark instances. The results indicated that the method has a better performance compared to other state-of-the-art methods on many instances.
Açıklama
Anahtar Kelimeler
Capacitated Vehicle Routing Problem, Improved 2-Opt, Local Search, Order Crossover, Partially Mapped Crossover, Simulated Annealing, Selection
Kaynak
Swarm And Evolutionary Computation
WoS Q Değeri
Q1
Scopus Q Değeri
Q1
Cilt
64
