Paper Info
Title
A two-pheromone trail ant colony system—tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products
Abstract
This paper considers a practical variant of the Vehicle Routing Problem (VRP) known as the Heterogeneous Vehicle Routing Problem with Time Windows and Multiple Products (HVRPTWMP). As the problem is NP-hard, the resolution approach proposed here is a sequential Ant Colony System (ACS)—Tabu Search algorithm. The approach introduces a two pheromone trail strategy to accelerate agents’ (ants) learning process. Its convergence to good solutions is given in terms of fleet size and travel time while completing tours and service to all customers. The proposed procedure uses regency and frequency memories form Tabu Search to further improve the quality of solutions. Experiments are carried out using instances from literature and show the effectiveness of this procedure.
Year
DOI
Venue
2013
https://doi.org/10.1007/s10732-011-9184-0
Journal of Heuristics
Keywords
Field
DocType
Vehicle routing,Multiple products,Time windows,Ant colony,Tabu search,Sequential algorithm
Convergence (routing),Vehicle routing problem,Mathematical optimization,Search algorithm,Ant colony,Travel time,Sequential algorithm,Tabu search,Mathematics
Journal
Volume
Issue
ISSN
19
2
1381-1231
Citations 
PageRank 
References 
7
0.46
23
Authors
4
Name
Order
Citations
PageRank
Jesús De La Cruz127126.56
Carlos D. Paternina-Arboleda2594.51
Víctor Cantillo3101.34
Jairo R. Montoya-Torres414819.47