Efficiency for Routing Networks Management in Supplier-customer Distribution Systems
Abstract
This paper proposes a cost-efficient solution for the routing network associated with the management of suppliercustomer distribution systems. The main objective is to determine the minimum cost path in a transportation network affected by various incidents, either critical and/or non-critical. Based on the supplier and customer demands and the evaluated transport costs, the corresponding solution was computed by using Dijkstra's algorithm. The novelty of the proposed solution lies in the possibility to continuously adjust transport costs per road segments, even eliminate some road segments, and to re-generate a new optimal solution in real time (online replacement path problem).