2006
DOI: 10.1299/jsmec.49.473
|View full text |Cite
|
Sign up to set email alerts
|

A Q-Learning for Group-Based Plan of Container Transfer Scheduling

Abstract: In container yard terminals, containers brought by trucks arrive in the random order. Since each container has its own destination and it cannot be rearranged after shipping, containers have to be loaded into a ship in a certain order. 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. Therefore, conventional metho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 26 publications
(8 citation statements)
references
References 12 publications
(7 reference statements)
0
8
0
Order By: Relevance
“…Nevertheless, finding a theoretical optimum can be very useful as a benchmark (although the metaheuristic approaches used to make this approach computationally feasible are not guaranteed to find the global optimum). Other methods that have been used for this include Q-Learning (Hirashima et al 2006) and critical-shaking neighborhood search (Lim and Xu 2006). Han et al (2008) use integer programming with Tabu search to generate an entire yard template, which should minimize reshuffling moves.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Nevertheless, finding a theoretical optimum can be very useful as a benchmark (although the metaheuristic approaches used to make this approach computationally feasible are not guaranteed to find the global optimum). Other methods that have been used for this include Q-Learning (Hirashima et al 2006) and critical-shaking neighborhood search (Lim and Xu 2006). Han et al (2008) use integer programming with Tabu search to generate an entire yard template, which should minimize reshuffling moves.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The yard crane operators were modeled as agents using the Q-learning technique for automatic trailer selection process. In the same context, Reference [3] used the Q-learning algorithm to determine the movement sequence of the containers so that they were loaded onto a ship in the desired order. Their ultimate goal was to reduce the run time for shipping.…”
Section: Background 21 Related Workmentioning
confidence: 99%
“…Orive et al [2] gave a thorough analysis of the conversion to digital, intelligent, and green ports and proposed a new methodology, called the business observation tool, that allows successfully undertaking the automation of terminals considering the specific constraints of the port. Furthermore, various logistics operations have been studied using new techniques such as cargo management, traffic control, detection, recognition and tracking of traffic-related objects, and optimization of different resources such as energy, time, and materials [3,4]. The state-of-the-art of smart ports and intelligent maritime transportation has been described highlighting trends, challenges, new technologies, and their implementation status [5][6][7].…”
Section: Introductionmentioning
confidence: 99%
“…However, their conclusions are useful for the determination of the average number of reshuffles relative to the productive moves at the terminal. Hirashima et al (2006) focus on the pre-marshaling process for export containers. In the arrangement problem, the number of container-arrangements increases exponentially with increasing container volume.…”
Section: Reshuffling Strategymentioning
confidence: 99%