An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem

Abstract EN

The classical model of vehicle routing problem (VRP) generally minimizes either the total vehicle travelling distance or the total number of dispatched vehicles.

Due to the increased importance of environmental sustainability, one variant of VRPs that minimizes the total vehicle fuel consumption has gained much attention.

The resulting fuel consumption VRP (FCVRP) becomes increasingly important yet difficult.

We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient.

Complexity analysis of FCVRP is presented through analogy with the capacitated VRP.

To tackle the FCVRP’s computational intractability, we propose an efficient two-objective hybrid local search algorithm (TOHLS).

TOHLS is based on a hybrid local search algorithm (HLS) that is also used to solve FCVRP.

Based on the Golden CVRP benchmarks, 60 FCVRP instances are generated and tested.

Finally, the computational results show that the proposed TOHLS significantly outperforms the HLS.