A Swap-Body Vehicle Routing Problem Considering Fuel Consumption Management and Multiple Vehicle Trips

Abstract

The swap-body vehicle routing problem (SBVRP) represents a specialized extension of the traditional vehicle routing problem (VRP), incorporating additional practical complexities. Effective fuel consumption management and the scheduling of multiple vehicle trips are pivotal strategies for reducing costs and ensuring the sustainability of distribution systems. In response to the acceleration of urbanization, the rising demand for logistics, and the deteriorating living environment, we introduce an SBVRP considering fuel consumption and multiple trips to enable greener, cheaper, and more efficient delivery methods. To tackle the SBVRP, we propose a hybrid multi-population genetic algorithm enhanced with local search techniques to explore various areas of the search space. Computational experiments demonstrate the efficiency of the proposed method and the effectiveness of its components. The algorithm developed in this study provides an optimized solution to the VRP, focusing on achieving environmentally friendly, sustainable, and cost-effective transportation by reducing energy consumption and promoting the rational use of resources.

Keywords

• swap-body vehicle routing problem
• fuel consumption management
• multiple trips
• heuristic algorithm
• local search