The continuous Berth Allocation Problem: A Greedy Randomized Adaptive Search Solution |
| |
Authors: | Der-Horng Lee Jiang Hang Chen Jin Xin Cao |
| |
Affiliation: | Department of Civil Engineering, National University of Singapore, Singapore |
| |
Abstract: | In this research, continuous and dynamic Berth Allocation Problem (BAP) is studied to minimize the total weighted flow time. Different from previous studies on continuous BAP, an efficient method is proposed to address the problem to identify the possible locations for next vessel in the Time-space diagram. Then two versions of Greedy Randomized Adaptive Search Procedure (GRASP) are developed to search for near optimal solutions. Both small and large scale numerical experiments are tested to examine the effectiveness of the proposed GRASPs by comparison with CPLEX and stochastic beam search, respectively. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |