Solving, a stochastic berth allocation problem using a hybrid sequence pair-based simulated annealing algorithm

被引:18
作者
Mohammadi, Mohammad [1 ]
Forghani, Kamran [2 ,3 ]
机构
[1] Kharazmi Univ, Fac Engn, Dept Ind Engn, Tehran, Iran
[2] German Univ Technol Oman, Dept Logist Tourism & Serv Management, Muscat, Oman
[3] Amirkabir Univ Technol, Dept Ind Engn, Tehran, Iran
关键词
Berth allocation; stochastic optimization; sequence pair; scheduling; simulated annealing; CONTAINER TERMINALS; PLACEMENT; MODEL;
D O I
10.1080/0305215X.2018.1552268
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
In this article, a continuous berth allocation problem is studied with stochastic ship arrival and handling times. The objective is to minimize a weighted sum of the expected waiting costs, berthing deviation costs and expected overtime costs. The sequence pair representation is utilized to project the solution space of the problem into two permutations. Then, a scenario-based method is used to capture the uncertainty. To effectively solve the problem over the sequence pair solution space, a simulated annealing is combined with two algorithms. One of the algorithms is used to determine the berthing positions and the other one is used to determine the berthing times. Computational experiments are conducted to evaluate the performance of the solution method and to verify the advantages of the proposed stochastic approach. The results indicate that the proposed methodology is both efficient and effective.
引用
收藏
页码:1810 / 1828
页数:19
相关论文
共 28 条
[1]   Robust berth scheduling at marine container terminals via hierarchical optimization [J].
Golias, Mihalis ;
Portal, Isabel ;
Konur, Dincer ;
Kaisar, Evangelos ;
Kolomvos, Georgios .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :412-422
[2]   A bi-objective berth allocation formulation to account for vessel handling time uncertainty [J].
Golias, Mihalis M. .
MARITIME ECONOMICS & LOGISTICS, 2011, 13 (04) :419-441
[3]   A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time [J].
Han, Xiao-le ;
Lu, Zhi-qiang ;
Xi, Li-feng .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 207 (03) :1327-1340
[4]   Robust cyclic berth planning of container vessels [J].
Hendriks, Maarten ;
Laumanns, Marco ;
Lefeber, Erjen ;
Udding, Jan Tijmen .
OR SPECTRUM, 2010, 32 (03) :501-517
[5]   Efficient planning of berth allocation for container terminals in Asia [J].
Imai, A ;
Nagaiwa, K ;
Tat, CW .
JOURNAL OF ADVANCED TRANSPORTATION, 1997, 31 (01) :75-94
[6]   Improved formulations and an Adaptive Large Neighborhood Search heuristic for the integrated berth allocation and quay crane assignment problem [J].
Iris, Cagatay ;
Pacino, Dario ;
Ropke, Stefan .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 105 :123-147
[7]   Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results [J].
Iris, Cagatay ;
Pacino, Dario ;
Ropke, Stefan ;
Larsen, Allan .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2015, 81 :75-97
[8]   The berth allocation problem with stochastic vessel handling times [J].
Karafa, Jeffery ;
Golias, Mihalis M. ;
Ivey, Stephanie ;
Saharidis, Georgios K. D. ;
Leonardos, Nikolaos .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 65 (1-4) :473-484
[9]   Berth scheduling by simulated annealing [J].
Kim, KH ;
Moon, KC .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2003, 37 (06) :541-560
[10]   Handling precedence constraints in scheduling problems by the sequence pair representation [J].
Kozik, Andrzej .
JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (02) :445-472