The electric vehicle routing problem with shared charging stations

Citations Over TimeTop 10% of 2018 papers

Abstract

Abstract We introduce the electric vehicle routing problem with shared charging stations (E‐VRP‐SCS). The E‐VRP‐SCS extends the electric vehicle routing problem with nonlinear charging function (E‐VRP‐NL) by considering several companies that jointly invest in charging stations (CSs). The objective is to minimize the sum of the fixed opening cost of CSs and the drivers cost. The problem consists of deciding the location and technology of the CSs and building the routes for each company. It is solved by means of a multistart heuristic that performs an adaptive large neighborhood search coupled with the solution of mixed integer linear programs. It also contains a number of advanced efficient procedures tailored to handle specific components of the E‐VRP‐SCS. We perform extensive computational experiments on benchmark instances. We assess the competitiveness of the heuristic on the E‐VRP‐NL and derive 38 new best known solutions. New benchmark results on the E‐VRP‐SCS are presented, solved, and analyzed.

Related Papers

• → Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints(2011)455 cited
• → Emerging Research Fields in Vehicle Routing Problem: A Short Review(2022)29 cited
• → A Contemporary Recapitulation of Major Findings on Vehicle Routing Problems : Models and Methodologies(2019)5 cited
• → Applying Simulated Annealing Approach for Capacitated Vehicle Routing Problems(2006)14 cited
• → The vehicle routing problem with Time Window and Stochastic Demands(VRPTW-SD): Review(2020)4 cited