The green mixed fleet vehicle routing problem with partial battery recharging and time windows

Macrina, Giusy; Pugliese, Luigi Di Puglia; Guerriero, Francesca; Laporte, Gilbert

doi:10.1016/j.cor.2018.07.012

Cited by 140 publications

(68 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Objective functions can be complex with simultaneous minimization of vehicle number, total traveled distance [28], total travel times [29], total routing cost and planning horizon [11,27,30,31], GHG emission [32,33], energy consumption [34][35][36], etc. Total routing costs of BEVs usually consist of BEV acquisition cost, circulation tax, maintenance, costs related to the energy consumption (electric energy price), cost of battery pack renewal after its lifetime, labor costs, etc.…”

Section: Electric Vehicle Routing Problemmentioning

confidence: 99%

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Erdelić

Carić

2019

Journal of Advanced Transportation

165

View full text Add to dashboard Cite

In order to ensure high-quality and on-time delivery in logistic distribution processes, it is necessary to efficiently manage the delivery fleet. Nowadays, due to the new policies and regulations related to greenhouse gas emission in the transport sector, logistic companies are paying higher penalties for each emission gram of CO2/km. With electric vehicle market penetration, many companies are evaluating the integration of electric vehicles in their fleet, as they do not have local greenhouse gas emissions, produce minimal noise, and are independent of the fluctuating oil price. The well-researched vehicle routing problem (VRP) is extended to the electric vehicle routing problem (E-VRP), which takes into account specific characteristics of electric vehicles. In this paper, a literature review on recent developments regarding the E-VRP is presented. 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. Several variants of the E-VRP and related problems are observed. To cope with the new routing challenges in E-VRP, efficient VRP heuristics and metaheuristics had to be adapted. An overview of the state-of-the-art procedures for solving the E-VRP and related problems is presented.

show abstract

Section: Electric Vehicle Routing Problemmentioning

confidence: 99%

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

Erdelić

Carić

2019

Journal of Advanced Transportation

165

View full text Add to dashboard Cite

show abstract

“…Hiermann et al [9] presented a complex meta-heuristic method, which combines a genetic algorithm with a local and large-scale neighborhood search. Macrina et al [28] proposed an iterative local search heuristic algorithm to optimize the routing of hybrid vehicles with electric engines and internal combustion engines. Sun and Zhou [29] proposed a Cost Optimization Algorithm (COA) based on the fact that plug-in hybrid electric vehicles have two power sources, so even along the same route, different power choices will lead to different energy consumption.…”

Section: Literature Reviewmentioning

confidence: 99%

SVND Enhanced Metaheuristic for Plug-In Hybrid Electric Vehicle Routing Problem

Li¹,

Shi²,

Zhao³

et al. 2020

Applied Sciences

View full text Add to dashboard Cite

Plug-in Hybrid Electric Vehicles (PHEVs), as a new type of environmental-friendly low cost transportation, have attracted growing interests for logistics. The path-planning optimization for PHEV has become a major challenge. In fact, PHEV-based routing optimization is a type of hybrid vehicle routing problem (HVRP). Compared with the traditional Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP), the PHEV routing problem should consider more constraints, such as time limits, capacity constraints (including fuel tank capacity and battery capacity), electric stations, fuel stations and so forth. In this paper, a Mixed Integer Linear Programming formulation is presented and a novel hybrid metaheuristic approach (HMA_SVND) is proposed. Our method is a combination of memetic algorithm (MA), sequential variable neighborhood descent (SVND) and a revised 2_opt method. Comparative studies show that our proposed method outperformed previous works.

show abstract

“…Zhang et al [21] devised an ant colony algorithm to solve the EVRP with recharging stations to minimize energy consumption. Macrina et al [22] proposed an ILS heuristic to the mixed fleet vehicle routing problem with partial battery recharging and time windows in which the fleet is composed of electric and conventional vehicles. Froger et al [23] proposed a new model, a heuristic, and an exact labeling algorithm for the EVRP with nonlinear charging functions.…”

Section: Literature Reviewmentioning

confidence: 99%

A Heuristic Approach for a Real-World Electric Vehicle Routing Problem

Zhao

2019

Algorithms

View full text Add to dashboard Cite

To develop a non-polluting and sustainable city, urban administrators encourage logistics companies to use electric vehicles instead of conventional (i.e., fuel-based) vehicles for transportation services. However, electric energy-based limitations pose a new challenge in designing reasonable visiting routes that are essential for the daily operations of companies. Therefore, this paper investigates a real-world electric vehicle routing problem (VRP) raised by a logistics company. The problem combines the features of the capacitated VRP, the VRP with time windows, the heterogeneous fleet VRP, the multi-trip VRP, and the electric VRP with charging stations. To solve such a complicated problem, a heuristic approach based on the adaptive large neighborhood search (ALNS) and integer programming is proposed in this paper. Specifically, a charging station adjustment heuristic and a departure time adjustment heuristic are devised to decrease the total operational cost. Furthermore, the best solution obtained by the ALNS is improved by integer programming. Twenty instances generated from real-world data were used to validate the effectiveness of the proposed algorithm. The results demonstrate that using our algorithm can save 7.52% of operational cost.

show abstract

The green mixed fleet vehicle routing problem with partial battery recharging and time windows

Cited by 140 publications

References 28 publications

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

A Survey on the Electric Vehicle Routing Problem: Variants and Solution Approaches

SVND Enhanced Metaheuristic for Plug-In Hybrid Electric Vehicle Routing Problem

A Heuristic Approach for a Real-World Electric Vehicle Routing Problem

Contact Info

Product

Resources

About