A variable iterated greedy algorithm for the traveling salesman problem with time windows
Özet
This paper presents a variable iterated greedy algorithm for solving the traveling salesman problem with time windows (TSPTW) to identify a tour minimizing the total travel cost or the makespan, separately. The TSPTW has several practical applications in
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84901847300&doi=10.1016%2fj.ins.2014.03.127&partnerID=40&md5=6a0cd049afbb0aeb557f2c070ee6103ehttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10373
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..