A robust optimization approach to the integrated berth allocation and quay crane assignment problem |
| |
| Institution: | 1. School of Mathematical Sciences, Inner Mongolia University, Hohhot 010021, PR China;2. Institute of Transportation Engineering, Inner Mongolia University, Hohhot 010070, PR China;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;1. Technical University of Denmark, Department of Transport, Denmark;2. Technical University of Denmark, Department of Management Engineering, Denmark |
| |
| Abstract: | This paper investigates the integrated berth allocation and quay crane assignment problem in container terminals. A deterministic model is formulated by considering the setup time of quay cranes. However, data uncertainties widely exist, and it may cause the deterministic solution to be infeasible. To handle the uncertainties, a robust optimization model is established. Furthermore, to control the level of conservativeness, another robust optimization model with the price constraints is proposed. A genetic algorithm and an insertion heuristic algorithm are suggested to obtain near optimal solutions. Computational experiments indicate that the presented models and algorithms are effective to solve the problems. |
| |
| Keywords: | Berth allocation Quay crane assignment Robust optimization Price constraints Genetic algorithm Insertion heuristic algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
