Hydrogen Vehicle Routing Problem with Time Windows and Vehicle Capacity

The topic of sustainable transportation plays a central role in a global context focused on reducing greenhouse gas emissions and transitioning to cleaner energy sources. In this perspective, hydrogen vehicles (HVs) emerge as a promising solution, providing an environmentally friendly alternative to traditional fossil fuels. Hydrogen distribution (HD) is an essential aspect of the development of a hydrogen economy. This paper presents an issue related to the hydrogen vehicle routing problem (H-VRP) utilizing HVs while incorporating temporal constraints. Costs associated with driving, penalties incurred for not adhering to time windows, and the capacity of the vehicles are all taken into consideration to determine optimal routes. To address this challenge, a heuristics method such as the genetic algorithm (GA) has been developed as a robust method, demonstrating its effectiveness in solving the Hydrogen Vehicle Routing Problem with Time Window (H-VRPTW) and vehicle capacity using HVs.