Ant Colony System Algorithm for the Vehicle Routing Problem with Simultaneous Delivery and Pick-Up

被引：3

作者：

Cabrera G, Guillermo ^{[1
]}

Peralta, Felipe ^{[1
]}

机构：

[1] Pontificia Univ Catolica Valparaiso, Informat Engn Sch, Valparaiso, Chile

来源：

ICCIT: 2009 FOURTH INTERNATIONAL CONFERENCE ON COMPUTER SCIENCES AND CONVERGENCE INFORMATION TECHNOLOGY, VOLS 1 AND 2 | 2009年

关键词：

Vehicle Routing Problem with Simultaneous Pick-up and Delivery (VRPSDP); Ant Colony Systems (ACS); logistics process; HEURISTIC ALGORITHMS;

D O I：

10.1109/ICCIT.2009.264

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Due to the increased demands for distribution/redistribution, recycling and repacking, there has been a significant change in the logistics process. This article presented an Ant Colony System (ACS) algorithm to solve a Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. To solve the VRPSDP model, ACS approach is based in the pheromone strategy, inspired in the natural Ants behavior. This behavior is assigned to vehicles, which move along the route on which the pheromone intensity is strong. The ACS algorithm provides good solutions and shows that it is a competitive method related with other heuristics or meta-heuristics that have been proposed in literature.

引用

页码：1575 / 1580

页数：6

共 13 条

[1] Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery [J].

Bianchessi, Nicola ;

Righini, Giovanni .

COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (02) :578-594

[2] An improved ant system algorithm for the vehicle routing problem [J].

Bullnheimer, B ;

Hartl, RF ;

Strauss, C .

ANNALS OF OPERATIONS RESEARCH, 1999, 89 (0) :319-328

[3] Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up Fahrzeugeinsatzplanung und Redistribution: Tourenplanung mit simultaner Auslieferung und Rückholung [J].

Jan Dethloff .

OR-Spektrum, 2001, 23 (1) :79-96

[4]

Dorigo M, 2003, INT SER OPER RES MAN, V57, P251

[5] Ant colonies for the travelling salesman problem [J].

Dorigo, M ;

Gambardella, LM .

BIOSYSTEMS, 1997, 43 (02) :73-81

[6]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[7]

JIN A, 2009, COMPUTERS OPERATIONS, V36, P1693

[8]

Maniezzo V, 2004, STUD FUZZ SOFT COMP, V141, P101

[9] THE MULTIPLE VEHICLE-ROUTING PROBLEM WITH SIMULTANEOUS DELIVERY AND PICK-UP POINTS [J].

MIN, HK .

TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1989, 23 (05) :377-386

[10] A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service [J].

Montané, FAT ;

Galvao, RD .

COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (03) :595-619

← 1 2 →