A two-pheromone trail ant colony system--tabu search approach for the heterogeneous vehicle routing problem with time windows and multiple products

Authors:
Jair J. Cruz;Carlos D. Paternina-Arboleda;Victor Cantillo;Jairo R. Montoya-Torres
Affiliations:
Department of Industrial Engineering, Universidad del Norte, Barranquilla, Colombia;Escuela de Negocios, Universidad del Norte, Barranquilla, Colombia;Department of Civil and Environmental Engineering, Universidad del Norte, Barranquilla, Colombia;Escuela de Ciencias Económicas y Administrativas, Universidad de La Sabana, Chia, Colombia
Venue:
Journal of Heuristics
Year:
2013

Citing 15
Cited 0

Technical Note: \cal Q-Learning

Machine Learning
Tabu search

Modern heuristic techniques for combinatorial problems
A tabu search heuristic for the vehicle routing problem

Management Science
Algorithms for the vehicle routing problems with time deadlines

American Journal of Mathematical and Management Sciences - Special issue: vehicle routing 2000: advances in time windows, optimality, fast bounds, & multi-depot routing
A tabu search algorithm for the vehicle routing problem

Computers and Operations Research
The vehicle routing problem

The vehicle routing problem
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows

MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows

Journal of Heuristics
Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows

CIMCA '05 Proceedings of the International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce Vol-2 (CIMCA-IAWTIC'06) - Volume 02
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study

KES '07 Knowledge-Based Intelligent Information and Engineering Systems and the XVII Italian Workshop on Neural Networks on Proceedings of the 11th International Conference
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup

Computers and Operations Research
An ant based simulation optimization for vehicle routing problem with stochastic demands

Winter Simulation Conference
An ant colony optimization approach to solve cooperative transportation planning problems

Winter Simulation Conference
Ant colony system for optimizing vehicle routing problem with time windows (VRPTW)

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III

Quantified Score

Hi-index	0.00

Visualization

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.