This paper proposes a cost-efficient solution for the routing network associated with the management of supplier-customer 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).
Supplier-client, Transport network, Reconfigurable management system, Online replacement path.
Radu BÎLBÎIE, Cătălin DIMON, Dumitru POPESCU, "Efficiency for Routing Networks Management in Supplier-customer Distribution Systems", Studies in Informatics and Control, ISSN 1220-1766, vol. 33(2), pp. 51-58, 2024. https://doi.org/10.24846/v33i2y202405
All articles published by Studies in Informatics and Control (SIC) are published in accordance with the terms and conditions of the Creative Commons Attribution License (CC BY-NC-SA 4.0).