loading
Papers Papers/2022 Papers Papers/2022

Research.Publish.Connect.

Paper

Paper Unlock

Author: Yoichi Hirashima

Affiliation: Fac. Information Science and Technology, Osaka Institute of Technology, Japan

Keyword(s): Container marshaling, Block stacking problem, Q-learning, Reinforcement learning, Binary tree.

Related Ontology Subjects/Areas/Topics: Artificial Intelligence ; Artificial Intelligence and Decision Support Systems ; Computational Intelligence ; Decision Support Systems ; Enterprise Information Systems ; Formal Methods ; Informatics in Control, Automation and Robotics ; Intelligent Control Systems and Optimization ; Optimization Algorithms ; Planning and Scheduling ; Simulation and Modeling ; Soft Computing ; Symbolic Systems

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. (More)

CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.144.113.30

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
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; ISSN 2184-2809, SciTePress, pages 234-239. DOI: 10.5220/0001643902340239

@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},
issn={2184-2809},
}

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
IS - 2184-2809
AU - Hirashima, Y.
PY - 2007
SP - 234
EP - 239
DO - 10.5220/0001643902340239
PB - SciTePress