The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
A matheuristic method for the electric vehicle routing problem with time windows and fast chargers
Abstract
Abstract The Electric Vehicle Routing Problem with Time Windows (EVRPTW) is an extension of the well-known VRPTW where electric vehicles (EVs) are used instead of internal combustion engine vehicles. An EV has a limited driving range due to its battery capacity and may need recharging to complete its route. Recharging can be made at any battery level and may be at any quantity up to the battery capacity. Furthermore, the stations may be equipped with chargers with different power supply, power voltage, maximum current options which affect the recharge duration. In this study, we model the EVRPTW by allowing partial recharges with three recharging configurations which can be referred to as normal, fast and super-fast recharges. In faster options, the battery is charged with the same energy in a shorter time but at a higher cost. Our objective is to minimize the total recharging cost while operating minimum number of vehicles. We formulated this problem as a mixed integer linear program and solved the small instances using CPLEX. To solve the larger problems, we develop a matheuristic approach which couples the Adaptive Large Neighborhood Search (ALNS) approach with an exact method. Our ALNS is equipped with various destroy-repair algorithms to efficiently explore the neighborhoods and uses CPLEX to strengthen the routes obtained. We carried out extensive experiments to investigate the benefits of fast recharges and test the performance of our algorithm using benchmark instances from the literature. The results show the effectiveness of the proposed matheuristic and demonstrate the benefits of fast chargers on the fleet size and energy costs.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Yilmaz, M., & Krein, P. T. (2013) · IEEE Transactions on Power Electronics · doi:10.1109/tpel.2012.2212917 · Cited by 3,118
Ropke, S., & Pisinger, D. (2006) · Transportation Science · doi:10.1287/trsc.1050.0135 · Cited by 2,580
A general heuristic for vehicle routing problems
Pisinger, D., & Ropke, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.09.012 · Cited by 1,443
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
A 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
An adaptive large neighborhood search heuristic for the Pollution-Routing Problem
Demir, E., Bektaş, T., & Laporte, G. (2012) · European Journal of Operational Research · doi:10.1016/j.ejor.2012.06.044 · Cited by 726
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
Partial 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
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
Pollet, B. G., Staffell, I., & Shang, J. L. (2012) · Electrochimica Acta · doi:10.1016/j.electacta.2012.03.172 · Cited by 569
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
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
Desaulniers, G., Errico, F., Irnich, S., & Schneider, M. (2016) · Operations Research · doi:10.1287/opre.2016.1535 · Cited by 497
Felipe, Á., Ortuño, M. T., Righini, G., & Tirado, G. (2014) · Transportation Research Part E: Logistics and Transportation Review · doi:10.1016/j.tre.2014.09.003 · Cited by 491
Battery swap station location-routing problem with capacitated electric vehicles
Yang, J., & Sun, H. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2014.07.003 · Cited by 434
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
Feng, W., & Figliozzi, M. (2013) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2012.06.007 · Cited by 298
Hof, J., Schneider, M., & Goeke, D. (2017) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2016.11.009 · Cited by 284
A survey on matheuristics for routing problems
Archetti, C., & Speranza, M. G. (2014) · EURO Journal on Computational Optimization · doi:10.1007/s13675-014-0030-7 · Cited by 240
An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem
Wen, M., Linde, E., Ropke, S., Mirchandani, P., & Larsen, A. (2016) · Computers & Operations Research · doi:10.1016/j.cor.2016.06.013 · Cited by 236
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows
Bruglieri, M., Pezzella, F., Pisacane, O., & Suraci, S. S. (2015) · Electronic Notes in Discrete Mathematics · doi:10.1016/j.endm.2014.11.029 · Cited by 191
The Recharging Vehicle Routing Problem
Conrad, R. G., & Figliozzi, M. (2011) · Cited by 164
Charge scheduling for electric freight vehicles
Pelletier, S., Jabali, O., & Laporte, G. (2018) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2018.07.010 · Cited by 164
Optimal Recharging Policies for Electric Vehicles
Sweda, T. M., Dolinskaya, I., & Klabjan, D. (2016) · Transportation Science · doi:10.1287/trsc.2015.0638 · Cited by 79
Proceedings IEEE Symposium on Computers and Communications
(1995) · Proceedings - IEEE Symposium on Computers and Communications/IEEE Symposium on Computers and Communications · doi:10.1109/scac.1995.523174 · Cited by 77
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
Schiffer, M., Schneider, M., & Gilbert Laporte, A. (2017) · European Journal of Operational Research · doi:10.1016/j.ejor.2017.07.067 · Cited by 64
The impact of quick charging stations on the route planning of Electric Vehicles
Çatay, B., & Keskin, M. (2017) · IEEE Symposium on Computers and Communications (ISCC) · doi:10.1109/iscc.2017.8024521 · Cited by 31
Self-citationDesigning sustainable mid-haul logistics networks with intra-route multi-resource facilities
Gilbert Laporte, A., Schneider, M., & Schiffer, M. (2017) · Les Cahiers du GERAD · Cited by 30
New formulations for the electric vehicle routing problem with nonlinear charging functionsPreprint
Froger, A., Mendoza, J. E., Gilbert Laporte, A., & Jabali, O. (2017) · Cited by 15
Cited by
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
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
- Keskin, M., & Çatay, B.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2018-12
- Volume
- 100
- Pages
- 172-188
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2883420779
- Cited by
- 256
- References
- 31
- FWCI
- 14.54
- 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.