Solving a dynamic routing problem using an optimization algorithm

Abstract

Optimizing the configuration of the freight transport network is a challenge. The search for the optimal route solution in a dynamic urban multimodal transport network is aimed at minimizing the cost based on accurate forecasting of traffic flows and cost estimation. The purpose of the study is to review a methodology that can be applied centrally, by an organization that develops solutions for routing shippers, minimizing the total cost, assuming that all shippers involved in transportation send their requirements to a single coordinating center. Evaluation of a multimodal cargo routing system with restrictions on the number of vehicles is based on a hierarchical approach. It consists of several stages: prognostic modeling of the state of the traffic load of the road network and cost estimation for optimization, which includes a methodology for finding the optimal load to accelerate the convergence of the algorithm.