A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://pp.bme.hu/tr/article/download/8620/7076">the original URL</a>. The file type is <code>application/pdf</code>.
Optimal Scheduling and Routing of Free-range AGVs at Large Scale Automated Container Terminals
<span title="">2016</span>
<i title="Periodica Polytechnica Budapest University of Technology and Economics">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/gwmwjkrt5nbupnf3vodblvmmmi" style="color: black;">Periodica Polytechnica Transportation Engineering</a>
</i>
Preserved Fulltext
This work tackles the problem of controlling operations at an automated container terminal. In the context of large supply chains, there is a growing trend for increasing productivity and economic efficiency. New optimization models and algorithms are provided for scheduling and routing equipment that is moving containers in a quay area, loading/unloading ships, transporting them via Automated Guided Vehicles (AGVs) to Automated Stacking Cranes (ASCs), organizing them in stacks. In contrast
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3311/pptr.8620">doi:10.3311/pptr.8620</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lpdflzon55gphdncuyafiacugy">fatcat:lpdflzon55gphdncuyafiacugy</a>
</span>
more »
... the majority of the approaches in the related literature, this work tackles two dynamics of the system, a discrete dynamic, characteristic of the maximization of operations efficiency, by assigning the best AGV and operation time to a set of containers, and a continuous dynamic of the AGV that moves in a geographically limited area. As an assumption, AGVs can follow free range trajectories that minimize the error of the target time and increase the responsiveness of the system. A novel solution framework is proposed in order to tackle the two system dynamics. Various metaheuristic algorithms are tested to solve the problem in a near-optimal way. Computational experiments are presented in order to show the feasibility of the proposed framework on a practical case study, and to assess the performance of advanced scheduling and routing algorithms on numerous system settings.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922050444/https://pp.bme.hu/tr/article/download/8620/7076" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/13/8213bc775debe374adb15a75d05dd43df9b1ad4f.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.3311/pptr.8620">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
Publisher / doi.org
</button>
</a>