Korhan KarabulutM. Fatih Tasgetiren2025-10-062013978-1-4673-5905-4https://gcris.yasar.edu.tr/handle/123456789/6245This paper presents a discrete artificial bee colony algorithm (DABC) for solving the team orienteering problem with time windows (TOPTW). The proposed algorithm employs a destruction and construction procedure to generate neighboring food sources in the framework of the DABC algorithm. In addition a variable neighborhood descent (VND) algorithm is developed to 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 competitive to the best performing algorithms from the literature. Ultimately 11 instances are further improved by the proposed DABC algorithm.Englishorienteering problem with time windows, artificial bee colony algorithm, iterated greedy algorithm, swarm intelligence, heuristic optimizationABC ALGORITHM, SEARCH, OPTIMIZATIONConference Object