透過您的圖書館登入
IP:18.220.98.157
  • 期刊

Research on Automatic Berth Scheduling for Yangshan Phase IV based on Genetic Algorithm

摘要


With the huge increase in the throughput of container terminals, the problem of berth scheduling is a problem that restricts the development of container terminals. To address the problem of container terminal ship berth scheduling and improve the operational efficiency of the terminal is a necessary way to reduce the operating cost of the terminal and reduce the total time of ships in port. This paper establishes a discrete berth scheduling mathematical model for improving the operational efficiency of Yangshan Phase IV automated terminal on the basis of the ship scheduling system of Yangshan Phase IV automated terminal, aiming at the shortest total time in port for all ships. The optimal solution to the mathematical model is sought using a genetic algorithm based on integer coding.

參考文獻


Imai A,Nagaiwak,Chanw T.Efficient planning of berth allocation for container terminals in Asia[J]. Journal of Advanced Transportation 1997 31:75-94.
Imai A,Nishimura E,Papadimitriou S The dynamic berth allocation for a container port.Transportation Research (Part B) (2001) 35:401-417.
Imai A,Nishiura E, Berth allocation with service priority[J].Transportation Research 2003 Part B 37:437-457.
Imai A,Nishimuar E, Berth allocation planning in the public berth system by genetic algorithms[J]. European Journal of Operational Research 2001(4):282-292.
Kap Hwan Kim,Kyung Chan Moon Berth scheduling by simulated annealing,Transportation Research Part B 37(2003)541-560.

延伸閱讀