A variable neighborhood search for Open Vehicle Routing Problem

被引:6
作者
Ozcetin, Erdener [1 ]
Ozturk, Gurkan [2 ]
机构
[1] Hitit Univ, Fac Engn, Dept Ind Engn, Corum, Turkey
[2] Eskisehir Tech Univ, Fac Engn, Dept Ind Engn, Eskisehir, Turkey
关键词
meta-heuristic algorithms; open vehicle routing algorithm (OVRP); variable neighborhood search; ALGORITHM; TAXONOMY;
D O I
10.1002/cpe.7598
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this study, the Open Vehicle Routing Problem, which the companies widely employ in practice using third-party logistics services, is discussed. This problem is in the class of high-dimensional and complex optimization problems. A three-phase Variable Neighborhood Search Algorithm was proposed to solve large-scale problems efficiently. In this proposed method, eight different neighborhoods are used, four within the route and four between the routes. In addition to this, wise shaking strategies are designed to escape local optimal solutions. The method's performance was tested on literature test instances and comparatively reported its competitiveness.
引用
收藏
页数:13
相关论文
共 44 条
[1]   An improved tabu search algorithm for solving heterogeneous fixed fleet open vehicle routing problem with time windows [J].
Ahmed, Zakir Hussain ;
Yousefikhoshbakht, Majid .
ALEXANDRIA ENGINEERING JOURNAL, 2023, 64 :349-363
[2]  
[Anonymous], PASSMARK CPU COMP
[3]   An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries [J].
Avci, Mustafa ;
Topaloglu, Seyda .
COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 83 :15-29
[4]   Promoting Australian regional airports with subsidy schemes: Optimised downstream logistics using vehicle routing problem [J].
Babagolzadeh, Mahla ;
Zhang, Yahua ;
Abbasi, Babak ;
Shrestha, Anup ;
Zhang, Anming .
TRANSPORT POLICY, 2022, 128 :38-51
[5]   The offshore wind farm array cable layout problem: a planar open vehicle routing problem [J].
Bauer, Joanna ;
Lysgaard, Jens .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2015, 66 (03) :360-368
[6]   Optimal Vehicle Routing with Lower and Upper Bounds on Route Durations [J].
Bektas, Tolga ;
Lysgaard, Jens .
NETWORKS, 2015, 65 (02) :166-179
[7]   A tabu search algorithm for the open vehicle routing problem [J].
Brandao, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 157 (03) :552-564
[8]   Rich Vehicle Routing Problem: Survey [J].
Caceres-Cruz, Jose ;
Arias, Pol ;
Guimarans, Daniel ;
Riera, Daniel ;
Juan, Angel A. .
ACM COMPUTING SURVEYS, 2015, 47 (02)
[9]  
Christofides N., 1979, Combinatorial optimization, P315
[10]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&