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. © Springer Science+Business Media, LLC 2011.
CITATION STYLE
De La Cruz, J. J., Paternina-Arboleda, C. D., Cantillo, V., & Montoya-Torres, J. R. (2013). A two-pheromone trail ant colony system - Tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products. Journal of Heuristics, 19(2), 233–252. https://doi.org/10.1007/s10732-011-9184-0
Mendeley helps you to discover research relevant for your work.