Abstract
In this paper we presents an algorithm for minimizing the investments for increase the capacity of a transportation network. A transportation network is a graph that simulates a real network like roads network of a country, pipes network for fluid transportation etc. In this paper we consider the case when we need to increase the transportation capacity of the network with a specified quantity from the substance transported. The problem was previously treated in [1] for the case of a simple transportation network. In real life we work with complex network, with many inputs and many outputs (i.e. transportation network for water or gas distributions etc.). When we need to increase the capacity of the network we have two solutions: increase the capacity of one or many existing arcs or installing a new arc between two nodes. This problem involves a total cost of the operations that depend on the selected solution. The aim of this work is to refine the algorithm from [1] for increasing the capacity of a transportation network with a determined value including the internal requests and restriction of the network.