A survey of the standard location-routing problem
Michael Schneider () and
Michael Drexl ()
Additional contact information
Michael Schneider: RWTH Aachen University
Michael Drexl: Johannes Gutenberg University
Annals of Operations Research, 2017, vol. 259, issue 1, No 16, 389-414
Abstract:
Abstract In this paper, we define the standard LRP as a deterministic, static, discrete, single-echelon, single-objective location-routing problem in which each customer (vertex) must be visited exactly once for the delivery of a good from a facility, and in which no inventory decisions are relevant. We review the literature on the standard LRP published since the survey by Nagy and Salhi appeared in 2006. We provide concise paper excerpts that convey the central ideas of each work, discuss recent developments in the field, provide a numerical comparison of the most successful heuristic algorithms, and list promising topics for further research.
Keywords: Survey; Location-routing problem; Standard LRP; Capacitated LRP (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (39)
Downloads: (external link)
http://link.springer.com/10.1007/s10479-017-2509-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:259:y:2017:i:1:d:10.1007_s10479-017-2509-0
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1007/s10479-017-2509-0
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().