A decision model for berth allocation under uncertainty

European Journal of Operational Research - Tập 212 - Trang 54-68 - 2011
Lu Zhen1, Loo Hay Lee2, Ek Peng Chew2
1School of Management, Shanghai University, Shanghai 200444, PR China
2Department of Industrial & System Engineering, National University of Singapore, Singapore 117576, Singapore

Tài liệu tham khảo

Avriel, 1970, The value of information and stochastic programming, Operations Research, 18, 947, 10.1287/opre.18.5.947 Bierwirth, 2010, A survey of berth allocation and quay crane scheduling problems in container terminals, European Journal of Operational Research, 202, 615, 10.1016/j.ejor.2009.05.031 Cordeau, 2005, Models and tabu search heuristics for the berth allocation problem, Transportation Science, 39, 526, 10.1287/trsc.1050.0120 Guan, 2004, The berth allocation problem: Models and solution methods, OR Spectrum, 26, 75, 10.1007/s00291-003-0140-8 Hansen, 2008, Variable neighborhood search for minimum cost berth allocation, European Journal of Operational Research, 191, 636, 10.1016/j.ejor.2006.12.057 Imai, 1997, Efficient planning of berthing allocation for container terminals in Asia, Journal of Advanced Transportation, 31, 75, 10.1002/atr.5670310107 Imai, 2001, The dynamic berth allocation problem for a container port, Transportation Research Part B, 35, 401, 10.1016/S0191-2615(99)00057-0 Imai, 2005, Berth allocation in a container port: Using a continuous location space approach, Transportation Research Part B, 39, 199, 10.1016/j.trb.2004.04.004 Imai, 2007, Berth allocation at intended berths for mega-containerships, European Journal of Operational Research, 179, 579, 10.1016/j.ejor.2006.03.034 Imai, 2008, The simultaneous berth and quay crane allocation problem, Transportation Research Part E, 44, 900, 10.1016/j.tre.2007.03.003 Kim, 2003, Berth scheduling by simulated annealing, Transportation Research Part B, 37, 541, 10.1016/S0191-2615(02)00027-9 Kim, 2004, A crane scheduling method for port container terminals, European Journal of Operational Research, 156, 752, 10.1016/S0377-2217(03)00133-4 Legato, 2001, Berth planning and resources optimization at a container terminal via discrete event simulation, European Journal of Operational Research, 133, 537, 10.1016/S0377-2217(00)00200-9 Lim, 1998, The berth planning problem, Operations Research Letters, 22, 105, 10.1016/S0167-6377(98)00010-8 Meisel, 2009, Heuristics for the integration of crane productivity in berth allocation problem, Transportation Research Part E, 45, 196, 10.1016/j.tre.2008.03.001 Moorthy, 2006, Berth management in container terminal: The template design problem, OR Spectrum, 28, 495, 10.1007/s00291-006-0036-5 Murty, 2005, A decision support system for operations in container terminal, Decision Support Systems, 39, 309, 10.1016/j.dss.2003.11.002 Nishimura, 2001, Berth allocation planning in the public berth system by genetic algorithms, European Journal of Operational Research, 131, 282, 10.1016/S0377-2217(00)00128-4 Park, 2002, Berth scheduling for container terminals by using a sub-gradient optimization technique, Journal of the Operational Research Society, 53, 1054, 10.1057/palgrave.jors.2601412 Park, 2003, A scheduling method for berth and quay cranes, OR Spectrum, 25, 1, 10.1007/s00291-002-0109-z Wang, 2007, A stochastic beam search for the berth allocation problem, Decision Support Systems, 42, 2186, 10.1016/j.dss.2006.06.008