A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning

Authors:
Chengji Liang;Youfang Huang;Yang Yang
Affiliations:
Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, China;Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, China;Graduate School of Information, Production and Systems, Waseda University, 2-7 Hibikino, Wakamatsu, Kitakyushu, Fukuoka 8080135, Japan
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 1
Cited 10

Network Models and Optimization: Multiobjective Genetic Algorithm Approach

Network Models and Optimization: Multiobjective Genetic Algorithm Approach

The allocation of berths and quay cranes by using a sub-gradient optimization technique

Computers and Industrial Engineering
Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning

Journal of Intelligent Manufacturing
An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs

Transportation Science
Study on berth planning problem in a container seaport: Using an integrated programming approach

Computers and Industrial Engineering
An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal

Computers and Industrial Engineering
Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem

Engineering Applications of Artificial Intelligence
A berth allocation planning problem with direct transshipment consideration

Journal of Intelligent Manufacturing
A Framework for Integrated Berth Allocation and Crane Operations Planning in Seaport Container Terminals

Transportation Science
A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds

Applied Intelligence
A decision support system for quayside operations in a container terminal

Decision Support Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A considerable growth in worldwide container transportation needs essential optimization of terminal operations. An operation schedule for berth and quay cranes can significantly affect turnaround time of ships, which is an important objective of all schedules in a port. This paper addresses the problem of determining the berthing position and time of each ship as well as the number of quay cranes assigned to each ship. The objective of the problem is to minimize the sum of the handling time, waiting time and the delay time for every ship. We introduce a formulation for the simultaneous berth and quay crane scheduling problem. Next, we combine genetic algorithm with heuristic to find an approximate solution for the problem. Computational experiments show that the proposed approaches are applicable to solve this difficult but essential terminal operation problem.