Improvement of a Genetic Algorithm Approach for the Solution of Vehicle Routing Problem with Time Windows
[ X ]
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
IEEE
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this study, Vehicle Routing Problem with Time Windows (VRPTW) with known customer demands, a single depot and identical vehicles, is considered. Minimizing the total distance and the total waiting time of the vehicles are determined as objective functions for VRPTW which is capable to serve the customers in a prespecified time interval. A hybridized version of genetic algorithm which is a metaheuristic solution technique with constructive heuristic methods is proposed to produce effective solutions for VRPTW. By using sweep algorithm in initial population generation phase of genetic algorithm, it is planned to begin the search with high quality solution sets and in this way, get more feasible solutions faster. A benchmark problem in the literature is solved and obtained results are compared with the results of genetic algorithm with the nearest neighbor algorithm based algorithm. It is observed that the proposed genetic algorithm beginning with sweep based initial population generation algorithm reaches more effective solutions.
Açıklama
2017 International Artificial Intelligence and Data Processing Symposium (IDAP) -- SEP 16-17, 2017 -- Malatya, TURKEY
Anahtar Kelimeler
Genetic algorithm, Multi-objective optimization, NSGA-II, Sweep algorithm, Vehicle routing
Kaynak
2017 International Artificial Intelligence and Data Processing Symposium (Idap)
WoS Q Değeri
N/A
