The DOI matches its Crossref record.
An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities
Abstract
Recent research on location-routing problems has been focusing on locating facilities as the starting and end point of routes. In this paper, we investigate a new type of location-routing problem. In the location-routing problem with intra-route facilities, the location of depots is known, whereas the location of facilities for intermediate stops has to be determined to keep vehicles operational. We present an adaptive large neighborhood search which is enhanced by local search and dynamic programming components, and derive new penalty functions for time-efficient neighborhood evaluation. We show that this algorithm is suitable for solving various problems with intra-route facilities by deriving new best known solutions for the recently published electric location-routing problem with time windows and partial recharging, as well as for the battery swap station electric vehicle location-routing problem. Additionally, we create new real-world benchmark instances and show results as well. Furthermore, we assess the competitiveness of our algorithm on the electric vehicle routing problem with time windows for full and partial recharging, and derive new best known solutions for both problem variants. The online appendix is available at https://doi.org/10.1287/trsc.2017.0746 .
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Pelletier, S., Jabali, O., Laporte, G., & Veneroni, M. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2017.01.020 · Cited by 515
The electric vehicle routing problem and its variations: A literature review
Kucukoglu, I., Dewil, R., & Cattrysse, D. (2021) · Computers & Industrial Engineering · doi:10.1016/j.cie.2021.107650 · Cited by 384
Green vehicle routing problem: A state-of-the-art review
Asghari, M., & Mirzapour Al-e-hashem, S. M. J. (2021) · International Journal of Production Economics · doi:10.1016/j.ijpe.2020.107899 · Cited by 309
Charging station location problem: A comprehensive review on models and solution approaches
Kchaou-Boujelben, M. (2021) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2021.103376 · Cited by 285
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
Erdelić, T., & Carić, T. (2019) · Journal of Advanced Transportation · doi:10.1155/2019/5075671 · Cited by 270
Metadata
- Authors
- Schiffer, M., & Walther, G.
- Venue
- Transportation Science
- Published
- 2018-03
- Volume
- 52
- Issue
- 2
- Pages
- 331-352
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2755898715
- Cited by
- 170
- References
- 0
- FWCI
- 12.00
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities. https://app.cochat.ai/papers/10.1287/trsc.2017.0746
- The paper
- Schiffer, M., & Walther, G. (2018). An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities. Transportation Science. https://doi.org/10.1287/trsc.2017.0746
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.