|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||Conflict-free routing of multi-stop warehouse trucks|
|Citation:||Brownlee A, Swan J, Senington R & Kocsis Z (2019) Conflict-free routing of multi-stop warehouse trucks. Optimization Letters. https://doi.org/10.1007/s11590-019-01453-6|
|Abstract:||The recent interest in greater vehicular autonomy for factory and warehouse automation has stimulated research in conflict-free routing: a challenging network routing problem in which vehicles may not pass each other. Motivated by a real-world case study, we consider one such application: truck movements in a tightly constrained warehouse. We propose an extension of an existing conflict-free routing algorithm to consider multiple stopping points per route. A high level metaheuristic is applied to determine the route construction and assignment of vehicles to routes.|
|Rights:||© The Author(s) 2019 This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.|
|Notes:||Output Status: Forthcoming/Available Online|
|Brownlee2019_Article_Conflict-freeRoutingOfMulti-st.pdf||Fulltext - Published Version||490.14 kB||Adobe PDF||View/Open|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.