his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Conflict-free routing of multi-stop warehouse trucks
University of Stirling, United Kingdom.
University of York, United Kingdom.
University of Skövde, School of Engineering Science. University of Skövde, The Virtual Systems Research Centre. (Produktion och automatiseringsteknik, Production and Automation Engineering)ORCID iD: 0000-0003-1679-3319
The University of Manchester, United Kingdom.
2019 (English)In: Optimization Letters, ISSN 1862-4472, E-ISSN 1862-4480Article in journal (Refereed) Epub ahead of print
Abstract [en]

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. 

Place, publisher, year, edition, pages
Springer, 2019.
Keywords [en]
Graphs, Metaheuristic, Onflict-free routing, Permutations, Shortest path, Graph theory, Industrial plants, Trucks, Warehouses
National Category
Computational Mathematics
Research subject
Production and Automation Engineering
Identifiers
URN: urn:nbn:se:his:diva-17519DOI: 10.1007/s11590-019-01453-6Scopus ID: 2-s2.0-85069669142OAI: oai:DiVA.org:his-17519DiVA, id: diva2:1341951
Available from: 2019-08-12 Created: 2019-08-12 Last updated: 2019-08-13Bibliographically approved

Open Access in DiVA

fulltext(490 kB)37 downloads
File information
File name FULLTEXT01.pdfFile size 490 kBChecksum SHA-512
ca2c26fe8630f422e957bb3fb9b733beb10cbbb1ddd1f218018a576a99728970153e5c209af8895aedeeb3ad2deb32aeafeb4e307a3963507efd777ced0aab0b
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records BETA

Senington, Richard

Search in DiVA

By author/editor
Senington, Richard
By organisation
School of Engineering ScienceThe Virtual Systems Research Centre
In the same journal
Optimization Letters
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 37 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 120 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf