Evaluation of Alternative Paths for Reliable Routing in City Logistics

Show simple item record

dc.identifier.uri http://dx.doi.org/10.15488/3334
dc.identifier.uri http://www.repo.uni-hannover.de/handle/123456789/3364
dc.contributor.author Groß, Patrick-Oliver
dc.contributor.author Ehmke, Jan F.
dc.contributor.author Haas, Inbal
dc.contributor.author Mattfeld, Dirk C.
dc.date.accessioned 2018-05-18T12:03:53Z
dc.date.available 2018-05-18T12:03:53Z
dc.date.issued 2017
dc.identifier.citation Groß, P.-O.; Ehmke, J.F.; Haas, I.; Mattfeld, D.C.: Evaluation of Alternative Paths for Reliable Routing in City Logistics. In: Transportation Research Procedia 27 (2017), S. 1195-1202. DOI: https://doi.org/10.1016/j.trpro.2017.12.067
dc.description.abstract Due to varying traffic volumes and limited traffic infrastructure in urban areas, travel times are uncertain and differ during the day. In this environment, city logistics service providers (CLSP) have to fulfill deliveries in a cost-efficient and reliable manner. To ensure cost-efficient routing while satisfying promised delivery dates, information on the expected travel times between customers needs to be considered appropriately. Typically, vehicle routing is based on information from shortest paths between customers, to determine the cost-minimal sequence of customer visits. This information is usually precomputed using shortest path algorithms. Most approaches merely consider a single (shortest) path, based on a single cost value (e.g., distance or average travel time). To incorporate information on travel time variation, it might be of value to consider alternative paths and more sophisticated travel time models such as Interval Travel Times (ITT). In this work, we investigate the incorporation of alternative paths into city logistics vehicle routing. For this purpose, we compare our approach to classical shortest path approaches within a vehicle routing problem. Our approach considers a set of alternative paths and incorporates ITT. Experiments are conducted within an exemplary city logistics setting. Computational results show that the consideration of alternative paths allows to select better paths with regard to a trade-off between efficiency and reliability when travel times are varying. © 2017 The Authors. Published by Elsevier B.V. eng
dc.language.iso eng
dc.publisher Amsterdam : Elsevier B.V.
dc.relation.ispartofseries Transportation Research Procedia 27 (2017)
dc.rights CC BY-NC-ND 4.0 Unported
dc.rights.uri https://creativecommons.org/licenses/by-nc-nd/4.0/
dc.subject alternative path eng
dc.subject city logistics eng
dc.subject reliability eng
dc.subject routing eng
dc.subject shortest path eng
dc.subject travel time information eng
dc.subject.ddc 380 | Handel, Kommunikation, Verkehr ger
dc.title Evaluation of Alternative Paths for Reliable Routing in City Logistics
dc.type article
dc.type Text
dc.relation.issn 2352-1465
dc.relation.doi https://doi.org/10.1016/j.trpro.2017.12.067
dc.bibliographicCitation.volume 27
dc.bibliographicCitation.firstPage 1195
dc.bibliographicCitation.lastPage 1202
dc.description.version publishedVersion
tib.accessRights frei zug�nglich


Files in this item

The following license files are associated with this item:

This item appears in the following Collection(s):

Show simple item record

 

Search the repository


Browse

My Account

Usage Statistics