Green Vehicle Routing Problem with Capacitated Service Stations

Abstract Logistics distribution requires competitive planning of distribution routes to reduce costs and improve customer satisfaction. As a result, it has garnered significant attention and research. This paper addresses the challenges faced by organizations with alternative fuel-powered vehicle fleets, such as limited vehicle driving range and refueling infrastructure, by proposing a more realistic Green Vehicle Routing Problem (G-VRP). The objective of this study is to optimize the total length of the final planning route and reduce distribution costs. To achieve this, a Hybrid Two-stage Heuristic Algorithm (HTSHA) is introduced to solve the G-VRP with capacitated service stations. Additionally, this paper accounts for the possibility of service stations temporarily failing to provide services and presents a rescheduling strategy for the remaining distribution tasks. The results demonstrate the practical significance of this research in promoting the application of new energy vehicles in urban logistics and distribution.