Range-based truck-state transition modeling method for foldable container drayage services

被引：35

作者：

Zhang, Ruiyou ^{[1
]}

Zhao, Haishu ^{[1
]}

Moon, Ilkyeong ^{[2
,3
]}

机构：

[1] Northeastern Univ, Coll Informat Sci & Engn, Shenyang 110819, Liaoning, Peoples R China

[2] Seoul Natl Univ, Dept Ind Engn, Seoul 08826, South Korea

[3] Seoul Natl Univ, Inst Ind Syst Innovat, Seoul 08826, South Korea

来源：

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW | 2018年 / 118卷

基金：

新加坡国家研究基金会; 中国国家自然科学基金;

关键词：

Foldable container; Container transportation; Truck state transition; Reactive tabu search; REACTIVE TABU SEARCH; VEHICLE-ROUTING PROBLEM; TRANSPORTATION PROBLEM; STANDARD CONTAINERS; DELIVERY PROBLEM; TIME WINDOWS; ALGORITHM; OPTIMIZATION; CONSTRAINTS; PICKUP;

D O I：

10.1016/j.tre.2018.07.011

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

Manufacturing technologies of foldable containers have almost matured. The use of foldable containers might save transportation costs; however, incorporating them into drayage services also creates great challenges. The foldable container drayage (FCD) problem is formulated as a sequence-dependent multiple traveling salesman problem with time windows using a rangebased truck state transition method. An improved reactive tabu search algorithm is designed and validated to solve the FCD problem. The methodology is evaluated extensively on the basis of randomly generated instances. Compared to the use of standard containers, the use of four-in-one foldable containers can save approximately 10% on transportation costs.

引用

页码：225 / 239

页数：15

共 38 条

[1] Service type assignment and container routing with transit time constraints and empty container repositioning for liner shipping service networks
Akyuz, M. Hakan
Lee, Chung-Yee
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2016, 88 : 46 - 71
[2] Battiti R., 1994, ORSA Journal on Computing, V6, P126, DOI 10.1287/ijoc.6.2.126
[3] The multiple traveling salesman problem: an overview of formulations and solution procedures
Bektas, T
[J]. OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03): : 209 - 219
[4] Integrated planning of loaded and empty container movements
Braekers, Kris
Caris, An
Janssens, Gerrit K.
[J]. OR SPECTRUM, 2013, 35 (02) : 457 - 478
[5] A local search heuristic for the pre- and end-haulage of intermodal container terminals
Caris, A.
Janssens, G. K.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (10) : 2763 - 2772
[6] An attribute-decision model for cross-border drayage problem
Cheung, Raymond K.
Shi, Ning
Powell, Warren B.
Simao, Hugo P.
[J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2008, 44 (02) : 217 - 234
[7] Development of mathematical models for the container road transportation in Korean trucking industries
Chung, Ki Ho
Ko, Chang Seong
Shin, Jae Young
Hwang, Hark
Kim, Kap Hwan
[J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2007, 53 (02) : 252 - 262
[8] Dynamic approach to solve the daily drayage problem with transit time uncertainty
Escudero, Alejandro
Munuzuri, Jesus
Guadix, Jose
Arango, Carlos
[J]. COMPUTERS IN INDUSTRY, 2013, 64 (02) : 165 - 175
[9] A model for a multi-size inland container transportation problem
Funke, Julia
Kopfer, Herbert
[J]. TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 89 : 70 - 85
[10] Glover F., 1989, ORSA Journal on Computing, V1, P190, DOI [10.1287/ijoc.2.1.4, 10.1287/ijoc.1.3.190]

← 1 2 3 4 →