Title :
Optimizing continuous berth allocation by immune algorithm
Author :
Hu, Zhi-Hua ; Han, Xiao-Long ; Ding, Yi-Zhong
Author_Institution :
Logistics Res. Center, Shanghai Maritime Univ., Shanghai, China
Abstract :
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.
Keywords :
algorithm theory; continuous time systems; nonlinear programming; scheduling; berth scheduling modules; berth space length; continuous berth space; continuous time optimize utilization; fast flexible solution; immune algorithm; length planning time; nonlinear programming model; optimizing continuous berth allocation; real world BAPC; supper large scale; vessel numbers; Artificial immune systems; Containers; Cranes; Evolutionary computation; Genetic programming; Immune system; Logistics; Marine vehicles; Scheduling algorithm; Transportation; Container port; Continuous berth allocation problem; Immune evolutionary algorithm; Non-linear programming; Transportation;
Conference_Titel :
Intelligent Computing and Intelligent Systems, 2009. ICIS 2009. IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-4754-1
Electronic_ISBN :
978-1-4244-4738-1
DOI :
10.1109/ICICISYS.2009.5358083
