Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations

The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a fleet of electric vehicles subject to intra-route and inter-route constraints. Every vehicle is equipped with a rechargeable battery that d...

Full description

Saved in:
Bibliographic Details
Published inComputers & operations research Vol. 145; p. 105870
Main Authors Lam, Edward, Desaulniers, Guy, Stuckey, Peter J.
Format Journal Article
LanguageEnglish
Published New York Elsevier Ltd 01.09.2022
Pergamon Press Inc
Subjects
Online AccessGet full text
ISSN0305-0548
1873-765X
0305-0548
DOI10.1016/j.cor.2022.105870

Cover

Abstract The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a fleet of electric vehicles subject to intra-route and inter-route constraints. Every vehicle is equipped with a rechargeable battery that depletes while it transports goods along its route. A vehicle must detour to a recharging station to recharge before draining its battery. To approximate a real recharging process, the amount of energy restored is modeled as a piecewise-linear function of the time spent recharging. Furthermore, each station has a small number of chargers, and hence, when and where a vehicle can recharge must be scheduled around the availability of a charger. This interaction between vehicles does not appear in classical vehicle routing problems and motivates the development of new methods that can exploit the joint routing and scheduling structure. This paper proposes a branch-and-cut-and-price algorithm that designates the routing to integer programming using Dantzig–Wolfe decomposition and the scheduling to constraint programming using logic-based Benders decomposition. Experimental results indicate that this hybrid method solves 34% of the instances with 100 customers. •This paper considers the routing of electric vehicles and their recharging en route.•Recharging the batteries of the vehicles is governed by a piecewise-linear function.•Vehicles must recharge at stations with a limited number of chargers.•Hence, the vehicles must be scheduled around the availability of a charger.•The problem is tackled using a branch-and-cut-and-price algorithm.•The algorithm decomposes the routing to integer programming and the scheduling to constraint programming.•Results show that this hybrid algorithm solves instances with up to 100 customers.
AbstractList The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a fleet of electric vehicles subject to intra-route and inter-route constraints. Every vehicle is equipped with a rechargeable battery that depletes while it transports goods along its route. A vehicle must detour to a recharging station to recharge before draining its battery. To approximate a real recharging process, the amount of energy restored is modeled as a piecewise-linear function of the time spent recharging. Furthermore, each station has a small number of chargers, and hence, when and where a vehicle can recharge must be scheduled around the availability of a charger. This interaction between vehicles does not appear in classical vehicle routing problems and motivates the development of new methods that can exploit the joint routing and scheduling structure. This paper proposes a branch-and-cut-and-price algorithm that designates the routing to integer programming using Dantzig–Wolfe decomposition and the scheduling to constraint programming using logic-based Benders decomposition. Experimental results indicate that this hybrid method solves 34% of the instances with 100 customers.
The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for a fleet of electric vehicles subject to intra-route and inter-route constraints. Every vehicle is equipped with a rechargeable battery that depletes while it transports goods along its route. A vehicle must detour to a recharging station to recharge before draining its battery. To approximate a real recharging process, the amount of energy restored is modeled as a piecewise-linear function of the time spent recharging. Furthermore, each station has a small number of chargers, and hence, when and where a vehicle can recharge must be scheduled around the availability of a charger. This interaction between vehicles does not appear in classical vehicle routing problems and motivates the development of new methods that can exploit the joint routing and scheduling structure. This paper proposes a branch-and-cut-and-price algorithm that designates the routing to integer programming using Dantzig–Wolfe decomposition and the scheduling to constraint programming using logic-based Benders decomposition. Experimental results indicate that this hybrid method solves 34% of the instances with 100 customers. •This paper considers the routing of electric vehicles and their recharging en route.•Recharging the batteries of the vehicles is governed by a piecewise-linear function.•Vehicles must recharge at stations with a limited number of chargers.•Hence, the vehicles must be scheduled around the availability of a charger.•The problem is tackled using a branch-and-cut-and-price algorithm.•The algorithm decomposes the routing to integer programming and the scheduling to constraint programming.•Results show that this hybrid algorithm solves instances with up to 100 customers.
ArticleNumber 105870
Author Stuckey, Peter J.
Lam, Edward
Desaulniers, Guy
Author_xml – sequence: 1
  givenname: Edward
  orcidid: 0000-0002-4485-5014
  surname: Lam
  fullname: Lam, Edward
  email: edward.lam@monash.edu
  organization: Monash University, Melbourne, Victoria, Australia
– sequence: 2
  givenname: Guy
  orcidid: 0000-0003-4469-9813
  surname: Desaulniers
  fullname: Desaulniers, Guy
  email: guy.desaulniers@gerad.ca
  organization: Polytechnique Montréal and GERAD, Montreal, Quebec, Canada
– sequence: 3
  givenname: Peter J.
  surname: Stuckey
  fullname: Stuckey, Peter J.
  email: peter.stuckey@monash.edu
  organization: Monash University, Melbourne, Victoria, Australia
