The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
Reads0
Chats0
TLDR
A new problem, the so-called Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows (EFSMVRPTW), covers real world applications where an optimal mix of different available battery powered (and conventional) vehicles has to be found.About:
This article is published in European Journal of Operational Research.The article was published on 2016-08-01 and is currently open access. It has received 399 citations till now. The article focuses on the topics: Vehicle routing problem & Routing (electronic design automation).read more
Citations
More filters
Journal ArticleDOI
Vehicle Routing Problems for Drone Delivery
TL;DR: In this paper, the authors propose two multi-trip vehicle routing problems (VRPs) specifically for drone delivery scenarios, one minimizes costs subject to a delivery time limit, while the other minimizes the overall delivery time subject to budget constraint.
Journal ArticleDOI
Routing a mixed fleet of electric and conventional vehicles
Dominik Goeke,Michael Schneider +1 more
TL;DR: In this article, the authors proposed an Adaptive Large Neighborhood Search algorithm that is enhanced by a local search for intensification to optimize the routing of a mixed fleet of electric commercial vehicles and conventional internal combustion commercial vehicles (ICCVs).
Journal ArticleDOI
Partial recharge strategies for the electric vehicle routing problem with time windows
Merve Keskin,Bülent Çatay +1 more
TL;DR: This paper forms this problem as a 0–1 mixed integer linear program and develops an Adaptive Large Neighborhood Search (ALNS) algorithm to solve it efficiently and shows that the proposed method is effective in finding high quality solutions and the partial recharging option may significantly improve the routing decisions.
Journal ArticleDOI
Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows
TL;DR: Four variants of the electric vehicle-routing problem with time windows are considered, and it is found that all four variants are solvable for instances with up to 100 customers and 21 recharging stations.
Journal ArticleDOI
Battery degradation and behaviour for electric vehicles: Review and numerical analyses of several models
TL;DR: In this paper, the authors provide tractable models for transportation scientists that will allow predicting the lifetime degradation and instantaneous charging and discharging behaviour of battery electric vehicles (BEV) batteries, which are used for goods distribution.
References
More filters
Journal ArticleDOI
Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
G. Clarke,J. W. Wright +1 more
TL;DR: An iterative procedure is developed that enables the rapid selection of an optimum or near-optimum route and has been programmed for a digital computer but is also suitable for hand computation.
MonographDOI
The vehicle routing problem
Paolo Toth,Daniele Vigo +1 more
TL;DR: In this paper, the authors present a comprehensive overview of the most important techniques proposed for the solution of hard combinatorial problems in the area of vehicle routing problems, focusing on a specific family of problems.
Journal ArticleDOI
Algorithms for the vehicle routing and scheduling problems with time window constraints
TL;DR: This paper considers the design and analysis of algorithms for vehicle routing and scheduling problems with time window constraints and finds that several heuristics performed well in different problem environments; in particular an insertion-type heuristic consistently gave very good results.
Book
Local Search in Combinatorial Optimization
TL;DR: Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in a reasonable time.
Journal ArticleDOI
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows
Stefan Ropke,David Pisinger +1 more
TL;DR: This paper presents a heuristic for the pickup and delivery problem based on an extension of the large neighborhood search heuristic previously suggested for solving the vehicle routing problem with time windows that is very robust and is able to adapt to various instance characteristics.