1. STORRE
  2. Faculty of Natural Sciences
  3. Computing Science and Mathematics
  4. Computing Science and Mathematics Journal Articles
Please use this identifier to cite or link to this item: http://hdl.handle.net/1893/29853
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBrownlee, Alexanderen_UK
dc.contributor.authorSwan, Jerryen_UK
dc.contributor.authorSenington, Richarden_UK
dc.contributor.authorKocsis, Zoltanen_UK
dc.date.accessioned2019-07-11T00:03:27Z-
dc.date.available2019-07-11T00:03:27Z-
dc.date.issued2020-09en_UK
dc.identifier.urihttp://hdl.handle.net/1893/29853-
dc.description.abstractThe 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.en_UK
dc.language.isoenen_UK
dc.publisherBMCen_UK
dc.relationBrownlee A, Swan J, Senington R & Kocsis Z (2020) Conflict-free routing of multi-stop warehouse trucks. Optimization Letters, 14 (6), p. 1459–1470. https://doi.org/10.1007/s11590-019-01453-6en_UK
dc.relation.urihttp://hdl.handle.net/11667/130en_UK
dc.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.en_UK
dc.rights.urihttp://creativecommons.org/licenses/by/4.0/en_UK
dc.subjectconflict-free routingen_UK
dc.subjectshortest pathen_UK
dc.subjectmetaheuristicen_UK
dc.subjectgraphsen_UK
dc.subjectpermutationsen_UK
dc.titleConflict-free routing of multi-stop warehouse trucksen_UK
dc.typeJournal Articleen_UK
dc.rights.embargodate2019-07-12en_UK
dc.identifier.doi10.1007/s11590-019-01453-6en_UK
dc.citation.jtitleOptimization Lettersen_UK
dc.citation.issn1862-4480en_UK
dc.citation.issn1862-4472en_UK
dc.citation.volume14en_UK
dc.citation.issue6en_UK
dc.citation.spage1459en_UK
dc.citation.publicationstatusPublisheden_UK
dc.citation.peerreviewedRefereeden_UK
dc.type.statusVoR - Version of Recorden_UK
dc.contributor.funderEPSRC Engineering and Physical Sciences Research Councilen_UK
dc.contributor.funderEPSRC Engineering and Physical Sciences Research Councilen_UK
dc.author.emailalexander.brownlee@stir.ac.uken_UK
dc.citation.date12/07/2019en_UK
dc.contributor.affiliationComputing Scienceen_UK
dc.contributor.affiliationUniversity of Yorken_UK
dc.contributor.affiliationUniversity of Skovdeen_UK
dc.contributor.affiliationUniversity of Manchesteren_UK
dc.identifier.isiWOS:000556078600013en_UK
dc.identifier.scopusid2-s2.0-85069669142en_UK
dc.identifier.wtid1406247en_UK
dc.contributor.orcid0000-0003-2892-5059en_UK
dc.date.accepted2019-07-03en_UK
dcterms.dateAccepted2019-07-03en_UK
dc.date.filedepositdate2019-07-04en_UK
dc.relation.funderprojectDAASE: Dynamic Adaptive Automated Software Engineeringen_UK
dc.relation.funderprojectTRANSIT: Towards a Robust Airport Decision Support System for Intelligent Taxiingen_UK
dc.relation.funderrefEP/J017515/1en_UK
dc.relation.funderrefEP/N029577/1en_UK
rioxxterms.apcfully waiveden_UK
rioxxterms.typeJournal Article/Reviewen_UK
rioxxterms.versionVoRen_UK
local.rioxx.authorBrownlee, Alexander|0000-0003-2892-5059en_UK
local.rioxx.authorSwan, Jerry|en_UK
local.rioxx.authorSenington, Richard|en_UK
local.rioxx.authorKocsis, Zoltan|en_UK
local.rioxx.projectEP/J017515/1|Engineering and Physical Sciences Research Council|http://dx.doi.org/10.13039/501100000266en_UK
local.rioxx.projectEP/N029577/1|Engineering and Physical Sciences Research Council|http://dx.doi.org/10.13039/501100000266en_UK
local.rioxx.freetoreaddate2019-07-12en_UK
local.rioxx.licencehttp://www.rioxx.net/licenses/under-embargo-all-rights-reserved||2019-07-12en_UK
local.rioxx.licencehttp://creativecommons.org/licenses/by/4.0/|2019-07-12|en_UK
local.rioxx.filenameBrownlee2020_Article_Conflict-freeRoutingOfMulti-st.pdfen_UK
local.rioxx.filecount1en_UK
local.rioxx.source1862-4480en_UK
Appears in Collections:Computing Science and Mathematics Journal Articles

Files in This Item:
File Description SizeFormat 
Brownlee2020_Article_Conflict-freeRoutingOfMulti-st.pdfFulltext - Published Version479.35 kBAdobe PDFView/Open


This item is protected by original copyright

View License
Show simple item record


A file in this item is licensed under a Creative Commons License Creative Commons

Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.

The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/

If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.