Use of Concentration Set in Tabu Search for Routing Problems

Abstract

In this work, an algorithm is proposed for the problem of time-windowed routes with simultaneous loading and unloading, as well as a heterogeneous fleet. The algorithm is based on a Tabu Search process. What’s novel about this algorithm is the incorporation of ideas from Rosing (1997) and Rosing and ReVelle (1997) regarding the so-called Concentration Set during the intensification phase. To assess the effectiveness of both the intensification procedure and the entire algorithm, simulated instances and various libraries available online are used