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

共 50 条

[21] An effective tabu search for vehicle routing problem with pickup and delivery service
Li Yunyao
Liu Changshi
ADVANCED MATERIALS SCIENCE AND TECHNOLOGY, PTS 1-2, 2011, 181-182 : 760 - 764
[22] Indirect search for the vehicle routing problem with pickup and delivery and time windows
Ulrich Derigs
Thomas Döhmer
OR Spectrum, 2008, 30 : 149 - 165
[23] Indirect search for the vehicle routing problem with pickup and delivery and time windows
Derigs, Ulrich
Doehmer, Thomas
OR SPECTRUM, 2008, 30 (01) : 149 - 165
[24] A hybrid tabu search for multi-depots collaborative vehicle routing problem with simultaneous pickup and delivery
Li, Jin
Zhang, Jianghua
Journal of Convergence Information Technology, 2012, 7 (21) : 416 - 425
[25] A HYBRID ALGORITHM, BASED ON ITERATED LOCAL SEARCH AND GENIUS, FOR THE VEHICLE ROUTING PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY
Mine, Marcio Tadayuki
Alves Silva, Matheus de Souza
Subramanian, Anand
Ochi, Luiz Satoru
Freitas Souza, Marcone Jamilson
PROCEEDINGS ICIL'2010: INTERNATIONAL CONFERENCE ON INDUSTRIAL LOGISTICS - LOGISTICS AND SUSTAINABILITY, 2010, : 199 - 206
[26] A hybrid metaheuristic algorithm based on iterated local search for vehicle routing problem with simultaneous pickup and delivery
Oztas, Tayfun
Tus, Aysegul
EXPERT SYSTEMS WITH APPLICATIONS, 2022, 202
[27] A review of vehicle routing with simultaneous pickup and delivery
Koc, Cagri
Laporte, Gilbert
Tukenmez, Ilknur
COMPUTERS & OPERATIONS RESEARCH, 2020, 122
[28] Memetic search for vehicle routing with simultaneous pickup-delivery and time windows
Liu, Shengcai
Tang, Ke
Yao, Xin
Tang, Ke (tangk3@sustech.edu.cn), 1600, Elsevier B.V. (66):
[29] Memetic search for vehicle routing with simultaneous pickup-delivery and time windows
Liu, Shengcai
Tang, Ke
Yao, Xin
SWARM AND EVOLUTIONARY COMPUTATION, 2021, 66
[30] Delivery Vehicle Routing Problem with Simultaneous Delivery and Pickup in E-commerce Environment
Zheng Jiajia
Liu Guorong
Gu Zhenyu
Bai Xiaohui
2017 29TH CHINESE CONTROL AND DECISION CONFERENCE (CCDC), 2017, : 5728 - 5733

← 1 2 3 4 5 →