Use of Concentration Set in Tabu Search for Routing Problems
Keywords:
Mixed Routing Problems, Heterogeneous Fleet, Metaheuristics, Tabu Search, Intensification, Heuristic ConcentrationAbstract
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.
Publication Facts
Metric
This article
Other articles
Peer reviewers
0
2.4
Reviewer profiles N/A
Author statements
Author statements
This article
Other articles
Data availability
N/A
16%
External funding
N/A
32%
Competing interests
N/A
11%
Metric
This journal
Other journals
Articles accepted
4%
33%
Days to publication
8514
145
Indexed in
-
—
- Editor & editorial board
- profiles
- Academic society
- N/A
- Publisher
- UMA Editorial. Universidad de Málaga
To learn about these publication facts, click 
PF is maintained by the Public Knowledge Project
Downloads
Published
2001-01-01
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. Retrieved from https://revistas.uma.es/index.php/recta/article/view/19752
Issue
Section
Artículos
