Scheduling vehicles in automated transportation systems Algorithms and case study: Algorithms and case study

Share/Save/Bookmark

Heijden, Matthieu van der and Ebben, Mark and Gademann, Noud and Harten, Aart van (2002) Scheduling vehicles in automated transportation systems Algorithms and case study: Algorithms and case study. OR Spectrum (19). pp. 31-58. ISSN 0171-6468

[img] PDF
Restricted to UT campus only
: Request a copy
225kB
Abstract:One of the major planning issues in large scale automated transportation systems is so-called empty vehicle management, the timely supply of vehicles to terminals in order to reduce cargo waiting times. Motivated by a Dutch pilot project on an underground cargo transportation system using Automated Guided Vehicles (AGVs), we developed several rules and algorithms for empty vehicle management, varying from trivial First-Come, First-Served (FCFS) via look-ahead rules to integral planning. For our application, we focus on attaining customer service levels in the presence of varying order priorities, taking into account resource capacities and the relation to other planning decisions, such as terminal management. We show how the various rules are embedded in a framework for logistics control of automated transportation networks. Using simulation, the planning options are evaluated on their performance in terms of customer service levels, AGV requirements and empty travel distances. Based on our experiments, we conclude that look-ahead rules have significant advantages above FCFS. A more advanced so-called serial scheduling method outperforms the look-ahead rules if the peak demand quickly moves amongst routes in the system
Item Type:Article
Copyright:© Springer
Faculty:
Management and Governance (SMG)
Research Chair:
Research Group:
Link to this item:http://purl.utwente.nl/publications/81240
Official URL:http://dx.doi.org/10.1007/s291-002-8199-x
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 124365