Simultaneous Allocation of Berths and Quay Cranes under Discrete Berth Situation

DOI10.1142/S0217595918500112zbMath1395.90175MaRDI QIDQ4565264

Mingyao Qi, Canrong Zhang, Lixin Miao, Tao Wu

Publication date: 11 June 2018

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Lagrangian relaxationcontainer terminalberth allocationsub-gradientcrane allocation

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items

The use of frontier techniques to identify efficient solutions for the berth allocation problem solved with a hybrid evolutionary algorithm

Cites Work

• Unnamed Item
• A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time
• A tabu search heuristic for the quay crane scheduling problem
• Berth allocation at indented berths for mega-containerships
• A survey of berth allocation and quay crane scheduling problems in container terminals
• Container terminal operation and operations research -- a classification and literature review
• Transshipment of containers at a container terminal: An overview
• A scheduling method for Berth and Quay cranes
• A crane scheduling method for port container terminals
• A fast heuristic for quay crane scheduling with interference constraints
• A queuing network model for the management of berth crane operations
• Operations research at container terminals: a literature update
• A Decision Model for Berth Allocation Under Uncertainty Considering Service Level Using an Adaptive Differential Evolution Algorithm
• Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures
• Berth scheduling for container terminals by using a sub-gradient optimization technique
• Multistage Cutting Stock Problems of Two and More Dimensions
• Berth planning and resources optimisation at a container terminal via discrete event simulation