An optimization heuristic for the berth scheduling problem |
| |
Authors: | Yusin Lee Chuen-Yih Chen |
| |
Affiliation: | 1. Department of Civil Engineering, National Cheng Kung University, 1 University Road, Tainan 701, Taiwan;2. Department of Aviation and Maritime Management, Chang Jung Christian University, Tainan, Taiwan |
| |
Abstract: | Berths are among the most important resources in a port. In this research we present an optimization-based approach for the berth scheduling problem, which is to determine the berthing time and space for each incoming ship. The neighborhood-search based heuristic treats the quay as a continuous space. In additional to basic physical requirements, this model takes several factors important in practice into consideration, including the first-come-first-served rule, clearance distance between ships, and possibility of ship shifting. Computational experience is provided. |
| |
Keywords: | Logistics Berthing Threshold accepting Integer programming Optimization |
本文献已被 ScienceDirect 等数据库收录! |
|