BookMark eNp9kU1PGzEQhi0EEgH6A7hZ4soGf8S7XnGiES2VIhVR-nGzvPYs62hjp7bTqP-jP7gO4YA44MvIM_PM6H3nBB364AGhc0qmlND6ajk1IU4ZYaz8hWzIAZpQ2fCqqcWvQzQhnIiKiJk8RicpLUl5DaMT9O9j1N4Mlfa2Mpv8HNfRGcB9iDgPgG9HMLlk8A8YnBkBP4RNdv4J38fQjbDCW5cH_OhWgH86b8M2XeJ7Bwa2LkG1cB50xA9gBh2fdljZgOd6rY3LOoN9XfpWMi74dIaOej0m-PAST9H3T7eP87tq8fXzl_nNojJMiFzRGlrSEsmB1rYhms8sUE5sWxPSghGMdrxjfW9ZLbUW0JCu74jsuJyB6VrJT9HFfu46ht8bSFktwyb6slIVRFLGxUyULrrvMjGkFKFXxaCVjn8VJWpnvlqqYr7ama_25hemecM8yy3ictRufJe83pNQhP9xEFUyDrwB62I5hLLBvUP_Bx9xokA
CitedBy_id crossref_primary_10_1287_ijoc_2023_0404
crossref_primary_10_1016_j_engappai_2023_107113
crossref_primary_10_1287_ijoc_2023_0128
crossref_primary_10_3390_app15031068
crossref_primary_10_1016_j_asoc_2024_112141
crossref_primary_10_3390_en17071596
crossref_primary_10_1016_j_sftr_2024_100347
crossref_primary_10_1016_j_ejtl_2024_100131
crossref_primary_10_1016_j_trb_2024_103011
crossref_primary_10_3390_jmse11101852
crossref_primary_10_1007_s10288_023_00556_2
crossref_primary_10_1016_j_cor_2025_106998
crossref_primary_10_1016_j_tre_2024_103505
crossref_primary_10_3390_math11132879
crossref_primary_10_1016_j_tre_2024_103946
crossref_primary_10_1016_j_jclepro_2022_135703
crossref_primary_10_3390_su151813752
crossref_primary_10_1108_IMDS_08_2023_0581
crossref_primary_10_1007_s10489_024_05803_5
crossref_primary_10_1016_j_tre_2022_102917
crossref_primary_10_1007_s10479_024_06241_9
crossref_primary_10_1016_j_ejor_2024_12_041
crossref_primary_10_1177_03611981231171149
crossref_primary_10_1287_trsc_2022_0272
crossref_primary_10_1016_j_tranpol_2024_01_017
crossref_primary_10_1016_j_tre_2024_103470
crossref_primary_10_26599_TST_2023_9010101
crossref_primary_10_1016_j_ejor_2023_02_012
crossref_primary_10_1016_j_trc_2024_104857
crossref_primary_10_1016_j_jairtraman_2025_102755
crossref_primary_10_1016_j_orp_2024_100303
crossref_primary_10_1016_j_tre_2025_103976
crossref_primary_10_1016_j_trc_2023_104374
crossref_primary_10_1016_j_ocecoaman_2023_106873
crossref_primary_10_3390_su141811681
crossref_primary_10_1016_j_asoc_2025_112704
crossref_primary_10_1016_j_trc_2024_104932
crossref_primary_10_1016_j_ejor_2024_11_044
crossref_primary_10_1007_s10107_024_02141_9
crossref_primary_10_1016_j_trc_2025_105100
crossref_primary_10_1007_s00500_023_09599_3
crossref_primary_10_1016_j_apenergy_2024_123407
crossref_primary_10_1016_j_eswa_2023_122990
crossref_primary_10_1007_s10586_023_04243_z
Cites_doi 10.1287/trsc.1110.0400
10.1007/s10601-010-9103-2
10.1007/s43069-020-00023-2
10.1016/j.cor.2019.02.014
10.1007/s10601-008-9064-x
10.1287/opre.2016.1535
10.1287/opre.1110.0975
10.1609/aaai.v31i1.10654
10.1016/j.trb.2017.02.004
10.1007/s10107-003-0375-9
10.1002/net.20471
10.1287/opre.1050.0234
10.1016/j.cor.2018.12.013
10.1016/j.cor.2019.07.017
10.1287/trsc.2020.0988
10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q
10.1287/trsc.33.1.101
10.1007/s11590-021-01714-3
10.1007/s10107-003-0481-8
10.1287/trsc.2018.0878
10.1287/opre.1060.0286
10.1287/opre.33.5.1050
10.1287/opre.35.2.254
10.1287/trsc.2013.0490
10.1287/trsc.2020.1018
10.1007/s10601-016-9241-2
10.1287/opre.1070.0449
10.1007/s10479-010-0698-x
10.1016/j.cor.2020.105060
ContentType Journal Article
Copyright 2022 Elsevier Ltd
Copyright Pergamon Press Inc. Sep 2022
Copyright_xml – notice: 2022 Elsevier Ltd
– notice: Copyright Pergamon Press Inc. Sep 2022
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/j.cor.2022.105870
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1873-765X
0305-0548
ExternalDocumentID 10_1016_j_cor_2022_105870
S0305054822001423
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
186
1B1
1OL
1RT
1~.
1~5
29F
4.4
457
4G.
5GY
5VS
6J9
7-5
71M
8P~
9JN
9JO
AAAKF
AAAKG
AABNK
AACTN
AAEDT
AAEDW
AAFJI
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AARIN
AAXUO
AAYFN
AAYOK
ABAOU
ABBOA
ABEFU
ABFNM
ABFRF
ABJNI
ABMAC
ABMMH
ABUCO
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNCT
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADGUI
ADJOM
ADMUD
AEBSH
AEFWE
AEHXG
AEKER
AENEX
AFFNX
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AI.
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
AKYCK
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOMHK
AOUOD
APLSM
ARUGR
ASPBG
AVARZ
AVWKF
AXJTR
AZFZN
BKOJK
BKOMP
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
G8K
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
H~9
IHE
J1W
KOM
LY1
M41
MHUIS
MO0
MS~
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
PQQKQ
PRBVW
Q38
R2-
RIG
ROL
RPZ
RXW
SDF
SDG
SDP
SDS
SES
SEW
SPC
SPCBC
SSB
SSD
SSO
SSV
SSW
SSZ
T5K
TAE
TN5
U5U
UAO
UPT
VH1
WUQ
XFK
XPP
ZMT
~02
~G-
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
7SC
8FD
AGCQF
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c255t-16e909083e16d70a34de130d96009ec521b3b2ffd268aa5e70bfb08b384ecb983
IEDL.DBID .~1
ISSN 0305-0548
IngestDate Fri Sep 12 15:46:12 EDT 2025
Thu Apr 24 23:09:34 EDT 2025
Wed Oct 01 02:48:34 EDT 2025
Fri Feb 23 02:40:46 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Scheduling
Logic-based Benders decomposition
Conflict-driven clause learning
Synchronization
Dantzig–Wolfe decomposition
Vehicle routing problem
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c255t-16e909083e16d70a34de130d96009ec521b3b2ffd268aa5e70bfb08b384ecb983
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-4469-9813
0000-0002-4485-5014
PQID 2688123545
PQPubID 45870
ParticipantIDs proquest_journals_2688123545
crossref_primary_10_1016_j_cor_2022_105870
crossref_citationtrail_10_1016_j_cor_2022_105870
elsevier_sciencedirect_doi_10_1016_j_cor_2022_105870
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate September 2022
2022-09-00
20220901
PublicationDateYYYYMMDD 2022-09-01
PublicationDate_xml – month: 09
  year: 2022
  text: September 2022
