A population based simulated annealing algorithm for capacitated vehicle routing problem
Küçük Resim Yok
Tarih
2020
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Tubitak Scientific & Technological Research Council Turkey
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
The Vehicle Routing Problem (VRP) is one of the most discussed and researched topics nowadays. The VRP is briefly defined as the problem of identifying the best route to reduce distribution costs and improve the quality of service provided to customers. The Capacitated VRP (CVRP) is one of the most commonly researched among the VRP types. Therefore, the CVRP was studied in this paper and a new population based simulated annealing algorithm was proposed. In the algorithm, three different route development operators were used, which are exchange, insertion and reversion operators. It was tested on 63 well-known benchmark instances in the literature. The results showed that the optimum routes could be determined for the 23 instances.
Açıklama
Anahtar Kelimeler
Capacitated Vehicle Routing Problem, Best Route, Route Enhancing, Simulated Annealing
Kaynak
Turkish Journal Of Electrical Engineering And Computer Sciences
WoS Q Değeri
Q4
Scopus Q Değeri
Q3
Cilt
28
Sayı
3
