An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows

Abstract EN

Due to huge amount of greenhouse gases emission (such as CO2), freight has been adversely affecting the global environment in facilitating the global economy.

Therefore, green vehicle routing problem (GVRP), aiming to minimize the total carbon emissions in the transportation, has become a hot issue.

In this paper, an adaptive large neighborhood search (ALNS) algorithm is proposed to solve large-scale instances of GVRP.

The core of ALNS algorithm is destroy operators and repair operators.

In the destroy operators, a new removal heuristic applying to the characteristics of GVRP is proposed.

The heuristic can quickly remove customers who bring a large amount of carbon emissions with pertinence, and these customers may be arranged more properly in future repair operators.

In the repair operators, a fast insertion method is developed.

In the fast insertion method, the feasibility of a new route is judged by checking the constraints of partial customers after the inserted customer, instead of checking the constraints of all customers.

Thus, the computational time of the ALNS algorithm is greatly saved.

Computational experiments were performed on Solomon benchmark with 100 customers and Homberger benchmark instances with up to 1000 customers.

Given the same computational time, the proposed ALNS improves the average accuracy by 8.49% compared with the classic ALNS.

In the optimal situation, the improvement can achieve 33.61%.