PublicationDecade 2020
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Computers & operations research
PublicationYear 2022
Publisher Elsevier Ltd
Pergamon Press Inc
Publisher_xml – name: Elsevier Ltd
– name: Pergamon Press Inc
References Desaulniers, Errico, Irnich, Schneider (b11) 2016; 64
Andersen (b1) 2014
Codato, Fischetti (b6) 2006; 54
Jungwirth, Desaulniers, Frey, Kolisch (b24) 2020
Desaulniers, Gschwind, Irnich (b12) 2020; 54
Desaulniers, Desrosiers, Spoorendonk (b10) 2011; 58
Feydy, Stuckey (b15) 2009
Kohl, Desrosiers, Madsen, Solomon, Soumis (b28) 1999; 33
El Hachemi, Gendreau, Rousseau (b14) 2011; 184
Lysgaard, Letchford, Eglese (b36) 2004; 100
Marques Silva, Sakallah (b37) 1996
Lam, Gange, Stuckey, Van Hentenryck, Dekker (b30) 2020; 1
Froger, Mendoza, Jabali, Laporte (b17) 2019; 104
Kilby, Shaw (b27) 2006
Laporte, Nobert, Desrochers (b33) 1985; 33
Ohrimenko, Stuckey, Codish (b39) 2009; 14
Solomon (b42) 1987; 35
Schneider, Stenger, Goeke (b40) 2014; 48
Jepsen, Petersen, Spoorendonk, Pisinger (b23) 2008; 56
Ascheuer, Fischetti, Grötschel (b2) 2000; 36
Lam, Van Hentenryck (b31) 2016; 21
(b9) 2005
Heinz (b20) 2018
Keskin, Laporte, Çatay (b26) 2019; 107
Bruglieri, Mancini, Pisacane (b4) 2019; 112
Schutt, Feydy, Stuckey, Wallace (b41) 2010; 16
Froger, Jabali, Mendoza, Laporte (b16) 2021
Lam, Van Hentenryck (b32) 2017
Montoya, Guéret, Mendoza, Villegas (b38) 2017; 103
Gamrath, Anderson, Bestuzheva, Chen, Eifler, Gasse, Gemander, Gleixner, Gottwald, Halbig, Hendel, Hojny, Koch, Le Bodic, Maher, Matter, Miltenberger, Mühmer, Müller, Pfetsch, Schlösser, Serrano, Shinano, Tawfik, Vigerske, Wegscheider, Weninger, Witzig (b18) 2020
(b43) 2014
Gange, Berg, Demirović, Stuckey (b19) 2020
Keskin, Çatay, Laporte (b25) 2021; 125
Bruglieri, Mancini, Pisacane (b5) 2021; 15
Baldacci, Mingozzi, Roberti (b3) 2011; 59
Kullman, Goodson, Mendoza (b29) 2021; 55
Davies, T.O., Gange, G., Stuckey, P.J., 2017. Automatic Logic-Based Benders Decomposition with MiniZinc. In: Thirty-First AAAI Conference on Artificial Intelligence. pp. 787–793.
Lee (b34) 2020
Costa, Contardo, Desaulniers (b7) 2019; 53
Hooker, Ottosson (b21) 2003; 96
Lübbecke, Desrosiers (b35) 2005; 53
Drexl (b13) 2012; 46
Irnich, Desaulniers (b22) 2005
Hooker (10.1016/j.cor.2022.105870_b21) 2003; 96
Kilby (10.1016/j.cor.2022.105870_b27) 2006
Desaulniers (10.1016/j.cor.2022.105870_b11) 2016; 64
Heinz (10.1016/j.cor.2022.105870_b20) 2018
Ascheuer (10.1016/j.cor.2022.105870_b2) 2000; 36
Lam (10.1016/j.cor.2022.105870_b32) 2017
Desaulniers (10.1016/j.cor.2022.105870_b12) 2020; 54
Costa (10.1016/j.cor.2022.105870_b7) 2019; 53
Jungwirth (10.1016/j.cor.2022.105870_b24) 2020
Solomon (10.1016/j.cor.2022.105870_b42) 1987; 35
Feydy (10.1016/j.cor.2022.105870_b15) 2009
Montoya (10.1016/j.cor.2022.105870_b38) 2017; 103
Irnich (10.1016/j.cor.2022.105870_b22) 2005
(10.1016/j.cor.2022.105870_b43) 2014
El Hachemi (10.1016/j.cor.2022.105870_b14) 2011; 184
Jepsen (10.1016/j.cor.2022.105870_b23) 2008; 56
10.1016/j.cor.2022.105870_b8
Froger (10.1016/j.cor.2022.105870_b16) 2021
Lam (10.1016/j.cor.2022.105870_b30) 2020; 1
Marques Silva (10.1016/j.cor.2022.105870_b37) 1996
Desaulniers (10.1016/j.cor.2022.105870_b10) 2011; 58
Gamrath (10.1016/j.cor.2022.105870_b18) 2020
Laporte (10.1016/j.cor.2022.105870_b33) 1985; 33
Lee (10.1016/j.cor.2022.105870_b34) 2020
Baldacci (10.1016/j.cor.2022.105870_b3) 2011; 59
Bruglieri (10.1016/j.cor.2022.105870_b4) 2019; 112
Lysgaard (10.1016/j.cor.2022.105870_b36) 2004; 100
Schneider (10.1016/j.cor.2022.105870_b40) 2014; 48
Kullman (10.1016/j.cor.2022.105870_b29) 2021; 55
Bruglieri (10.1016/j.cor.2022.105870_b5) 2021; 15
Schutt (10.1016/j.cor.2022.105870_b41) 2010; 16
Lam (10.1016/j.cor.2022.105870_b31) 2016; 21
Codato (10.1016/j.cor.2022.105870_b6) 2006; 54
Keskin (10.1016/j.cor.2022.105870_b25) 2021; 125
Andersen (10.1016/j.cor.2022.105870_b1) 2014
Ohrimenko (10.1016/j.cor.2022.105870_b39) 2009; 14
Froger (10.1016/j.cor.2022.105870_b17) 2019; 104
Gange (10.1016/j.cor.2022.105870_b19) 2020
Kohl (10.1016/j.cor.2022.105870_b28) 1999; 33
Drexl (10.1016/j.cor.2022.105870_b13) 2012; 46
Keskin (10.1016/j.cor.2022.105870_b26) 2019; 107
(10.1016/j.cor.2022.105870_b9) 2005
Lübbecke (10.1016/j.cor.2022.105870_b35) 2005; 53
References_xml – volume: 53
  start-page: 946
  year: 2019
  end-page: 985
  ident: b7
  article-title: Exact Branch-Price-and-Cut algorithms for vehicle routing
  publication-title: Transp. Sci.
