AN INTELLIGENT MARSHALING PLAN BASED ON MULTI-POSITIONAL DESIRED LAYOUT IN CONTAINER YARD TERMINALS

Yoichi Hirashima

Abstract

This paper proposes a new scheduling method for a marshaling in the container yard terminal. The proposed method is derived based on Q-Learning algorithm considering the desired position of containers that are to be loaded into a ship. In the method, 3 processes can be optimized simultaneously: rearrangement order of containers, layout of containers assuring explicit transfer of container to the desired position, and removal plan for preparing the rearrange operation. Moreover, the proposed method generates several desired positions for each container, so that the learning performance of the method can be improved as compared to the conventional methods. In general, at container yard terminals, containers are stacked in the arrival order. Containers have to be loaded into the ship in a certain order, since each container has its own shipping destination and it cannot be rearranged after loading. Therefore, containers have to be rearranged from the initial arrangement into the desired arrangement before shipping. In the problem, the number of container-arrangements increases by the exponential rate with increase of total count of containers, and the rearrangement process occupies large part of total run time of material handling operation at the terminal. For this problem, conventional methods require enormous time and cost to derive an admissible result. In order to show effectiveness of the proposed method, computer simulations for several examples are conducted.

References

  1. Baum, E. B. (1999). Toward a model of intelligence as an economy of agents. Machine Learning, 35:155-185.
  2. Hirashima, Y., Iiguni, Y., Inoue, A., and Masuda, S. (1999). Q-learning algorithm using an adaptive-sized q-table. Proc. IEEE Conf. Decision and Control, pages 1599- 1604.
  3. Hirashima, Y., takeda, K., Furuya, O., Inoue, A., and Deng, M. (2005). A new method for marshaling plan using a reinforcement learning considering desired layout of containers in terminals. Preprint of 16th IFAC World Congress, pages We-E16-TO/2.
  4. Koza, J. R. (1992). Genetic Programming : On Programming Computers by means of Natural Selection and Genetics. MIT Press.
  5. Minagawa, M. and Kakazu, Y. (1997). An approach to the block stacking problem by multi agent cooperation. Trans. Jpn. Soc. Mech. Eng. (in Japanese), C63(608):231-240.
  6. Motoyama, S., Hirashima, Y., Takeda, K., and Inoue, A. (2001). A marshalling plan for container terminals based on reinforce-ment learning. Proc. of Inter. Sympo. on Advanced Control of Industrial Processes, pages 631-636.
  7. Siberholz, M. B., Golden, B. L., and Baker, K. (1991). Using simulation to study the impact of work rules on productivity at marine container terminals. Computers Oper. Res., 18(5):433-452.
  8. Watkins, C. J. C. H. and Dayan, P. (1992). Q-learning. Machine Learning, 8:279-292.
Download


Paper Citation


in Harvard Style

Hirashima Y. (2007). AN INTELLIGENT MARSHALING PLAN BASED ON MULTI-POSITIONAL DESIRED LAYOUT IN CONTAINER YARD TERMINALS . In Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO, ISBN 978-972-8865-82-5, pages 234-239. DOI: 10.5220/0001643902340239


in Bibtex Style

@conference{icinco07,
author={Yoichi Hirashima},
title={AN INTELLIGENT MARSHALING PLAN BASED ON MULTI-POSITIONAL DESIRED LAYOUT IN CONTAINER YARD TERMINALS},
booktitle={Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,},
year={2007},
pages={234-239},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001643902340239},
isbn={978-972-8865-82-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the Fourth International Conference on Informatics in Control, Automation and Robotics - Volume 1: ICINCO,
TI - AN INTELLIGENT MARSHALING PLAN BASED ON MULTI-POSITIONAL DESIRED LAYOUT IN CONTAINER YARD TERMINALS
SN - 978-972-8865-82-5
AU - Hirashima Y.
PY - 2007
SP - 234
EP - 239
DO - 10.5220/0001643902340239