Incentive-aware Electric Vehicle Routing Problem: a Bi-level Model and a Joint Solution Algorithm
Fixed pickup and delivery times can strongly limit the performance of freight transportation. Against this backdrop, fleet operators can use compensation mechanisms such as monetary incentives to buy delay time from their customers, in order to improve the fleet efficiency and ultimately minimize the costs of operation. To make the most of such an operational model, the fleet activities and the incentives should be jointly optimized accounting for the customers' reactions. Against this backdrop, this paper presents an incentive-aware electric vehicle routing scheme in which the fleet operator actively provides incentives to the customers in exchange of pickup or delivery time flexibility. Specifically, we first devise a bi-level model whereby the fleet operator optimizes the routes and charging schedules of the fleet jointly with an incentive rate to reimburse the delivery delays experienced by the customers. At the same time, the customers choose the admissible delays by minimizing a monetarily-weighted combination of the delays minus the reimbursement offered by the operator. Second, we tackle the complexity resulting from the bi-level and nonlinear problem structure with an equivalent transformation method, reformulating the problem as a single-level optimization problem that can be solved with standard mixed-integer linear programming algorithms. We demonstrate the effectiveness of our framework via extensive numerical experiments using VRP-REP data from Belgium. Our results show that by jointly optimizing routes and incentives subject to the customers' preferences, the operational costs can be reduced by up to 5%, whilst customers can save more than 30% in total delivery fees.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Designing Optimal Personalized Incentive for Traffic Routing using BIG Hype algorithm
We study the problem of optimally routing plug-in electric and conventional fuel vehicles on a city level. In our model, commuters selfishly aim to minimize a local cost that combines travel time, from a fixed origin to …
Instance-Aware Parameter Configuration in Bilevel Late Acceptance Hill Climbing for the Electric Capacitated Vehicle Routing Problem
Algorithm performance in combinatorial optimization is highly sensitive to parameter settings, while a single globally tuned configuration often fails to exploit the heterogeneity of instances. This limitation is particu…
Parameter PredictionVariable Neighborhood Search for the Electric Vehicle Routing Problem
The Electric Vehicle Routing Problem (EVRP) extends the classical Vehicle Routing Problem (VRP) to reflect the growing use of electric and hybrid vehicles in logistics. Due to the variety of constraints considered in the…
A Multi-Objective approach to the Electric Vehicle Routing Problem
The electric vehicle routing problem (EVRP) has garnered great interest from researchers and industrialists in an attempt to move from fuel-based vehicles to healthier and more efficient electric vehicles (EVs). While it…
Optimal switch from a fossil-fueled to an electric vehicle
In this paper we propose and solve a real options model for the optimal adoption of an electric vehicle. A policymaker promotes the abeyance of fossil-fueled vehicles through an incentive, and the representative fossil-f…