– volume: 184
  start-page: 163
  year: 2011
  end-page: 178
  ident: b14
  article-title: A hybrid constraint programming approach to the log-truck scheduling problem
  publication-title: Ann. Oper. Res.
– start-page: 579
  year: 2017
  end-page: 595
  ident: b32
  article-title: Branch-and-check with explanations for the vehicle routing problem with time windows
  publication-title: Proceedings of the 23rd International Conference on Principles and Practice of Constraint Programming
– year: 2014
  ident: b43
– volume: 54
  start-page: 756
  year: 2006
  end-page: 766
  ident: b6
  article-title: Combinatorial Benders’ cuts for mixed-integer linear programming
  publication-title: Oper. Res.
– volume: 55
  start-page: 637
  year: 2021
  end-page: 659
  ident: b29
  article-title: Electric vehicle routing with public charging stations
  publication-title: Transp. Sci.
– year: 2021
  ident: b16
  article-title: The electric vehicle routing problem with capacitated charging stations
  publication-title: Transp. Sci.
– volume: 103
  start-page: 87
  year: 2017
  end-page: 110
  ident: b38
  article-title: The electric vehicle routing problem with nonlinear charging function
  publication-title: Transp. Res. B
– volume: 58
  start-page: 301
  year: 2011
  end-page: 310
  ident: b10
  article-title: Cutting planes for branch-and-price algorithms
  publication-title: Networks
