A spatial parallel heuristic approach for solving very large-scale vehicle routing problems

被引：15

作者：

Tu, Wei ^{[1
,2
]}

Li, Qingquan ^{[1
,2
]}

Li, Qiuping ^{[3
]}

Zhu, Jiasong ^{[1
,2
]}

Zhou, Baoding ^{[1
,2
]}

Chen, Biyu ^{[4
]}

机构：

[1] Shenzhen Univ, Shenzhen Key Lab Spatial Smart Sensing & Serv, Coll Civil Engn, Shenzhen, Guangdong, Peoples R China

[2] Natl Adm Surveying Mapping & GeoInformat, Key Lab Geoenvironm Monitoring Coastal Zone, Shenzhen, Guangdong, Peoples R China

[3] Sun Yat Sen Univ, Sch Geog & Planning, Ctr Integrated Geog Informat Anal, Guangzhou, Guangdong, Peoples R China

[4] Wuhan Univ, State Key Lab Informat Engn Surveying Mapping & R, Wuhan, Hubei, Peoples R China

来源：

TRANSACTIONS IN GIS | 2017年 / 21卷 / 06期

基金：

美国国家科学基金会;

关键词：

Local search; logistics; parallel computing; spatial partition; vehicle routing problems; TABU SEARCH; WASTE COLLECTION; OPTIMIZATION; GIS; ALGORITHM; SYSTEM;

D O I：

10.1111/tgis.12267

中图分类号：

P9 [自然地理学]; K9 [地理];

学科分类号：

0705 ; 070501 ;

摘要：

The vehicle routing problem (VRP) is one of the most prominent problems in spatial optimization because of its broad applications in both the public and private sectors. This article presents a novel spatial parallel heuristic approach for solving large-scale VRPs with capacity constraints. A spatial partitioning strategy is devised to divide a region of interest into a set of small spatial cells to allow the use of a parallel local search with a spatial neighbor reduction strategy. An additional local search and perturbation mechanism around the border area of spatial cells is used to improve route segments across spatial cells to overcome the border effect. The results of one man-made VRP benchmark and three real-world super-large-scale VRP instances with tens of thousands of nodes verify that the presented spatial parallel heuristic approach achieves a comparable solution with much less computing time.

引用

页码：1130 / 1147

页数：18

共 50 条

[21] An Experimental Study of Large-scale Capacitated Vehicle Routing Problems
Zhuo, Er
Deng, Yunjie
Su, Zhewei
Yang, Peng
Yuan, Bo
Yao, Xin
[J]. 2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1195 - 1202
[22] A Novel Spatial-Temporal Voronoi Diagram-Based Heuristic Approach for Large-Scale Vehicle Routing Optimization with Time Constraints
Tu, Wei
Li, Qingquan
Fang, Zhixiang
Zhou, Baoding
[J]. ISPRS INTERNATIONAL JOURNAL OF GEO-INFORMATION, 2015, 4 (04) : 2019 - 2044
[23] Solving large-scale eigenvalue problems on vector parallel processors
Harrar, DL
Osborne, MR
[J]. VECTOR AND PARALLEL PROCESSING - VECPAR'98, 1999, 1573 : 100 - 113
[24] PARALLEL TECHNIQUES FOR SOLVING LARGE-SCALE TRAVELING SALESPERSON PROBLEMS
RAVIKUMAR, CP
[J]. MICROPROCESSORS AND MICROSYSTEMS, 1992, 16 (03) : 149 - 158
[25] An Evolutionary Multiobjective Route Grouping-Based Heuristic Algorithm for Large-Scale Capacitated Vehicle Routing Problems
Xiao, Jianhua
Zhang, Tao
Du, Jingguo
Zhang, Xingyi
[J]. IEEE TRANSACTIONS ON CYBERNETICS, 2021, 51 (08) : 4173 - 4186
[26] Effective heuristic for large-scale unrelated parallel machines scheduling problems
Wang, Haibo
Alidaee, Bahram
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2019, 83 : 261 - 274
[27] Shareability network based decomposition approach for solving large-scale single school routing problems
Guo, Xiaotong
Samaranayake, Samitha
[J]. TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2022, 140
[28] Solving Large-Scale Routing Optimization Problems with Networks and Only Networks
Soroka, A. G.
Meshcheryakov, A. V.
[J]. DOKLADY MATHEMATICS, 2023, 108 (SUPPL 2) : S242 - S247
[29] Solving Large-Scale Routing Optimization Problems with Networks and Only Networks
A. G. Soroka
A. V. Meshcheryakov
[J]. Doklady Mathematics, 2023, 108 : S242 - S247
[30] An Evolutionary Hyper-Heuristic Approach to the Large Scale Vehicle Routing Problem
Costa, Joao Guilherme Cavalcanti
Mei, Yi
Zhan, Mengjie
[J]. 2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 2109 - 2116

← 1 2 3 4 5 →