A discrete artificial bee colony algorithm for the traveling salesman problem with time windows
Özet
This paper presents a discrete artificial bee colony algorithm (DABC) for solving the traveling salesman problem with time windows (TSPTW) in order to minimize the total travel cost of a given tour. TSPTW is a difficult optimization problem arising in bot
Bağlantı
https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866874921&doi=10.1109%2fCEC.2012.6252941&partnerID=40&md5=991da5eb3c5d61e667a0b852958fbe1bhttps://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10555
Koleksiyonlar
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
