Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup

被引：13

作者：

Maquera, Gladys ^{[1
]}

Laguna, Manuel ^{[2
,3
]}

Gandelman, Dan Abensur ^{[4
]}

Sant'Anna, Annibal Parracho ^{[5
]}

机构：

[1] Univ Peruana Union, Math Educ, Lurigancho, Peru

[2] Univ Colorado, Management Sci, Boulder, CO 80309 USA

[3] Univ Colorado, Leeds Sch Business, Boulder, CO 80309 USA

[4] Univ Fed Rio de Janeiro, Elect Engn, Rio De Janeiro, Brazil

[5] Univ Fed Fluminense, Rio De Janeiro, Brazil

来源：

INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING | 2011年 / 2卷 / 02期

关键词：

Logistics; Metaheuristics; Scatter Search; Sustainability; Vehicles Routing;

D O I：

10.4018/jamc.2011040101

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

Though its origins can be traced back to 1977, the development and application of the metaheuristic Scatter Search (SS) has stayed dormant for 20 years. However, in the last 10 years, research interest has positioned SS as one of the recognizable methodologies within the umbrella of evolutionary search. This paper presents an application of SS to the problem of routing vehicles that are required both to deliver and pickup goods (VRPSDP). This specialized version of the vehicle routing problem is particularly relevant to organizations that are concerned with sustainable and environmentally-friendly business practices. In this work, the efficiency of SS is evaluated when applied to this problem. Computational results of the application to instances in the literature are presented.

引用

页码：1 / 20

页数：20

共 37 条

[1]

Ball M. O., 1995, NETWORK ROUTING HDB, V8

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