A follow-up survey of berth allocation and quay crane scheduling problems in container terminals

European Journal of Operational Research - Tập 244 - Trang 675-689 - 2015
Christian Bierwirth1, Frank Meisel2
1School of Economics and Business, Martin-Luther-University Halle-Wittenberg, Gr. Steinstr. 73, 06108 Halle, Germany
2Faculty of Business, Economics and Social Sciences, Christian-Albrechts-University Kiel, Olshausenstr. 40, 24098 Kiel, Germany

Tài liệu tham khảo

Angeloudis, 2011, A review of container terminal simulation models, Maritime Policy & Management, 38, 523, 10.1080/03088839.2011.597448 Arango, 2011, Berth allocation planning in Seville inland port by simulation and optimisation, Advanced Engineering Informatics, 25, 452, 10.1016/j.aei.2011.05.001 Aras, 2014, Simultaneous optimization of berth allocation, quay crane assignment and quay crane scheduling problems in container terminals, 101 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 Blazewicz, 2011, Berth and quay crane allocation: A moldable task scheduling model, Journal of the Operational Research Society, 62, 1189, 10.1057/jors.2010.54 Boysen, 2012, Determining crane areas for balancing workload among interfering and noninterfering cranes, Naval Research Logistics, 59, 656, 10.1002/nav.21512 Buhrkal, 2011, Models for the discrete berth allocation problem: A computational comparison, Transportation Research Part E: Logistics and Transportation Review, 47, 461, 10.1016/j.tre.2010.11.016 Cao, 2010, Integrated quay crane and yard truck schedule problem in container terminals, Tsinghua Science and Technology, 15, 467, 10.1016/S1007-0214(10)70089-4 Carlo, H. J., Vis, I. F. A. Roodbergen, K. J. (2013). Seaside operations in container terminals: Literature overview, trends, and research directions. Flexible Services and Manufacturing Journal, 1–39. doi: 10.1007/s10696-013-9178-3 Carlo, 2014, Storage yard operations in container terminals: Literature overview, trends, and research directions, European Journal of Operational Research, 235, 412, 10.1016/j.ejor.2013.10.054 Carlo, 2014, Transport operations in container terminals: Literature overview, trends, research directions and classification scheme, European Journal of Operational Research, 236, 1, 10.1016/j.ejor.2013.11.023 Chang, 2010, Integrating berth allocation and quay crane assignments, Transportation Research Part E: Logistics and Transportation Review, 46, 975, 10.1016/j.tre.2010.05.008 Chen, 2011, Heuristics for quay crane scheduling at indented berth, Transportation Research Part E: Logistics and Transportation Review, 47, 1005, 10.1016/j.tre.2011.04.004 Chen, 2012, A combinatorial benders’ cuts algorithm for the quayside operation problem at container terminals, Transportation Research Part E: Logistics and Transportation Review, 48, 266, 10.1016/j.tre.2011.06.004 Chen, 2014, An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem, European Journal of Operational Research, 232, 198, 10.1016/j.ejor.2013.06.051 Cheong, 2008, A multi-objective multi-colony ant algorithm for solving the berth allocation problem, 333, 10.1007/978-3-540-78297-1_16 Cheong, 2010, Multi-objective and prioritized berth allocation in container ports, Annals of Operations Research, 180, 63, 10.1007/s10479-008-0493-0 Choo, 2010, Multiship crane sequencing with yard congestion constraints, Transportation Science, 44, 98, 10.1287/trsc.1090.0296 Christiansen, 2013, Ship routing and scheduling in the new millennium, European Journal of Operational Research, 228, 467, 10.1016/j.ejor.2012.12.002 Chung, 2013, A workload balancing genetic algorithm for the quay crane scheduling problem, International Journal of Production Research, 51, 4820, 10.1080/00207543.2013.774489 Chung, 2012, A modified genetic algorithm for quay crane scheduling operations, Expert Systems with Applications, 39, 4213, 10.1016/j.eswa.2011.09.113 Daganzo, 1989, The crane scheduling problem, Transportation Research Part B: Methodological, 23, 159, 10.1016/0191-2615(89)90001-5 de Oliveira, 2012, Clustering search for the berth allocation problem, Expert Systems with Applications, 39, 5499, 10.1016/j.eswa.2011.11.072 de Oliveira, 2012, Clustering search heuristic for solving a continuous berth allocation problem, 49, 10.1007/978-3-642-29124-1_5 Diabat, 2014, An integrated quay crane assignment and scheduling problem, Computers & Industrial Engineering, 73, 115, 10.1016/j.cie.2013.12.012 Du, 2011, Berth allocation considering fuel consumption and vessel emissions, Transportation Research Part E: Logistics and Transportation Review, 47, 1021, 10.1016/j.tre.2011.05.011 Elwany, 2013, A heuristics-based solution to the continuous berth allocation and crane assignment problem, Alexandria Engineering Journal, 52, 671, 10.1016/j.aej.2013.09.001 Emde, 2014, The berth allocation problem with mobile quay walls: Problem definition, solution procedures, and extensions, Journal of Scheduling, 17, 289, 10.1007/s10951-013-0358-5 Expósito-Izquierdo, 2013, Hybrid estimation of distribution algorithm for the quay crane scheduling problem, Applied Soft Computing, 13, 4063, 10.1016/j.asoc.2013.05.006 Expósito-Izquierdo, 2011, An estimation of distribution algorithm for solving the quay crane scheduling problem with availability constraints, 243, 10 Expósito-Izquierdo, 2011, Variable neighbourhood search for the quay crane scheduling problem, 463 Expósito-Izquierdo, 2012, Estimation of distribution algorithm for the quay crane scheduling problem, 387, 183, 10.1007/978-3-642-24094-2_13 Fu, 2014, A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach, Expert Systems with Applications, 41, 6959, 10.1016/j.eswa.2014.05.002 Ganji, 2010, Analysis of the continuous berth allocation problem in container ports using a genetic algorithm, Journal of Marine Science and Technology, 15, 408, 10.1007/s00773-010-0095-9 Giallombardo, 2010, Modeling and solving the tactical berth allocation problem, Transportation Research Part B: Methodological, 44, 232, 10.1016/j.trb.2009.07.003 Golias, 2010, A simulation based approach to optimize berth throughput under uncertainty at marine container terminals, 1 Golias, 2011, A bi-objective berth allocation formulation to account for vessel handling time uncertainty, Maritime Economics & Logistics, 13, 419, 10.1057/mel.2011.21 Golias, 2009, Berth scheduling by customer service differentiation: A multi-objective approach, Transportation Research Part E: Logistics and Transportation Review, 45, 878, 10.1016/j.tre.2009.05.006 Golias, 2010, A lamda-optimal based heuristic for the berth scheduling problem, Transportation Research Part C: Emerging Technologies, 18, 794, 10.1016/j.trc.2009.07.001 Golias, 2010, A multi-objective decision and analysis approach for the berth scheduling problem, International Journal of Information Technology Project Management, 1, 54, 10.4018/jitpm.2010100205 Golias, 2011, Berth scheduling with variable cost functions, Maritime Economics & Logistics, 13, 174, 10.1057/mel.2011.4 Golias, 2014, Robust berth scheduling at marine container terminals via hierarchical optimization, Computers & Operations Research, 41, 412, 10.1016/j.cor.2013.07.018 Golias, 2009, The berth allocation problem: Optimizing vessel arrival time, Maritime Economics & Logistics, 11, 358, 10.1057/mel.2009.12 Goodchild, 2010, Decision problems and applications of operations research at marine container terminals, 1 Goodchild, 2006, Double-cycling strategies for container ships and their effect on ship loading and unloading operations, Transportation Science, 40, 473, 10.1287/trsc.1060.0148 Guan, 2010, Analysis of berth allocation and inspection operations in a container terminal, Maritime Economics & Logistics, 12, 347, 10.1057/mel.2010.12 Guan, 2013, The crane scheduling problem: Models and solution approaches, Annals of Operations Research, 203, 119, 10.1007/s10479-010-0765-3 Guldogan, 2012, A dynamic berth allocation problem with priority considerations under stochastic nature, 74, 10.1007/978-3-642-25944-9_10 Guo, 2014, A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints, Engineering Optimization, 46, 1411, 10.1080/0305215X.2013.844803 Hakam, 2012, A genetic algorithm approach for quay crane scheduling with non-interference constraints at Narvik container terminal, International Journal of Logistics Research and Applications, 15, 269, 10.1080/13675567.2012.741220 Han, 2010, A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time, European Journal of Operational Research, 207, 1327, 10.1016/j.ejor.2010.07.018 Hansen, 2003, A note on formulations of static and dynamic berth allocation problems, Les Cahiers du GERAD, 30, 1 He, 2009, An investigation into berth allocation and quay crane assignment based on hybrid parallel genetic algorithm, 48 Hendriks, 2012, Strategic allocation of cyclically calling vessels for multi-terminal container operators, Flexible Services and Manufacturing Journal, 24, 248, 10.1007/s10696-011-9120-5 Hendriks, 2010, Robust cyclic berth planning of container vessels, OR Spectrum, 32, 501, 10.1007/s00291-010-0198-z Hendriks, 2013, Simultaneous berth allocation and yard planning at tactical level, OR Spectrum, 35, 441, 10.1007/s00291-012-0305-4 Hoffarth, 1994, Berth allocation in a container terminal—Development of a decision support system (in German), 89 Hu, 2014, Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels, Computers & Industrial Engineering, 70, 1, 10.1016/j.cie.2014.01.003 Imai, 1997, Efficient planning of berth allocation for container terminals in asia, Journal of Advanced Transportation, 31, 75, 10.1002/atr.5670310107 Imai, 2013, Marine container terminal configurations for efficient handling of mega-containerships, Transportation Research Part E: Logistics and Transportation Review, 49, 141, 10.1016/j.tre.2012.07.006 Imai, 2014, The strategic berth template problem, Transportation Research Part E: Logistics and Transportation Review, 72, 77, 10.1016/j.tre.2014.09.013 Karafa, 2013, The berth allocation problem with stochastic vessel handling times, The International Journal of Advanced Manufacturing Technology, 65, 473, 10.1007/s00170-012-4186-0 Kaveshgar, 2012, An efficient genetic algorithm for solving the quay crane scheduling problem, Expert Systems with Applications, 39, 13108, 10.1016/j.eswa.2012.05.091 Kaveshgar, 2012, Solving the quay crane scheduling problem using genetic algorithm in MATLAB, 1 Kim, 2004, A crane scheduling method for port container terminals, European Journal of Operational Research, 156, 752, 10.1016/S0377-2217(03)00133-4 Ku, D. Arthanari, T. S. (2014). On double cycling for container port productivity improvement. Annals of Operations Research, 1–16. doi: 10.1007/s10479-014-1645-z Lalla-Ruiz, 2014, Biased random key genetic algorithm for the tactical berth allocation problem, Applied Soft Computing, 22, 60, 10.1016/j.asoc.2014.04.035 Lalla-Ruiz, 2012, Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem, Engineering Applications of Artificial Intelligence, 25, 1132, 10.1016/j.engappai.2012.06.001 Lee, C.-Y., Liu, M. Chu, C. (2014). Optimal algorithm for the general quay crane double-cycling problem. Transportation Science. doi: 10.1287/trsc.2014.0563 Lee, 2010, An improved approach for quay crane scheduling with non-crossing constraints, Engineering Optimization, 42, 1, 10.1080/03052150902943020 Lee, 2010, The continuous berth allocation problem: A greedy randomized adaptive search solution, Transportation Research Part E: Logistics and Transportation Review, 46, 1017, 10.1016/j.tre.2010.01.009 Lee, 2011, Quay crane scheduling for an indented berth, Engineering Optimization, 43, 985, 10.1080/0305215X.2010.532551 Lee, 2013, Feeder vessel management at container transshipment terminals, Transportation Research Part E: Logistics and Transportation Review, 49, 201, 10.1016/j.tre.2012.08.006 Lee, 2012, Terminal and yard allocation problem for a container transshipment hub with multiple terminals, Transportation Research Part E: Logistics and Transportation Review, 48, 516, 10.1016/j.tre.2011.09.004 Lee, 2010, An approximation algorithm for quay crane scheduling with handling priority in port container terminals, Engineering Optimization, 42, 1151, 10.1080/03052151003686708 Lee, 2010, Integrated discrete berth allocation and quay crane scheduling in port container terminals, Engineering Optimization, 42, 747, 10.1080/03052150903406571 Legato, 2010, Simulation-based optimization for discharge/loading operations at a maritime container terminal, OR Spectrum, 32, 543, 10.1007/s00291-010-0207-2 Legato, 2014, A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules, 4OR, 12, 123, 10.1007/s10288-013-0235-2 Legato, 2012, Modeling and solving rich quay crane scheduling problems, Computers & Operations Research, 39, 2063, 10.1016/j.cor.2011.09.025 Lehnfeld, 2014, Loading, unloading and premarshalling of stacks in storage areas: Survey and classification, European Journal of Operational Research, 239, 297, 10.1016/j.ejor.2014.03.011 Li, 2011, An integrated model for ship routing and berth allocation, International Journal of Shipping and Transport Logistics, 3, 245, 10.1504/IJSTL.2011.040797 Liang, 2011, Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning, Journal of Intelligent Manufacturing, 22, 471, 10.1007/s10845-009-0304-8 Liang, 2012, A berth allocation planning problem with direct transshipment consideration, Journal of Intelligent Manufacturing, 23, 2207, 10.1007/s10845-011-0566-9 Liang, 2009, Multiobjective hybrid genetic algorithm for quay crane scheduling in berth allocation planning, Int. J. Manufacturing Technology and Management, 16, 127, 10.1504/IJMTM.2009.021506 Lim, 1998, The berth planning problem, Operations Research Letters, 22, 105, 10.1016/S0167-6377(98)00010-8 Lin, 2014, Solving the dynamic berth allocation problem by simulated annealing, Engineering Optimization, 46, 308, 10.1080/0305215X.2013.768241 Liu, M., Zheng, F. Li, J. (2014). Scheduling small number of quay cranes with non-interference constraint. Optimization Letters, 1–10. doi: 10.1007/s11590-014-0756-4 Lu, 2011, Simultaneous berth and quay crane allocation problem in container terminal, Advanced Science Letters, 4, 2113, 10.1166/asl.2011.1533 Lu, 2012, A heuristic for the quay crane scheduling problem based on contiguous bay crane operations, Computers & Operations Research, 39, 2915, 10.1016/j.cor.2012.02.013 Mauri, 2011, A memetic algorithm for a continuous case of the berth allocation problem, 105 Meisel, 2011, The quay crane scheduling problem with time windows, Naval Research Logistics, 58, 619, 10.1002/nav.20471 Meisel, 2009, Heuristics for the integration of crane productivity in the berth allocation problem, Transportation Research Part E, 45, 196, 10.1016/j.tre.2008.03.001 Meisel, 2011, A unified approach for the evaluation of quay crane scheduling models and algorithms, Computers & Operations Research, 38, 683, 10.1016/j.cor.2010.08.001 Meisel, 2013, A framework for integrated berth allocation and crane operations planning in seaport container terminals, Transportation Science, 47, 131, 10.1287/trsc.1120.0419 Meisel, 2010, Container sequencing for quay cranes with internal reshuffles, OR Spectrum, 32, 569, 10.1007/s00291-009-0191-6 Monaco, 2011, Quay crane scheduling with time windows, one-way and spatial constraints, International Journal of Shipping and Transport Logistics, 3, 454, 10.1504/IJSTL.2011.041137 Na, 2009, Optimization of continuous berth and quay crane allocation problem in seaport container terminal, 229 Nam, 2013, A scheduling problem for a novel container transport system: A case of mobile harbor operation schedule, Flexible Services and Manufacturing Journal, 25, 576, 10.1007/s10696-012-9135-6 Nguyen, 2013, Hybrid evolutionary computation methods for quay crane scheduling problems, Computers & Operations Research, 40, 2083, 10.1016/j.cor.2013.03.007 Pantuso, 2014, A survey on maritime fleet size and mix problems, European Journal of Operational Research, 235, 341, 10.1016/j.ejor.2013.04.058 Pap, 2013, Quay crane scheduling for river container terminals, 3, 285, 10.1007/978-3-642-33959-2_15 Park, 2003, A scheduling method for berth and quay cranes, OR Spectrum, 25, 1, 10.1007/s00291-002-0109-z Raa, 2011, An enriched model for the integrated berth allocation and quay crane assignment problem, Expert Systems with Applications, 38, 14136 Rashidi, 2013, Novel constraints satisfaction models for optimization problems in container terminals, Applied Mathematical Modelling, 37, 3601, 10.1016/j.apm.2012.07.042 Robenek, 2014, A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports, European Journal of Operational Research, 235, 399, 10.1016/j.ejor.2013.08.015 Rodriguez-Molins, 2012, A genetic algorithm for berth allocation and quay crane assignment, 7637, 601, 10.1007/978-3-642-34654-5_61 Rodriguez-Molins, 2014, A genetic algorithm for robust berth allocation and quay crane assignment, Progress in Artificial Intelligence, 2, 177, 10.1007/s13748-014-0056-3 Rodriguez-Molins, 2014, A GRASP-based metaheuristic for the berth allocation problem and the quay crane assignment problem by managing vessel cargo holds, Applied Intelligence, 40, 273, 10.1007/s10489-013-0462-4 Safaei, 2010, An integrated storage space and berth allocation problem in a container terminal, International Journal of Mathematics in Operational Research, 2, 674, 10.1504/IJMOR.2010.035494 Saharidis, 2010, The berth scheduling problem with customer differentiation: A new methodological approach based on hierarchical optimization, The International Journal of Advanced Manufacturing Technology, 46, 377, 10.1007/s00170-009-2068-x Salido, 2011, Integrated intelligent techniques for remarshaling and berthing in maritime terminals, Advanced Engineering Informatics, 25, 435, 10.1016/j.aei.2010.10.001 Salido, 2012, A decision support system for managing combinatorial problems in container terminals, Knowledge-Based Systems, 29, 63, 10.1016/j.knosys.2011.06.021 Shin, 2013, Container loading and unloading scheduling for a mobile harbor system: A global and local search method, Flexible Services and Manufacturing Journal, 25, 557, 10.1007/s10696-012-9134-7 Silva, 2011, Resolution of the berth allocation problem through a heuristic model based on genetic algorithms, 469 Song, 2012, Study on berth planning problem in a container seaport: Using an integrated programming approach, Computers & Industrial Engineering, 62, 119, 10.1016/j.cie.2011.08.024 Stahlbock, 2008, Operations research at container terminals: A literature update, OR Spectrum, 30, 1, 10.1007/s00291-007-0100-9 Steenken, 2004, Container terminal operation and operations research—A classification and literature review, OR Spectrum, 26, 3, 10.1007/s00291-003-0157-z Tang, 2014, Modeling and solution of the joint quay crane and truck scheduling problem, European Journal of Operational Research, 236, 978, 10.1016/j.ejor.2013.08.050 Ting, 2014, Particle swarm optimization algorithm for the berth allocation problem, Expert Systems with Applications, 41, 1543, 10.1016/j.eswa.2013.08.051 Tran, N. K. Haasis, H.-D. (2013). Literature survey of network optimization in container liner shipping. Flexible Services and Manufacturing Journal. doi: 10.1007/s10696-013-9179-2 Türkoğulları, 2014, Optimal berth allocation and time-invariant quay crane assignment in container terminals, European Journal of Operational Research, 235, 88, 10.1016/j.ejor.2013.10.015 Umang, 2011, The berth allocation problem in bulk ports, 1 Umang, 2013, Exact and heuristic methods to solve the berth allocation problem in bulk ports, Transportation Research Part E: Logistics and Transportation Review, 54, 14, 10.1016/j.tre.2013.03.003 Unsal, 2013, Constraint programming approach to quay crane scheduling problem, Transportation Research Part E: Logistics and Transportation Review, 59, 108, 10.1016/j.tre.2013.08.006 Ursavas, 2014, A decision support system for quayside operations in a container terminal, Decision Support Systems, 59, 312, 10.1016/j.dss.2014.01.003 Vacca, 2013, An exact algorithm for the integrated planning of berth allocation and quay crane assignment, Transportation Science, 47, 148, 10.1287/trsc.1120.0428 Vis, 2010, Performance analysis of berth configurations at container terminals, OR Spectrum, 32, 453, 10.1007/s00291-010-0201-8 Vis, 2003, Transshipment of containers at a container terminal: An overview, European Journal of Operational Research, 147, 1, 10.1016/S0377-2217(02)00293-X Wang, 2012, Multi resource scheduling problem based on an improved discrete particle swarm optimization, Physics Procedia, 25, 576, 10.1016/j.phpro.2012.03.128 Wang, 2009, A case study of genetic algorithms for quay crane scheduling, 214, 119, 10.1007/978-3-540-92814-0_19 Wang, 2011, A quay crane scheduling algorithm considering the workload of yard cranes in a container yard, Journal of Intelligent Manufacturing, 22, 459, 10.1007/s10845-009-0303-9 Wiese, 2009 Woo, 2012, Seaport research: A decadal analysis of trends and themes since the 1980s, Transport Reviews, 32, 351, 10.1080/01441647.2012.660996 Xu, 2012, Berth allocation with time-dependent physical limitations on vessels, European Journal of Operational Research, 216, 47, 10.1016/j.ejor.2011.07.012 Xu, 2012, Robust berth scheduling with uncertain vessel delay and handling time, Annals of Operations Research, 192, 123, 10.1007/s10479-010-0820-0 Yang, 2012, An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal, Computers & Industrial Engineering, 63, 243, 10.1016/j.cie.2012.03.004 Yang, 2012, The influence of the quay crane traveling time for the quay crane scheduling problem, II, 1298 Yi, 2012, Model and heuristic algorithm for quay crane scheduling at container terminal, 1054 Zeng, 2011, Disruption management model and its algorithms for berth allocation problem in container terminals, International Journal of Innovative Computing, Information and Control, 7, 2763 Zeng, 2011, Disruption recovery model for berth and quay crane scheduling in container terminals, Engineering Optimization, 43, 967, 10.1080/0305215X.2010.528411 Zhang, 2010, The allocation of berths and quay cranes by using a sub-gradient optimization technique, Computers & Industrial Engineering, 58, 40, 10.1016/j.cie.2009.08.002 Zhang, 2009, Maximizing the number of dual-cycle operations of quay cranes in container terminals, Computers & Industrial Engineering, 56, 979, 10.1016/j.cie.2008.09.008 Zhang, 2008, On-line scheduling with non-crossing constraints, Operations Research Letters, 36, 579, 10.1016/j.orl.2008.04.005 Zhen, 2012, A bi-objective model for robust berth allocation scheduling, Computers & Industrial Engineering, 63, 262, 10.1016/j.cie.2012.03.003 Zhen, 2011, An integrated model for berth template and yard template planning in transshipment hubs, Transportation Science, 45, 483, 10.1287/trsc.1100.0364 Zhen, 2011, A decision model for berth allocation under uncertainty, European Journal of Operational Research, 212, 54, 10.1016/j.ejor.2011.01.021 Zhou, 2008, Study on berth and quay-crane allocation under stochastic environments in container terminal, Systems Engineering - Theory & Practice, 28, 161, 10.1016/S1874-8651(09)60001-6 Zhu, 2006, Crane scheduling with non-crossing constraint, Journal of the Operational Research Society, 57, 1464, 10.1057/palgrave.jors.2602110