Vehicle Routing Optimization Problem Based on Minimum Cost Maximum Flow Model

Addressing the limitation of traditional routing algorithms that can only consider a single factor, this paper proposes a vehicle routing optimization problem based on the minimum cost maximum flow. It introduces the network maximum-flow problem, establishes the path optimization model based on the minimum cost maximum flow, integrates DFS to identify the network augmenting chain, and employs the dual algorithm to solve the minimum-cost maximum-flow problem. An example is provided to demonstrate the solution for the minimum cost and maximum flow of the road network. The results indicate that the minimum-cost maximum-flow problem, by considering multiple factors, exhibits more pronounced advantages in path optimization and cost reduction.