– start-page: 799
  year: 2006
  end-page: 834
  ident: b27
  article-title: Vehicle routing
  publication-title: Handbook of constraint programming
– volume: 21
  start-page: 394
  year: 2016
  end-page: 412
  ident: b31
  article-title: A branch-and-price-and-check model for the vehicle routing problem with location congestion
  publication-title: Constraints
– year: 2005
  ident: b9
– volume: 48
  start-page: 500
  year: 2014
  end-page: 520
  ident: b40
  article-title: The electric vehicle-routing problem with time windows and recharging stations
  publication-title: Transp. Sci.
– volume: 46
  start-page: 297
  year: 2012
  end-page: 316
  ident: b13
  article-title: Synchronization in vehicle routing–a survey of VRPs with multiple synchronization constraints
  publication-title: Transp. Sci.
– volume: 1
  start-page: 22
  year: 2020
  ident: b30
  article-title: Nutmeg: A MIP and CP hybrid solver using branch-and-check
  publication-title: SN Oper. Res. Forum
– start-page: 352
  year: 2009
  end-page: 366
  ident: b15
  article-title: Lazy clause generation reengineered
  publication-title: Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming
– volume: 100
  start-page: 423
  year: 2004
  end-page: 445
  ident: b36
  article-title: A new branch-and-cut algorithm for the capacitated vehicle routing problem
  publication-title: Math. Program.
– start-page: 205
  year: 2020
  end-page: 221
  ident: b19
  article-title: Core-guided and core-boosted search for CP
  publication-title: Proceedings of the 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research
– volume: 15
  start-page: 2813
  year: 2021
  end-page: 2829
  ident: b5
  article-title: A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
  publication-title: Optim. Lett.
– volume: 33
  start-page: 1050
  year: 1985
  end-page: 1073
  ident: b33
  article-title: Optimal routing under capacity and distance restrictions
  publication-title: Oper. Res.
– volume: 16
  start-page: 250
  year: 2010
  end-page: 282
  ident: b41
  article-title: Explaining the cumulative propagator
  publication-title: Constraints
– volume: 112
  year: 2019
  ident: b4
  article-title: The green vehicle routing problem with capacitated alternative fuel stations
  publication-title: Comput. Oper. Res.
– reference: Davies, T.O., Gange, G., Stuckey, P.J., 2017. Automatic Logic-Based Benders Decomposition with MiniZinc. In: Thirty-First AAAI Conference on Artificial Intelligence. pp. 787–793.
– volume: 53
  start-page: 1007
  year: 2005
  end-page: 1023
  ident: b35
  article-title: Selected topics in column generation
  publication-title: Oper. Res.
– start-page: 220
  year: 1996
  end-page: 227
  ident: b37
  article-title: GRASP-a new search algorithm for satisfiability
  publication-title: Proceedings of the 1996 IEEE/ACM International Conference on Computer-Aided Design
– volume: 107
  start-page: 77
  year: 2019
  end-page: 94
  ident: b26
  article-title: Electric vehicle routing problem with time-dependent waiting times at recharging stations
  publication-title: Comput. Oper. Res.
– volume: 104
  start-page: 256
  year: 2019
  end-page: 294
  ident: b17
  article-title: Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
  publication-title: Comput. Oper. Res.
– year: 2014
  ident: b1
  article-title: How to use Farkas’ lemma to say something important about infeasible linear problems
– volume: 59
  start-page: 1269
  year: 2011
  end-page: 1283
  ident: b3
  article-title: New route relaxation and pricing strategies for the vehicle routing problem
  publication-title: Oper. Res.
– volume: 54
  start-page: 1170
  year: 2020
  end-page: 1188
  ident: b12
  article-title: Variable fixing for two-arc sequences in Branch-Price-and-Cut algorithms on path-based models
  publication-title: Transp. Sci.
– year: 2020
  ident: b24
  article-title: Exact branch-price-and-cut for a hospital therapist scheduling problem with flexible service locations and time-dependent location capacity
– volume: 125
  year: 2021
  ident: b25
  article-title: A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
  publication-title: Comput. Oper. Res.
– volume: 35
  start-page: 254
  year: 1987
  end-page: 265
  ident: b42
  article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints
  publication-title: Oper. Res.
– volume: 64
  start-page: 1388
  year: 2016
  end-page: 1405
  ident: b11
  article-title: Exact algorithms for electric vehicle-routing problems with time windows
  publication-title: Oper. Res.
– year: 2020
  ident: b18
  article-title: The SCIP Optimization Suite 7.0
– start-page: 33
  year: 2005
  end-page: 65
  ident: b22
  article-title: Shortest path problems with resource constraints
  publication-title: Column generation
– volume: 14
  start-page: 357
  year: 2009
  end-page: 391
  ident: b39
  article-title: Propagation via lazy clause generation
  publication-title: Constraints
