Route Optimization for Open Vehicle Routing Problem (OVRP): A Mathematical and Solution Approach

In the everchanging landscape of human mobility and commerce, efficient route planning has become paramount. This paper addresses the open vehicle routing problem (OVRP), a major logistical challenge in route optimization for a fleet of vehicles serving geographically dispersed customers. Using a heuristic approach, we explore the complexities of OVRP, comparing the results with advanced optimization methods. This study not only highlights the effectiveness of mathematical modeling, but also explores the practicality of heuristic algorithms such as Greedy, Nearest Neighbor and 2-opt to provide quality solutions. The findings highlight the nuanced interplay between solution quality and computational efficiency, providing valuable insights for addressing real-world logistics challenges. Recommendations delve into optimization opportunities and the integration of emerging technologies, ensuring adaptable solutions to the intricate the problem of open vehicle routing.