An Optimal Routing Algorithm for a Transfer Crane in Port Container Terminals
Transportation Science
A tabu search heuristic for the quay crane scheduling problem
Journal of Scheduling
A fast heuristic for quay crane scheduling with interference constraints
Journal of Scheduling
An efficient genetic algorithm for solving the quay crane scheduling problem
Expert Systems with Applications: An International Journal
Hybrid evolutionary computation methods for quay crane scheduling problems
Computers and Operations Research
Hybrid Estimation of Distribution Algorithm for the Quay Crane Scheduling Problem
Applied Soft Computing
| Hi-index | 12.05 |
The demand for the maritime transportation has significantly increased over the past 20years due to the rapid pace of globalization. Terminal managers confront the challenge in establishing the appropriate quay crane schedule to achieve the earliest departure time of ship and provide efficient service. In general, quay crane schedule problems include two main issues (1) the allocation of quay cranes to handle the discharging and loading operations, and (2) the service sequence of ship bays in a vessel of each quay crane. Traditionally, the terminal planners determine the quay crane schedule based on their experience and own judgment. In addition, the interference among cranes and the increased in ship size further magnify its difficulty dramatically. Accordingly, this paper proposed a modified genetic algorithm to deal with the problem. To test the optimization reliability of the proposed algorithm, a set of well known benchmarking problem is solved, and the results obtained are being compared with other well known existing algorithms. The comparison demonstrates that the proposed algorithm performs as good as many existing algorithms and obtains better solutions than the best known ones in certain instances. In addition, the computational time(s) required are significantly much lesser, allowing it to be more applicable in practical situation.