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

被引：30

作者：

De la Cruz, Jair J. ^{[1
]}

Paternina-Arboleda, Carlos D. ^{[2
]}

Cantillo, Victor ^{[3
]}

Montoya-Torres, Jairo R. ^{[4
]}

机构：

[1] Univ Norte, Dept Ind Engn, Barranquilla, Colombia

[2] Univ Norte, Escuela Negocios, Barranquilla, Colombia

[3] Univ Norte, Dept Civil & Environm Engn, Barranquilla, Colombia

[4] Univ La Sabana, Escuela Ciencias Econ & Adm, Chia, Cundinamarca, Colombia

来源：

JOURNAL OF HEURISTICS | 2013年 / 19卷 / 02期

关键词：

Vehicle routing; Multiple products; Time windows; Ant colony; Tabu search; Sequential algorithm; DELIVERY PROBLEM; OPTIMIZATION; ALGORITHM; PICKUP;

D O I：

10.1007/s10732-011-9184-0

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：233 / 252

页数：20