Title
A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges.
Abstract
We propose a three-phase matheuristic, combining an exact method with a Variable Neighborhood Search local Branching (VNSB) to route a fleet of Electric Vehicles (EVs). EVs are allowed stopping at the recharging stations along their routes to (also partially) recharge their batteries. We hierarchically minimize the number of EVs used and the total time spent by the EVs, i.e., travel times, charging times and waiting times (due to the customer time windows). The first two phases are based on Mixed Integer Linear Programs to generate feasible solutions, used in a VNSB algorithm. Numerical results on benchmark instances show that the proposed approach finds good quality solutions in reasonable amount of time.
Year
DOI
Venue
2017
10.1016/j.endm.2017.03.013
Electronic Notes in Discrete Mathematics
Keywords
Field
DocType
Time Windows,Green Logistics,Recharging Decisions,Variable Neighborhood Search
Integer,Discrete mathematics,Green logistics,Mathematical optimization,Variable neighborhood search,Simulation,Electric vehicle,Three-phase,Mathematics,Branching (version control)
Journal
Volume
ISSN
Citations 
58
1571-0653
5
PageRank 
References 
Authors
0.42
4
5
Name
Order
Citations
PageRank
Maurizio Bruglieri111013.34
Simona Mancini2184.35
Ferdinando Pezzella3353.65
Ornella Pisacane411610.20
Stefano Suraci5271.46