Abstract
This work presents a new variant of the Green Vehicle Routing Problem with time windows. We propose an iterative local search heuristic to optimize the routing of a mixed vehicle fleet, composed of electric and conventional (internal combustion engine) vehicles. Since the batteries of electric vehicles have a limited autonomy of the battery, we consider the possibility of recharging partially at any of the available stations. In addition, we explicitly take into account a limitation on the polluting emissions for the conventional vehicles. The behaviour of the proposed approach is evaluated empirically on a large set of test instances.
Original language | English |
---|---|
Pages (from-to) | 183-199 |
Number of pages | 17 |
Journal | Computers and Operations Research |
Volume | 101 |
DOIs | |
Publication status | Published - Jan 2019 |
Keywords
- Electric vehicles
- Green vehicle routing
- Iterated local search
- Mixed fleet
- Pollution routing
ASJC Scopus subject areas
- General Computer Science
- Modelling and Simulation
- Management Science and Operations Research