Now showing items 11-13 of 13
A Populated Iterated Greedy Algorithm with Inver-Over Operator for Traveling Salesman Problem
(SPRINGER-VERLAG BERLIN, 2013)
In this study, we propose a populated iterated greedy algorithm with an Inver-Over operator to solve the traveling salesman problem. The iterated greedy (IG) algorithm is mainly based on the central procedures of destruction ...
A Discrete Artificial Bee Colony Algorithm for the Traveling Salesman Problem with Time Windows
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 ...
An evolution strategy approach to the team orienteering problem with time windows
(Computers and Industrial Engineering, 2020)
The team orienteering problem with time windows (TOPTW) is a highly constrained NP-hard problem having many practical applications in vehicle routing and production scheduling. The TOPTW is an extended variant of the ...