A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning |
| |
| Authors: | Chengji Liang Youfang Huang Yang Yang |
| |
| Affiliation: | 1. Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, China;2. Graduate School of Information, Production and Systems, Waseda University, 2-7 Hibikino, Wakamatsu, Kitakyushu, Fukuoka 8080135, Japan;1. Federal University of Espírito Santo, Brazil;2. Federal University of Rio de Janeiro, Brazil;3. National Institute for Space Research, Brazil;4. CIRRELT and HEC Montréal, Canada;1. Department of Civil Engineering and Intermodal Freight Transportation Institute, University of Memphis, United States;2. Department of Ocean and Mechanical Engineering, Florida Atlantic University, United States;3. Department of Engineering Management and Systems Engineering, Missouri University of Science and Technology, United States;4. Department of Civil, Environmental and Geomatics Engineering, Florida Atlantic University, United States;5. Industrial Engineering and Optimization Laboratory, Kathikas Institute of Research and Technology, Cyprus;1. Mechanical Engineering Department, Faculty of Engineering at Shoubra, Benha University, Cairo, Egypt;2. Department of Industrial Engineering and Systems Management, Egypt-Japan University of Science and Technology (E-JUST), Alexandria, Egypt;1. Department of Industrial Engineering, Tsinghua University, Beijing 100084, China;2. Division of Logistics and Transportation, Graduate School at Shenzhen, Tsinghua University, Shenzhen 518055, China;3. Intelligent Transportation and Logistics Systems Laboratory, Tsinghua-Berkeley Shenzhen Institute, Shenzhen 518055, China |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
