Search
Now showing items 1-2 of 2
A discrete artificial bee colony algorithm for the traveling salesman problem with time windows
(2012 IEEE Congress on Evolutionary Computation, CEC 2012, 2012)
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 ...
A Discrete Artificial Bee Colony Algorithm for the Traveling Salesman Problem with Time Windows
(IEEE, 2012)
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 ...
DSpace@YASAR by Yasar University Institutional Repository is licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 4.0 Unported License..
