A variable neighborhood search branching for the electric vehicle routing problem with time windows

Electronic Notes in Discrete Mathematics

Volumn 47, Issue , 2015, Pages 221-228

  Bruglieri, Maurizio ^a   Pezzella, Ferdinando ^b   Pisacane, Ornella ^c   Suraci, Stefano ^b  

^a POLITECNICO DI MILANO   (Italy)

^b UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

^c ECAMPUS UNIVERSITY   (Italy)

Author keywords

Electromobility; Math heuristics; Recharging stations; Waiting time optimization

Indexed keywords

EID: 84923081329     PISSN: None     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/j.endm.2014.11.029     Document Type: Article

References (9)

1. Baldacci R., Mingozzi A., Roberti R. Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research 2012, 218:1-6.
2. Conrad R., Figliozzi M. The Recharging Vehicle Routing Problem. Proc. of the 61st Annual IIE Conference 2011, 21-25.
3. Erdogan S., Hooks E.M. A green vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 2012, 48:100-114.
4. Figliozzi M.A. Vehicle Routing Problem for Emissions Minimization. Transportation Research Record 2010, 2197:1-7. (originally entitled in the conference proceedings as "Emissions Minimization Vehicle Routing Problem").
5. Fischetti M., Lodi A. Local branching. Mathematical Programming Series B 2003, 98:23-47.
6. Hansen P., Mladenović N., Urošević D. Variable neighborhood search and local branching. Computers & Operations Research 2006, 33:3034-3045.
7. Kumar S., Panneerselvam R. A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management 2012, 4:66-74.
8. Schneider M., Stenger A., Goeke D. The Electric Vehicle Routing Problem with Time Windows and Recharging Stations. Transportation Science 2014, 48:500-520.
9. Solomon M.M. Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 1987, 35:254-265.