A LEXICOGRAPHIC OPTIMIZATION APPROACH FOR BERTH SCHEDULE RECOVERY PROBLEM IN CONTAINER TERMINALS

Transport - Tập 31 Số 1 - Trang 76-83 - 2016
Qian Zhang1, Qingcheng Zeng1, Hualong Yang1
1School of Transport Management, Dalian Maritime University, China

Tóm tắt

In container terminals, the planned berth schedules often have to be revised because of disruptions caused by severe weather, equipment failures, technical problems and other unforeseen events. In this paper, the problem of berth schedule recovery is addressed to reduce the influences caused by disruptions. A multi-objective, multi-stage model is developed considering the characteristics of different customers and the trade-off of all parties involved. An approach based on the lexicographic optimization is designed to solve the model. Numerical experiments are provided to illustrate the validity of the proposed Model A and algorithms. Results indicate that the designed Model A and algorithm can tackle the berth plan recovery problem efficiently because the beneficial trade-off among all parties involved are considered. In addition, it is more flexible and feasible with the aspect of practical applications considering that the objective order can be adjusted by decision makers.

Từ khóa


Tài liệu tham khảo

10.1016/j.ejor.2006.12.045

10.1016/j.tre.2009.09.001

10.1016/j.cor.2009.03.027

10.1016/j.ejor.2010.07.018

10.1016/j.tre.2007.03.003

10.1016/j.ejor.2006.03.034

10.1016/S0191-2615(02)00023-1

10.1016/j.trb.2004.04.004

10.1109/CACSD.2002.1036925

10.1016/S0191-2615(02)00027-9

10.1007/s10489-008-0119-x

10.1007/BF02192028

10.1016/j.cie.2008.09.024

10.1080/03081060802492652

10.1007/s00158-003-0368-6

10.1016/j.tre.2008.03.001

10.1007/978-1-4615-5563-6

10.1016/S0377-2217(00)00128-4

10.1109/TCST.2007.899741

10.1016/j.ijpe.2008.08.045

10.1007/s00291-002-0109-z

10.1016/j.ast.2009.11.003

10.1016/j.fss.2006.04.009

10.1016/j.ijpe.2005.05.021

10.1016/j.cor.2004.02.001

10.1016/j.dss.2006.06.008

10.1016/j.ijpe.2006.11.013

10.1142/5632