Optimizing Continuous Berth Allocation by Immune Algorithm
The continuous berth allocation problem (BAPC) solves the BAP with continuous berth space and continuous time to optimize the utilization of space and time of the ports. A nonlinear programming (NLP) model is built and an immune algorithm (IA) is proposed to solve it. The effects of the number of vessels, the berth space length and the length of planning time are well controlled so that the approach can handle supper large-scale BAP with promising performance. The proposed model and algorithm can be embedded into berth scheduling modules to provide a fast and flexible solution for real-world BAPC to improve the port efficiency.
Transportation Continuous berth allocation problem Non-linear programming Immune evolutionary algorithm Container port
Zhi-Hua Hu Xiao-Long Han Yi-Zhong Ding
Logistics Research Center Shanghai Maritime University Shanghai 200135,China
国际会议
上海
英文
2446-2450
2009-11-20（万方平台首次上网日期，不代表论文的发表时间）