Berth allocation at indented berths for mega-containerships

DOI10.1016/J.EJOR.2006.03.034zbMATH Open1114.90004OpenAlexW2109276522MaRDI QIDQ858478FDOQ858478

Authors: Akio Imai, Etsuko Nishimura, Masahiro Hattori, Stratos Papadimitriou 

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

Recommendations

• Berth allocation planning optimization in container terminals
• Multi-objective and prioritized berth allocation in container ports
• An integrated storage space and berth allocation problem in a container terminal
• Berth allocation with time-dependent physical limitations on vessels
• Periodic and collaborative allocation of berth-yard-gate resources at container terminals
• On the berth allocation problem
• An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

zbMATH Keywords

mathematical programmingcontainer terminalcontainer transportationEberth allocationmega-containership

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Cites Work

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

Cited In (21)

• Vehicle Routing Problems and Container Terminal Operations – An Update of Research
• The berth allocation problem in terminals with irregular layouts
• Simultaneous allocation of berths and quay cranes under discrete berth situation
• Combinatorial approach to exactly solving discrete and hybrid berth allocation problem
• Differential evolution based meta-heuristic algorithm for dynamic continuous berth allocation problem
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Tactical berth allocation under uncertainty
• The berth allocation problem with mobile quay walls: problem definition, solution procedures, and extensions
• Berth allocation with time-dependent physical limitations on vessels
• A decision model for berth allocation under uncertainty considering service level using an adaptive differential evolution algorithm
• Compact ILP formulations for a class of solutions to berth allocation and quay crane scheduling problems
• Scheduling cranes at an indented berth
• Multi-objective and prioritized berth allocation in container ports
• Metaheuristic approaches for the berth allocation problem
• Robust berth scheduling with uncertain vessel delay and handling time
• Berth allocation planning in the public berth system by genetic algorithms
• Robust cyclic berth planning of container vessels
• Operations research at container terminals: a literature update
• Simultaneous berth allocation and yard planning at tactical level
• A dynamic and flexible berth allocation model with stochastic vessel arrival times
• A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858478)