Ant colony system for solving Quay Crane Scheduling Problem in container terminal

This chapter presents a novel hybrid algorithm for the quay crane scheduling problem (QCSP). QCSP consists of scheduling a sequence of unloading and loading movements for cranes assigned to a vessel, minimizing the total completion time of all the tasks. The proposed algorithm integrates two well-known metaheuristics: Greedy Randomized Adaptive Search Procedure and Ant Colony System; it also incorporates a repositioning strategy of idle cranes to reduce the interference generated by the quay cranes. The experimental results show that the proposed method is able to find quality solutions in short times. In experiments reported in the literature with crafted instances of QCSP, heuristic running time varies from seconds in small instances to hours in instances of medium size. Currently, the industry requirements are up to a maximum of approximately five minutes. The hybrid algorithm presented in this chapter allows addressing these requirements, by finding good quality solutions in significantly shorter time for larger problems, which represents an advantage in real environments.

Download Full-text

Simulation optimization based ant colony algorithm for the uncertain quay crane scheduling problem

International Journal of Industrial Engineering Computations ◽

10.5267/j.ijiec.2018.2.002 ◽

2019 ◽

pp. 111-132 ◽

Cited By ~ 2

Author(s):

Naoufal Rouky ◽

Mohamed Nezar Abourraja ◽

Jaouad Boukachour ◽

Dalila Boudebous ◽

Ahmed El Hilali Alaoui ◽

...

Keyword(s):

Ant Colony Algorithm ◽

Simulation Optimization ◽

Ant Colony ◽

Scheduling Problem ◽

Quay Crane Scheduling ◽

Crane Scheduling

Download Full-text

Review on the Berth Allocation and Quay Cranes Assignment Problems in Container Terminal

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.587-589.1789 ◽

2014 ◽

Vol 587-589 ◽

pp. 1789-1792

Author(s):

Yong Liang Zhou ◽

Ri Dong Wang ◽

Qing Yu Zhao ◽

Jin Xin Cao

Keyword(s):

Container Terminal ◽

Recent Decade ◽

Scheduling Problem ◽

Berth Allocation ◽

Quay Crane Scheduling ◽

Assignment Problems ◽

Crane Scheduling ◽

Quay Cranes ◽

Container Ports

In recent decade, containers become an important part of the world's economy. With the growth in offshore trade, problems about container and port are attention by research scholars in many countries. In the study on the problem in container ports, Berth Allocation and Quay Crane Scheduling problem are very important; optimization of the two problems can improve the efficient of container ports. In this paper, we describe and classify the main Berth Allocation Processes and Quay Crane Scheduling and present a survey of methods for their single optimization and integrate optimization.

Download Full-text

Planning of one-way quay cranes using the genetic algorithm

SHS Web of Conferences ◽

10.1051/shsconf/202111907005 ◽

2021 ◽

Vol 119 ◽

pp. 07005

Author(s):

Sanaa Aidi ◽

Imane Torbi ◽

Mohamed Mazouzi ◽

Imad Belassiria

Keyword(s):

Essential Role ◽

Container Terminal ◽

Optimal Time ◽

Scheduling Problem ◽

Quay Crane Scheduling ◽

Crane Scheduling ◽

Quay Cranes ◽

The One ◽

Container Terminal Management ◽

Special Strategy

The quay crane scheduling problem plays an essential role in the port container terminal management paradigm, as it is closely related to the berthing time of ships. In this article, we focus on the quay crane scheduling problem based on a special strategy, which forces the quay crane to move in one direction during the process of unloading and loading the containers. The scheduling problem that arises when this strategy is applied is called the one-way scheduling problem of quay cranes in the literature. In this article, we seek a mathematical formula for the unidirectional scheduling problem of quay cranes that can be easily solved by genetic algorithms. This algorithm provides us with the best combination of containers to unload and load at the optimal time.

Download Full-text