• Corpus ID: 119572207

A Matheuristic for the Electric Vehicle Routing Problem with Time Windows

@article{Bruglieri2015AMF,
  title={A Matheuristic for the Electric Vehicle Routing Problem with Time Windows},
  author={Maurizio Bruglieri and Ferdinando Pezzella and Ornella Pisacane and Stefano Sampaio Suraci},
  journal={arXiv: Optimization and Control},
  year={2015}
}
The main goal of this paper is to time-effectively route and schedule a fleet of Electric Vehicles (EVs) on a road network in order to serve a set of customers. In particular, we aim to propose an optimized route planning by exploiting the advantages of these vehicles. Nowadays, in fact, electromobility plays a key role for reducing the harmful emissions due, instead, to the use of traditional vehicles. The starting point of this research is represented by the fact that the advanced recent… 

Figures and Tables from this paper

The Hybrid Vehicle Routing Problem
In this paper the Hybrid Vehicle Routing Problem (HVRP) is introduced and formalized. This problem is an extension of the classical VRP in which vehicles can work both electrically and with
Route optimization for an electric vehicle with priority destinations
TLDR
A heuristic search algorithm based on breadth first search is proposed to solve the problem of finding a route of an electric vehicle which is cost-optimized as well as considers priority destinations.
A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches
TLDR
The challenges that emerged with the integration of electric vehicles in the delivery processes are described, together with electric vehicle characteristics and recent energy consumption models.
A three-phase matheuristic for the time-effective electric vehicle routing problem with partial recharges
TLDR
A three-phase matheuristic, combining an exact method with a Variable Neighborhood Search local Branching (VNSB) to route a fleet of Electric Vehicles (EVs) to hierarchically minimize the number of EVs used and the total time spent by the EVs.
A Review of Optimal Routing Problem for Electric Vehicle
TLDR
The EVRP rating is presented in an attempt to provide common classification mechanisms and an annotated bibliography is provided as a clarification of the usefulness of the classification.
Green vehicle routing problem: A state-of-the-art review
TLDR
This paper investigates the main contributions related to the green vehicle routing problem (Green-VRP) and presents a classification scheme based on its variants considered in scientific literature, in particular, three major and applicable streams including internal combustion engine vehicles (ICEVs), alternative-fuel powered vehicles (AFVs), and hybrid electric vehicles (HEVs).
Green Vehicle Routing Problem: A Short Survey
The growth in mobility due to the growing global economy has increased transportation's contribution to energy waste and its various ecological impacts. Vehicle Routing Problem (VRP) represents the
Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities
TLDR
An adaptive large neighborhood search which is enhanced by a lower bounding procedure that helps to efficiently explore promising facility configurations is presented and it is found that combined facilities help to reduce both the overall costs of the operated logistics network and the fleet size.
An Adaptive Large Neighborhood Search for the Location-routing Problem with Intra-route Facilities
TLDR
This paper presents an adaptive large neighborhood search which is enhanced by local search and dynamic programming components, and derives new penalty functions for time-efficient neighborhood evaluation, and assess the competitiveness of the algorithm on the electric vehicle routing problem with time windows for full and partial recharging, and derive new best known solutions for both problem variants.
The Sustainable Parcel Delivery (SPD) Problem: Economic and Environmental Considerations for 3PLs
TLDR
A new SPD model is presented that compares Eclectic Vehicles (EVs) and Fossil Fuel Vehicles (FFVs) considering economic savings and CO2 emissions, for parcel delivery from a single distribution center to a set of delivery point located inside and/or outside an urban area and demonstrates that EVs are more convenient in terms of economic savings when the route (urban distances) and the daily ticket cost increase.
...
1
2
...

References

SHOWING 1-10 OF 25 REFERENCES
The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations
TLDR
This work introduces the electric vehicle-routing problem with time windows and recharging stations E-VRPTW and presents a hybrid heuristic that combines a variable neighborhood search algorithm with a tabu search heuristic, which incorporates the possibility of recharging at any of the available stations using an appropriate recharging scheme.
A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows
TLDR
A Mixed Integer Linear Programming formulation of the problem is proposed assuming that the battery recharging level reached at each station is a decision variable in order to guarantee more flexible routes and a Variable Neighborhood Search Branching is designed for solving the problem at hand in reasonable computational times.
The Recharging Vehicle Routing Problem
This research introduces the recharging vehicle routing problem (RVRP), a new variant of the well-known vehicle routing problem (VRP) where vehicles with limited range are allowed to recharge at
On the Modeling of Recharging Stops in Context of Vehicle Routing Problems
TLDR
Different MIP-formulations for an enhanced VRPTW are described, considering capacity restrictions concerning to cargo and energy, customer time windows and the capability of charging stops and a column generation approach is presented for more realistic problem instances.
Optimization of Charging Stops for Fleet of Electric Vehicles: A Genetic Approach
TLDR
The proposed work addresses the problem of finding the routes for a fleet of electric vehicles which will not only consider the battery limit of the vehicle, but also the concurrent use of charging stations along the route and is based on an evolutionary genetic algorithm with learning strategy.
An Exact Algorithm for the Green Vehicle Routing Problem
TLDR
An exact algorithm for solving the green vehicle routing problem (G-VRP) as a set partitioning problem in which columns represent feasible routes corresponding to simple circuits in a multigraph and valid inequalities including k-path cuts are added.
A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges
This paper presents several heuristics for a variation of the vehicle routing problem in which the transportation fleet is composed of electric vehicles with limited autonomy in need for recharge
Energy-aware Vehicle Routing in Networks with Charging Nodes
TLDR
This work forms a mixed-integer nonlinear programming (MINLP) problem and derive properties of the optimal solution allowing it to be decomposed into two simpler problems, and provides an alternative flow optimization formulation leading to a computationally simpler problem solution with minimal loss in accuracy.
An adaptive VNS algorithm for vehicle routing problems with intermediate stops
TLDR
An adaptive variable neighborhood search (AVNS) is developed to solve the vehicle routing problem with intermediate stops (VRPIS), which considers stopping requirements at intermediate facilities.
A multi-space sampling heuristic for the green vehicle routing problem
The green vehicle routing problem (Green VRP) is an extension of the VRP in which routes are performed using alternative fuel vehicles (AFVs). AFVs have limited tank capacity, so routes may visit
...
1
2
3
...