Name
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1007/s11590-019-01453-6 | OPTIMIZATION LETTERS |
Keywords | DocType | Volume |
Onflict-free routing,Shortest path,Metaheuristic,Graphs,Permutations | Journal | 14.0 |
Issue | ISSN | Citations |
6.0 | 1862-4472 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alexander E.I. Brownlee | 1 | 144 | 18.46 |
| Jerry Swan | 2 | 6 | 1.78 |
| Richard Senington | 3 | 0 | 0.34 |
| Zoltan A. Kocsis | 4 | 19 | 3.72 |