An Investigation into Sidings Allocation Strategy for Automated Container Terminal Based on A* Search Algorithm

Article Preview

Abstract:

A rolling-horizon approach was proposed, which aims at the problem of sidings allocation for automated container yard stacking system designed and invented by ZPMC. The dynamic allocation model using objective programming was initially developed for sidings allocation. The model objective function was subject to the minimization of the total job waiting time. Furthermore A* search algorithm was employed for solving the model, which can return optimal solutions. Finally an actual case was firstly studied to illustrate the proposed approach for sidings allocation strategy, and then verified the validity and usefulness of this model and algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Advanced Materials Research (Volumes 472-475)

Pages:

526-532

Citation:

Online since:

February 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] P.E. Hart N.J. Nilsson,B.Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans.Syst.Sci.and Cybemetics. 1968, SSC-4(2):100-107.

DOI: 10.1109/tssc.1968.300136

Google Scholar

[2] J. N. Nilsson, Problem-Solving Methods in Artificial Intelligence. New York: McGraw Hill, 1971.

Google Scholar

[3] I. Pohl, Heuristic search viewed as path finding in a graph. Artif. Intell., vol. 1, 1970: 193–204.

DOI: 10.1016/0004-3702(70)90007-x

Google Scholar

[4] J. Pearl, Heuristic Intelligent Search Strategies for Computer Problem Solving. Reading, MA: Addison-Wesley, 1984.

Google Scholar

[5] Rina Dechter, Judea Pearl. Generalized best-first search strategies and the optimality of A*. Journal of the Association for Computing Machinery. 1985: 505-536.

DOI: 10.1145/3828.3830

Google Scholar

[6] Ismail Chabini, Shan Lan. Adaptations of the A*Algorithm for the Computation of Fastest Paths in Deterministic Discrete-Time Dynamic Networks. IEEE Transaction On Intelligent Transportion Systems. 1524-9050, 2002.

DOI: 10.1109/6979.994796

Google Scholar

[7] Xi Guo, Shell Ying Huang, Wen Jing Hsu, Malcolm Yoke Hean Low. Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information, Adv. Eng.Informat. (2011)

DOI: 10.1016/j.aei.2011.02.002

Google Scholar

[8] Lu Zhen, Loo Hay Lee, Ek Peng Chew, Dao-Fang Chang, and Zhi-Xiang Xu. A Comparative Study on Two Types of Automated Container Terminal Systems. IEEE Transaction On Automation Science And Engineering. 1545-5955, 2011.

DOI: 10.1109/tase.2011.2165539

Google Scholar

[9] Juliang He, Weijian Mi, Daofang Chang, Wei Yan. An investigation into berth allocation and yuay crane assignment based on hybrid parallel genetic algorithm. IEEE Artificial Intelligence and Computational Intelligence. (2009)

DOI: 10.1109/AICI.2009.41

Google Scholar