Use of Concentration Set in Tabu Search for Routing Problems

Authors

  • Joaquín A Pacheco
    Spain
  • Cristina R Delgado
    Spain

Keywords:

Mixed Routing Problems, Heterogeneous Fleet, Metaheuristics, Tabu Search, Intensification, Heuristic Concentration

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

Downloads

Download data is not yet available.

References

Downloads

Published

2001-01-01

Dimensions

PlumX

Issue

Vol. 3 No. 1 (2001): Rect@. Revista Electrónica de Comunicaciones y Trabajos de ASEPUMA

Section

Artículos

How to Cite

Pacheco , J. A., & Delgado, C. R. (2001). Use of Concentration Set in Tabu Search for Routing Problems. Revista Electrónica De Comunicaciones Y Trabajos De ASEPUMA, 3(1), 49-87. https://revistas.uma.es/index.php/recta/article/view/19752