Skip header navigation
×

Article

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.

Keywords
conflict-free routing; shortest path; metaheuristic; graphs; permutations

Notes
Output Status: Forthcoming/Available Online

Journal
Optimization Letters

StatusPublished
Author(s)Brownlee, Alexander; Swan, Jerry; Senington, Richard; Kocsis, Zoltan
FundersEPSRC Engineering and Physical Sciences Research Council and EPSRC Engineering and Physical Sciences Research Council
Publication date online31/07/2019
Date accepted by journal03/07/2019
URLhttp://hdl.handle.net/1893/29853
Related URLshttp://hdl.handle.net/11667/130
ISSN1862-4472
eISSN1862-4480
Scroll back to the top