A Self-adaptation Algorithm for Quay Crane Scheduling at A Container Terminal

2021-12-17

Esam Taha Yassen, Masri Ayob, Alaa Abdalqahar Jihad, Mohd Zakree Ahmad Nazri

Achieving the balance between resources reduction and profits increase represents the most important factor in real life applications. All companies (especially, transportation and distribution) work to achieve that balance that guarantees their success and continuity. However, this balance is the main challenge that faces the managers of these companies due to the fact that all these applications are complex and highly constrained and their resources are limited.

Container terminals are regarded as one of the most significant modern sea freight means of transportation, as they represent the essential connection between local markets and global customers and contrariwise. In accordance with the speedy yearly growth of transported container volume, no wonder that container terminal now represents one of the predicaments in the international chain of supply, and container terminal efficiency a significant issue for liner transportation corporations as they work on reducing their cost. The primary objective of container terminals is to attain fast movement of containers at the minimum cost possible. Quay crane scheduling problem (QCSP) is among the most significant operations related to seaport terminals. Its aim is to identify the order of tasks to be made by each quay crane. Recently, self-adaptation heuristics comprise a group of approaches that are motivated by the aim of automating the design of heuristic methods in order to solve difficult computational search problems and across different problem instances based on the search status. Accordingly, in this paper, a self-adaptation heuristic (self-H) is proposed to solve QCSP.Link

Link.....