– volume: 96
  start-page: 33
  year: 2003
  end-page: 60
  ident: b21
  article-title: Logic-based Benders decomposition
  publication-title: Math. Program.
– start-page: 1
  year: 2020
  end-page: 24
  ident: b34
  article-title: An exact algorithm for the electric-vehicle routing problem with nonlinear charging time
  publication-title: J. Oper. Res. Soc.
– volume: 36
  start-page: 69
  year: 2000
  end-page: 79
  ident: b2
  article-title: A polyhedral study of the asymmetric traveling salesman problem with time windows
  publication-title: Networks
– year: 2018
  ident: b20
  article-title: Presolving techniques and linear relaxations for cumulative scheduling
– volume: 33
  start-page: 101
  year: 1999
  end-page: 116
  ident: b28
  article-title: 2-path cuts for the vehicle routing problem with time windows
  publication-title: Transp. Sci.
– volume: 56
  start-page: 497
  year: 2008
  end-page: 511
  ident: b23
  article-title: Subset-row inequalities applied to the vehicle-routing problem with time windows
  publication-title: Oper. Res.
– volume: 46
  start-page: 297
  issue: 3
  year: 2012
  ident: 10.1016/j.cor.2022.105870_b13
  article-title: Synchronization in vehicle routing–a survey of VRPs with multiple synchronization constraints
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.1110.0400
– volume: 16
  start-page: 250
  issue: 3
  year: 2010
  ident: 10.1016/j.cor.2022.105870_b41
  article-title: Explaining the cumulative propagator
  publication-title: Constraints
  doi: 10.1007/s10601-010-9103-2
– year: 2014
  ident: 10.1016/j.cor.2022.105870_b43
– volume: 1
  start-page: 22
  issue: 3
  year: 2020
  ident: 10.1016/j.cor.2022.105870_b30
  article-title: Nutmeg: A MIP and CP hybrid solver using branch-and-check
  publication-title: SN Oper. Res. Forum
  doi: 10.1007/s43069-020-00023-2
– volume: 107
  start-page: 77
  year: 2019
  ident: 10.1016/j.cor.2022.105870_b26
  article-title: Electric vehicle routing problem with time-dependent waiting times at recharging stations
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2019.02.014
– volume: 14
  start-page: 357
  issue: 3
  year: 2009
  ident: 10.1016/j.cor.2022.105870_b39
  article-title: Propagation via lazy clause generation
  publication-title: Constraints
  doi: 10.1007/s10601-008-9064-x
– volume: 64
  start-page: 1388
  issue: 6
  year: 2016
  ident: 10.1016/j.cor.2022.105870_b11
  article-title: Exact algorithms for electric vehicle-routing problems with time windows
  publication-title: Oper. Res.
  doi: 10.1287/opre.2016.1535
– volume: 59
  start-page: 1269
  issue: 5
  year: 2011
  ident: 10.1016/j.cor.2022.105870_b3
  article-title: New route relaxation and pricing strategies for the vehicle routing problem
  publication-title: Oper. Res.
  doi: 10.1287/opre.1110.0975
– ident: 10.1016/j.cor.2022.105870_b8
  doi: 10.1609/aaai.v31i1.10654
– year: 2021
  ident: 10.1016/j.cor.2022.105870_b16
  article-title: The electric vehicle routing problem with capacitated charging stations
  publication-title: Transp. Sci.
– volume: 103
  start-page: 87
  year: 2017
  ident: 10.1016/j.cor.2022.105870_b38
  article-title: The electric vehicle routing problem with nonlinear charging function
  publication-title: Transp. Res. B
  doi: 10.1016/j.trb.2017.02.004
– year: 2018
  ident: 10.1016/j.cor.2022.105870_b20
– volume: 96
  start-page: 33
  issue: 1
  year: 2003
  ident: 10.1016/j.cor.2022.105870_b21
  article-title: Logic-based Benders decomposition
  publication-title: Math. Program.
  doi: 10.1007/s10107-003-0375-9
– volume: 58
  start-page: 301
  issue: 4
  year: 2011
  ident: 10.1016/j.cor.2022.105870_b10
  article-title: Cutting planes for branch-and-price algorithms
  publication-title: Networks
  doi: 10.1002/net.20471
– volume: 53
  start-page: 1007
  issue: 6
  year: 2005
  ident: 10.1016/j.cor.2022.105870_b35
  article-title: Selected topics in column generation
  publication-title: Oper. Res.
  doi: 10.1287/opre.1050.0234
– year: 2020
  ident: 10.1016/j.cor.2022.105870_b18
– start-page: 799
  year: 2006
  ident: 10.1016/j.cor.2022.105870_b27
  article-title: Vehicle routing
– volume: 104
  start-page: 256
  year: 2019
  ident: 10.1016/j.cor.2022.105870_b17
  article-title: Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2018.12.013
– volume: 112
  year: 2019
  ident: 10.1016/j.cor.2022.105870_b4
  article-title: The green vehicle routing problem with capacitated alternative fuel stations
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2019.07.017
– start-page: 220
  year: 1996
  ident: 10.1016/j.cor.2022.105870_b37
  article-title: GRASP-a new search algorithm for satisfiability
