Electric vehicles have gradually become the main means of logistics. Taking into account the battery capacity, charging time, power consumption rate and charging station location, combined with the actual delivery situation that cannot always accurately meet the customer’s time window, this article studies the electric routing problem with soft time window and weight-related discharging, establishes a mixed integer programming model with the goal of minimizing the total cost. Combining the idea of the tabu search algorithm, an improved adaptive large-scale neighbourhood search algorithm is designed to solve it. In this algorithm, a variety of damage operators and repair operators based on the characteristics of the model have been developed to improve the efficiency of the solution. The effectiveness of the model and the algorithm is verified by the calculation example, and it can provide basis of decision-making for the electric vehicle distribution plan of the logistics enterprise.
Electric Vehicle Routing Problem with Soft Time Window and Weight-related Discharging Using Adaptive Large-Scale Neighborhood Search Algorithm
2021-10-20
861126 byte
Conference paper
Electronic Resource
English
British Library Online Contents | 2015
|An adaptive large neighborhood search metaheuristic for the vehicle routing problem with drones
BASE | 2019
|An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem
Online Contents | 2016
|