期刊
OPTIMIZATION LETTERS
卷 14, 期 6, 页码 1459-1470出版社
SPRINGER HEIDELBERG
DOI: 10.1007/s11590-019-01453-6
关键词
Onflict-free routing; Shortest path; Metaheuristic; Graphs; Permutations
资金
- EPSRC [EP/N029577/2, EP/J017515/1] Funding Source: UKRI
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据