– volume: 54
  start-page: 1170
  issue: 5
  year: 2020
  ident: 10.1016/j.cor.2022.105870_b12
  article-title: Variable fixing for two-arc sequences in Branch-Price-and-Cut algorithms on path-based models
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2020.0988
– start-page: 205
  year: 2020
  ident: 10.1016/j.cor.2022.105870_b19
  article-title: Core-guided and core-boosted search for CP
– year: 2020
  ident: 10.1016/j.cor.2022.105870_b24
– start-page: 579
  year: 2017
  ident: 10.1016/j.cor.2022.105870_b32
  article-title: Branch-and-check with explanations for the vehicle routing problem with time windows
– year: 2014
  ident: 10.1016/j.cor.2022.105870_b1
– volume: 36
  start-page: 69
  issue: 2
  year: 2000
  ident: 10.1016/j.cor.2022.105870_b2
  article-title: A polyhedral study of the asymmetric traveling salesman problem with time windows
  publication-title: Networks
  doi: 10.1002/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q
– year: 2005
  ident: 10.1016/j.cor.2022.105870_b9
– start-page: 352
  year: 2009
  ident: 10.1016/j.cor.2022.105870_b15
  article-title: Lazy clause generation reengineered
– volume: 33
  start-page: 101
  issue: 1
  year: 1999
  ident: 10.1016/j.cor.2022.105870_b28
  article-title: 2-path cuts for the vehicle routing problem with time windows
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.33.1.101
– volume: 15
  start-page: 2813
  issue: 8
  year: 2021
  ident: 10.1016/j.cor.2022.105870_b5
  article-title: A more efficient cutting planes approach for the green vehicle routing problem with capacitated alternative fuel stations
  publication-title: Optim. Lett.
  doi: 10.1007/s11590-021-01714-3
– volume: 100
  start-page: 423
  issue: 2
  year: 2004
  ident: 10.1016/j.cor.2022.105870_b36
  article-title: A new branch-and-cut algorithm for the capacitated vehicle routing problem
  publication-title: Math. Program.
  doi: 10.1007/s10107-003-0481-8
– volume: 53
  start-page: 946
  issue: 4
  year: 2019
  ident: 10.1016/j.cor.2022.105870_b7
  article-title: Exact Branch-Price-and-Cut algorithms for vehicle routing
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2018.0878
– volume: 54
  start-page: 756
  issue: 4
  year: 2006
  ident: 10.1016/j.cor.2022.105870_b6
  article-title: Combinatorial Benders’ cuts for mixed-integer linear programming
  publication-title: Oper. Res.
  doi: 10.1287/opre.1060.0286
– volume: 33
  start-page: 1050
  issue: 5
  year: 1985
  ident: 10.1016/j.cor.2022.105870_b33
  article-title: Optimal routing under capacity and distance restrictions
  publication-title: Oper. Res.
  doi: 10.1287/opre.33.5.1050
– volume: 35
  start-page: 254
  issue: 2
  year: 1987
  ident: 10.1016/j.cor.2022.105870_b42
  article-title: Algorithms for the vehicle routing and scheduling problems with time window constraints
  publication-title: Oper. Res.
  doi: 10.1287/opre.35.2.254
– volume: 48
  start-page: 500
  issue: 4
  year: 2014
  ident: 10.1016/j.cor.2022.105870_b40
  article-title: The electric vehicle-routing problem with time windows and recharging stations
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2013.0490
– volume: 55
  start-page: 637
  issue: 3
  year: 2021
  ident: 10.1016/j.cor.2022.105870_b29
  article-title: Electric vehicle routing with public charging stations
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2020.1018
– volume: 21
  start-page: 394
  issue: 3
  year: 2016
  ident: 10.1016/j.cor.2022.105870_b31
  article-title: A branch-and-price-and-check model for the vehicle routing problem with location congestion
  publication-title: Constraints
  doi: 10.1007/s10601-016-9241-2
– volume: 56
  start-page: 497
  issue: 2
  year: 2008
  ident: 10.1016/j.cor.2022.105870_b23
  article-title: Subset-row inequalities applied to the vehicle-routing problem with time windows
  publication-title: Oper. Res.
  doi: 10.1287/opre.1070.0449
– start-page: 33
  year: 2005
  ident: 10.1016/j.cor.2022.105870_b22
  article-title: Shortest path problems with resource constraints
– volume: 184
  start-page: 163
  issue: 1
  year: 2011
  ident: 10.1016/j.cor.2022.105870_b14
  article-title: A hybrid constraint programming approach to the log-truck scheduling problem
  publication-title: Ann. Oper. Res.
  doi: 10.1007/s10479-010-0698-x
– start-page: 1
  year: 2020
  ident: 10.1016/j.cor.2022.105870_b34
  article-title: An exact algorithm for the electric-vehicle routing problem with nonlinear charging time
  publication-title: J. Oper. Res. Soc.
– volume: 125
  year: 2021
  ident: 10.1016/j.cor.2022.105870_b25
  article-title: A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations
  publication-title: Comput. Oper. Res.
  doi: 10.1016/j.cor.2020.105060
