A hybrid search method for the vehicle routing problem with time windows

被引：45

作者：

Brandao de Oliveira, Humberto Cesar ^{[2
]}

Vasconcelos, Germano Crispim ^{[1
]}

机构：

[1] Univ Fed Pernambuco, Ctr Informat, BR-50732970 Recife, PE, Brazil

[2] Univ Fed Alfenas, Dept Exact Sci, BR-37130000 Alfenas, MG, Brazil

来源：

ANNALS OF OPERATIONS RESEARCH | 2010年 / 180卷 / 01期

关键词：

Vehicle routing problems; Hybrid systems; Optimization; Simulated annealing; ALGORITHMS;

D O I：

10.1007/s10479-008-0487-y

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

Vehicle Routing Problems have been extensively analyzed to reduce transportation costs. More particularly, the Vehicle Routing Problem with Time Windows (VRPTW) imposes the period of time of customer availability as a constraint, a common characteristic in real world situations. Using minimization of the total distance as the main objective to be fulfilled, this work implements an efficient algorithm which associates non-monotonic Simulated Annealing to Hill-Climbing and Random Restart. The algorithm is compared to the best results published in the literature for the 56 Solomon instances and it is shown how statistical methods can be used to boost the performance of the method.

引用

页码：125 / 144

页数：20

共 50 条

[41] A hybrid genetic algorithm for the electric vehicle routing problem with time windows
Liu, Qixing
Xu, Peng
Wu, Yuhu
Shen, Tielong
[J]. CONTROL THEORY AND TECHNOLOGY, 2022, 20 (02) : 279 - 286
[42] Scatter search for the fleet size and mix vehicle routing problem with time windows
Belfiore, Patricia Prado
Lopes Favero, Luiz Paulo
[J]. CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2007, 15 (04) : 351 - 368
[43] An Improved Variable Neighborhood Search for the Open Vehicle Routing Problem with Time Windows
Redi, A. A. N. Perwira
Maghfiroh, Meilinda F. N.
Yu, Vincent F.
[J]. 2013 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM 2013), 2013, : 1641 - 1645
[44] A variable neighborhood search for the multi depot vehicle routing problem with time windows
Polacek, M
Hartl, RF
Doerner, K
[J]. JOURNAL OF HEURISTICS, 2004, 10 (06) : 613 - 627
[45] Scatter search for the fleet size and mix vehicle routing problem with time windows
Patrícia Prado Belfiore
Luiz Paulo Lopes Fávero
[J]. Central European Journal of Operations Research, 2007, 15 : 351 - 368
[46] Variable Neighborhood Search for a Dynamic Rich Vehicle Routing Problem with time windows
de Armas, Jesica
Melian-Batista, Belen
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2015, 85 : 120 - 131
[47] A New Tabu Search Heuristic Algorithm for the Vehicle Routing Problem with Time Windows
Qi Ming-yao
Miao Li-xin
Zhang Le
Xu Hua-yu
[J]. 2008 INTERNATIONAL CONFERENCE ON MANAGEMENT SCIENCE & ENGINEERING (15TH), VOLS I AND II, CONFERENCE PROCEEDINGS, 2008, : 1648 - +
[48] Meta-harmony search algorithm for the vehicle routing problem with time windows
Yassen, Esam Taha
Ayob, Masri
Nazri, Mohd Zakree Ahmad
Sabar, Nasser R.
[J]. INFORMATION SCIENCES, 2015, 325 : 140 - 158
[49] A tabu search algorithm for the site dependent vehicle routing problem with time windows
Cordeau, JF
Laporte, G
[J]. INFOR, 2001, 39 (03) : 292 - 298
[50] A reactive variable neighborhood search for the vehicle-routing problem with time windows
Bräysy, O
[J]. INFORMS JOURNAL ON COMPUTING, 2003, 15 (04) : 347 - 368

← 1 2 3 4 5 →