Korhan KarabulutM. Fatih TasgetirenTasgetiren, M. FatihKarabulut, Korhan2025-10-062012978-1-4673-1509-89781467359054978146731509810.1109/CEC.2012.62529412-s2.0-84866874921https://gcris.yasar.edu.tr/handle/123456789/6456https://doi.org/10.1109/CEC.2012.6252941https://doi.org/10.1109/CIPLS.2013.6595206This 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 both scheduling and logistic applications. The proposed DABC algorithm basically relies on the destruction and construction phases of iterated greedy algorithm to generate neighboring food sources in a framework of ABC algorithm. In addition it also relies on a classical 1-opt local search algorithm to further enhance the solution quality. The performance of the algorithm was tested on a benchmark set from the literature. Experimental results show that the proposed DABC algorithm is very competitive to or even better than the best performing algorithms from the literature.Englishinfo:eu-repo/semantics/closedAccesstraveling salesman problem with time windows, artificial bee colony algorithm, iterated greedy algorithm, swarm intelligence, heuristic optimizationOPTIMIZATIONArtificial Bee Colony AlgorithmTeam Orienteering Problem with Time WindowsIterated Greedy AlgorithmTraveling Salesman Problem with Time WindowsHeuristic OptimizationSwarm IntelligenceOrienteering Problem with Time WindowsConference Object