SSID ssj0000721
Score 2.5852115
Snippet The Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations aims to design minimum-cost routes for...
SourceID proquest
crossref
elsevier
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 105870
SubjectTerms Algorithms
Batteries
Benders decomposition
Charging
Conflict-driven clause learning
Dantzig-Wolfe decomposition
Drainage
Electric vehicles
Integer programming
Linear functions
Logic-based Benders decomposition
Operations research
Rechargeable batteries
Recharging
Route planning
Scheduling
Synchronization
Vehicle routing
Vehicle routing problem
Windows (intervals)
Title Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations
URI https://dx.doi.org/10.1016/j.cor.2022.105870
https://www.proquest.com/docview/2688123545
Volume 145
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Baden-Württemberg Complete Freedom Collection (Elsevier)
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: GBLVA
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Complete Freedom Collection [SCCMFC]
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: ACRLP
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: .~1
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVESC
  databaseName: ScienceDirect Journal Collection
  customDbUrl:
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AIKHN
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVLSH
  databaseName: Elsevier Journals
  customDbUrl:
  mediaType: online
  eissn: 1873-765X
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0000721
  issn: 0305-0548
  databaseCode: AKRWK
  dateStart: 19740101
  isFulltext: true
  providerName: Library Specific Holdings
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LTxsxEB5FVELtoYW0VWkB-cCpws0-7H0caUQUQEKR0kBu1tqeiK2qEDVB3Por-oM7s48SEMqB02p37X3N2PPNeuYbgKM4CUOnilymPvdSYYqyKBItVaKtI4vrMltF-V4mw4k6n-ppB_ptLgyHVTZzfz2nV7N1c6TXfM3eoix7Y1ZVAhxk4RjnR8z4yexfpNPf_jyEeTD_V72SoCW3blc2qxgvcvDIRYwirnabcb3i523Tk1m6Mj2DHXjbYEZxUj_WLnRw3oXtNmS9C-_a0gyiGaldeLPGM_ge_n7n8hk3sph76e5W1XbBbEKCIKsgCChOq2o4pRNXeMM3ERwpRH3FqC44I_h_reB8EXFNXvzt_fJYjEp0eF8uUZJDSwNGEARl3iXuRncQfbLDjlPY0K-fGteL_8sPMBmc_ugPZVOOQTryO1YyTDAPcoJsGCY-DYpYeSQL6MkHCnJ0hANsbKPZzEdJVhQa08DObJDZOFPobJ7FH2FrfjvHTyC0c96qNFbaIfnnsQ2dR51QwyBjmvU9CFpBGNdwlXPJjF-mDUr7aUh2hmVnatntwdf_XRY1UcemxqqVrnmkbYYMyaZu-60mmGaoLw29bcYJx0p_ftlVv8Br3qsD1_Zha_X7Dg8I6azsYaXKh_Dq5OxiePkPErL9Zw
linkProvider Elsevier
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LT9wwEB7BIhV6oO0WVCgFH3qqam0edh5HugItha6QgJabFduzIlW1rLqL-CP9wcwkTnmo4tBTpNiT14xnvonnAfAxzeLYqaqUuS-9VJijrKpMS5Vp68jiusI2Ub7jbHShvl7qyyUYdrkwHFYZdH-r0xttHc4MwtcczOp6cMaiSoCDLBzj_CRdhhWlSSf3YGX_6Hg0vlfIeZN-xfMlE3Sbm02YF_l45CUmCTe8Lbhl8b_N0xNF3Vifw9ewHmCj2G-f7A0s4bQPL7qo9T686roziLBY-_DyQanBt_DnC3fQuJLV1Et3s2iOMy4oJAi1CkKB4qBpiFM78R2v-CaCg4WIVpy2PWcE_7IVnDIifpAjf307_yxOa3R4W89Rkk9La0YQCuXSS0xGdxBDMsWOs9jQPxw6a_f_5xtwcXhwPhzJ0JFBOnI9FjLOsIxKQm0YZz6PqlR5JCPoyQ2KSnQEBWxqk8nEJ1lRVRrzyE5sVNi0UOhsWaSb0JteT_EdCO2ctypPlXZILnpqY-dRZzQxKrjS-hZEHSOMC-XKuWvGL9PFpf00xDvDvDMt77bg01-SWVur47nJquOueSRwhmzJc2Q7nSSYsNrnht624Jxjpbf_76p7sDo6_3ZiTo7Gx-9hjUfaOLYd6C1-3-AHAj4LuxsE-w6sUAAh
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Branch-and-cut-and-price+for+the+Electric+Vehicle+Routing+Problem+with+Time+Windows%2C+Piecewise-Linear+Recharging+and+Capacitated+Recharging+Stations&rft.jtitle=Computers+%26+operations+research&rft.au=Lam%2C+Edward&rft.au=Desaulniers%2C+Guy&rft.au=Stuckey%2C+Peter+J.&rft.date=2022-09-01&rft.issn=0305-0548&rft.volume=145&rft.spage=105870&rft_id=info:doi/10.1016%2Fj.cor.2022.105870&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_cor_2022_105870
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon