Abstract
This article describes a dispatching approach for Automated Guided Vehicles with a capacity of greater than one load (referred as Multiple Load Automated Guided Vehicles). The approach is based on modelling the dispatching task as a Dial-a-Ride Problem. An Adaptive Large Neighborhood Search heuristic was employed to find solutions for small vehicle fleets online. To investigate the performance of this heuristic the generated solutions are compared to results of an exact solution method and well established rule-based dispatching policies. The comparison is based on test instances of a use case in semiconductor industry.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Cordeau, J.-F.: A branch-and-cut algorithm for the dial-a-ride problem. Oper. Res. 54(3), 573–586 (2006)
Egbelu, P.J., Tanchoco, J.M.A.: Characterization of automatic guided vehicle dispatching rules. Int. J. Prod. Res. 22(3), 359–374 (1984)
Ho, Y.-C., Chien, S.-H.: A simulation study on the performance of task determination rules and delivery-dispatching rules for multiple-load AGVs. Int. J. Prod. Res. 44(20), S. 4193–4222 (2006)
Li, M.P., Kuhl, M.E.: Design and simulation analysis of PDER: a multiple-load automated guided vehicle dispatching algorithm. In: Proceedings of the 2017 Winter Simulation Conference, pp. 3311–3322 (2017)
Molenbruch, Y., et al.: Typology and literature review for dial-a-ride problems. Ann. Oper. Res. 259, 295–325 (2017)
Ndiaye, M.A., et al.: Automated transportation of auxiliary resources in a semiconductor manufacturing facility. In: Proceedings of the 2016 Winter Simulation Conference, pp. 2587–2597 (2016)
Ropke, S.: PALNS - a software framework for parallel large neighborhood search. In: 8th Metaheuristic International Conference CDROM (2009)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)
Schrecker, A.: Planung und Steuerung Fahrerloser Transportsysteme: Ansätze zur Unterstützung der Systemgestaltung. In: Gabler Edition Wissenschaft. Produktion und Logistik. Wiesbaden und s.l.: Deutscher Universitätsverlag (2000)
Sinriech, D., Kotlarski, J.: A dynamic scheduling algorithm for a multiple load multiple-carrier system. Int. J. Prod. Res. 40(5), 1065–1080 (2006)
Acknowledgements
The work was performed in the project Responsive Fab, co-funded by grants from the European Union (EFRE) and the Free State of Saxony (SAB).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Boden, P., Hahne, H., Rank, S., Schmidt, T. (2020). Dispatching of Multiple Load Automated Guided Vehicles Based on Adaptive Large Neighborhood Search. In: Neufeld, J.S., Buscher, U., Lasch, R., Möst, D., Schönberger, J. (eds) Operations Research Proceedings 2019. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-48439-2_45
Download citation
DOI: https://doi.org/10.1007/978-3-030-48439-2_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-48438-5
Online ISBN: 978-3-030-48439-2
eBook Packages: Business and ManagementBusiness and Management (R0)