Berth allocation at indented berths for mega-containerships

DOI10.1016/j.ejor.2006.03.034zbMath1114.90004OpenAlexW2109276522MaRDI QIDQ858478

Etsuko Nishimura, Akio Imai, Stratos Papadimitriou, Masahiro Hattori

Publication date: 9 January 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.03.034

zbMATH Keywords

mathematical programmingcontainer terminalcontainer transportationEberth allocationmega-containership

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items (20)

Tactical berth allocation under uncertainty ⋮ Scheduling cranes at an indented berth ⋮ Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems ⋮ Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation ⋮ Multi-objective and prioritized berth allocation in container ports ⋮ The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions ⋮ A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm ⋮ Berth allocation with time-dependent physical limitations on vessels ⋮ Simultaneous berth allocation and yard planning at tactical level ⋮ Vehicle Routing Problems and Container Terminal Operations – An Update of Research ⋮ The berth allocation problem in terminals with irregular layouts ⋮ Operations research at container terminals: a literature update ⋮ A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports ⋮ A dynamic and flexible berth allocation model with stochastic vessel arrival times ⋮ Robust cyclic berth planning of container vessels ⋮ Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem ⋮ Combinatorial approach to exactly solving discrete and hybrid berth allocation problem ⋮ Robust berth scheduling with uncertain vessel delay and handling time ⋮ Metaheuristic approaches for the Berth Allocation Problem ⋮ A survey of berth allocation and quay crane scheduling problems in container terminals

Cites Work

• Unnamed Item
• The berth planning problem
• A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis
• A scheduling method for Berth and Quay cranes
• Simulated annealing and genetic algorithms for scheduling products with multi-level product structure
• Optimizing ship berthing
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Berth allocation planning in the public berth system by genetic algorithms

This page was built for publication: Berth allocation at indented berths for mega-containerships