The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Abstract
Effective route planning for battery electric commercial vehicle (ECV) fleets has to take into account their limited autonomy and the possibility of visiting recharging stations during the course of a route. In this paper, we consider four variants of the electric vehicle-routing problem with time windows: (i) at most a single recharge per route is allowed, and batteries are fully recharged on visit of a recharging station; (ii) multiple recharges per route, full recharges only; (iii) at most a single recharge per route, and partial battery recharges are possible; and (iv) multiple, partial recharges. For each variant, we present exact branch-price-and-cut algorithms that rely on customized monodirectional and bidirectional labeling algorithms for generating feasible vehicle routes. In computational studies, we find that all four variants are solvable for instances with up to 100 customers and 21 recharging stations. This success can be attributed to the tailored resource extension functions (REFs) that enable efficient labeling with constant time feasibility checking and strong dominance rules, even if these REFs are intricate and rather elaborate to derive. The studies also highlight the superiority of the bidirectional labeling algorithms compared to the monodirectional ones. Finally, we find that allowing multiple as well as partial recharges both help to reduce routing costs and the number of employed vehicles in comparison to the variants with single and with full recharges.
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
Cites
Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
Solomon, M. M. (1987) · Operations Research · doi:10.1287/opre.35.2.254 · Cited by 4,298
Branch-and-price: column generation for solving huge integer programs
Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P., & Vance, P. H. (1998) · Operations Research · doi:10.1287/opre.46.3.316 · Cited by 2,219
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
Schneider, M., Stenger, A., & Goeke, D. (2014) · Transportation Science · doi:10.1287/trsc.2013.0490 · Cited by 1,312
Self-citationA Green Vehicle Routing Problem
Erdoğan, S., & Miller-Hooks, E. (2012) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2011.08.001 · Cited by 1,133
Vehicle Routing: Problems, Methods, and Applications, Second Edition
(2014) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611973594 · Cited by 1,131
Selected Topics in Column Generation
Lübbecke, M. E., & Desrosiers, J. (2005) · Operations Research · doi:10.1287/opre.1050.0234 · Cited by 1,102
Routing a mixed fleet of electric and conventional vehicles
Goeke, D., & Schneider, M. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.01.049 · Cited by 607
Self-citationShortest Path Problems with Resource Constraints
Irnich, S., & Desaulniers, G. (2006) · Column Generation · doi:10.1007/0-387-25486-2_2 · Cited by 597
Self-citationThe Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
Infrastructure planning for electric vehicles with battery swapping
Mak, H.-Y., Rong, Y., & Shen, Z.-J. M. (2013) · Management Science · doi:10.1287/mnsc.1120.1672 · Cited by 570
Cited by
The electric vehicle routing problem with nonlinear charging function
Montoya, A., Guéret, C., Mendoza, J. E., & Villegas, J. G. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2017.02.004 · Cited by 627
Routing a mixed fleet of electric and conventional vehicles
Goeke, D., & Schneider, M. (2015) · European Journal of Operational Research · doi:10.1016/j.ejor.2015.01.049 · Cited by 607
Self-citationPartial recharge strategies for the electric vehicle routing problem with time windows
Keskin, M., & Çatay, B. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.01.013 · Cited by 600
The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Hiermann, G., Puchinger, J., Ropke, S., & Hartl, R. F. (2016) · European Journal of Operational Research · doi:10.1016/j.ejor.2016.01.038 · Cited by 584
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
The electric location routing problem with time windows and partial recharging
Schiffer, M., & Walther, G. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.01.011 · Cited by 343
Pelletier, S., Jabali, O., & Laporte, G. (2016) · Transportation Science · doi:10.1287/trsc.2015.0646 · Cited by 314
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
Hof, J., Schneider, M., & Goeke, D. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.11.009 · Cited by 284
Self-citationElectric vehicle routing problem with recharging stations for minimizing energy consumption
Zhang, S., Gajpal, Y., Appadoo, S. S., & Abdulkader, M. M. S. (2018) · International Journal of Production Economics · doi:10.1016/j.ijpe.2018.07.016 · Cited by 277
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
Optimization models for electric vehicle service operations: A literature review
Shen, Z.-J. M., Feng, B., Mao, C., & Ran, L. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.08.006 · Cited by 261
Jie, W., Yang, J., Zhang, M., & Huang, Y. (2019) · European Journal of Operational Research · doi:10.1016/j.ejor.2018.07.002 · Cited by 256
A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
Keskin, M., & Çatay, B. (2018) · Computers & Operations Research · doi:10.1016/j.cor.2018.06.019 · Cited by 256
Xiao, Y., Zhang, Y., Kaku, I., Kang, R., & Pan, X. (2021) · Renewable and Sustainable Energy Reviews · doi:10.1016/j.rser.2021.111567 · Cited by 236
An exact algorithm for agile earth observation satellite scheduling with time-dependent profits
Peng, G., Song, G., Xing, L., Gunawan, A., & Vansteenwegen, P. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.104946 · Cited by 93
Electric Vehicle Charge Scheduling with Flexible Service Operations
Klein, P. S., & Schiffer, M. (2023) · Transportation Science · doi:10.1287/trsc.2022.0272 · Cited by 17
Metadata
- Authors
- Desaulniers, G., Errico, F., Irnich, S., & Schneider, M.
- Venue
- Operations Research
- Published
- 2016-12
- Volume
- 64
- Issue
- 6
- Pages
- 1388-1405
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2214969595
- Cited by
- 497
- References
- 27
- FWCI
- 45.34
- 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
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.