Insertion based Ants for Vehicle Routing Problems with Backhauls and Time Windows

2024/01/18 by Reimann, Marc, Doerner, Karl, Hartl, Richard F.

paper · doi:10.57938/a21ea9e8-9a21-45d4-8e41-4fc3cbb28458

Abstract

In this paper we present and analyze the application of an Ant System to the Vehicle Routing Problem with Backhauls and Time Windows (VRPBTW). At the core of the algorithm we use an Insertion procedure to construct solutions. We provide results on the learning and runtime behavior of the algorithm as well as a comparison with a custom made heuristic for the problem.

Related

• Tackling Dynamic Vehicle Routing Problem with Time Windows by means of Ant Colony System
• SavingsAnts for the vehicle routing problem
• The Bees Algorithm for the Vehicle Routing Problem
• Combined A*-Ants Algorithm: A New Multi-Parameter Vehicle Navigation Scheme
• Solving the capacitated vehicle routing problem with timing windows using rollouts and MAX-SAT