Researching on the Single Lock Chamber Automatic Layout Algorithm

Article Preview

Abstract:

Arrange the ships reasonable as much as possible in the lock chamber, can help improving the traffic ability and the utilization rate of the lock. At present, it is not enough for the factors that considered in the automatic layout algorithm, such as: the safety distance between the ships, ship bottom sill depth. The algorithm can be further optimized. This paper will present a new automatic layout algorithm for single chamber which is able to enhance the efficiency of the chamber space and improve the traffic ability.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

39-42

Citation:

Online since:

October 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Liu Yunfeng, Qi Huan. The Two-dimension Optimization Arranging Heuristic Algorithm and Its Application in the Yangtse Gorges Permanent Ship Lock Decision System. JISUANJI YU XIANDAIHUA. 2002. 1.

Google Scholar

[2] Liu Wenli. Application of Greedy Algorithm in the Arranging of Lock Chamber. Computer Knowledge and Technology. 2011. 4.

Google Scholar

[3] Sun Bo, Qi Huan, Zhang Xiaopan, Cai Xiao. Dimensionality Reduction Quickly Arranging Algorithm of Lock Chambers in Co-Scheduling of Three Gorges Dam and Gezhouba Dam System. Computer Technology and Development. 2006. 12.

DOI: 10.1109/wcica.2008.4593521

Google Scholar

[4] Feng Wei, Wu Fengping, Zhang Yutao. Dynamic optimization model for ship combination in lock chambers. Journal of Hohai University(Natural Sciences). 2006. 11.

Google Scholar

[5] KIM S-i hwa, LEE Kyung-keun. An optimization- based decision support system for ship scheduling. Computers & Industrial Engineering. 1997. 12.

DOI: 10.1016/s0360-8352(97)00223-4

Google Scholar

[6] KJETILA F. Ship scheduling with soft time windows: An optimisation based approach. European Journal of Operational Research. 2001. 6.

Google Scholar