Utilisation of the minimum paths in networks for transport terminals

Abstract

Abstract The reason behind this material consisted in the lack of similarity between complementary issues in a field that includes graphs and networks. For example, a theoretical network problem pretends to determine the minim number of nodes which must be excluded to remove all the grid links, a practical network problem claims to determine the shortest route between 2 nodes when it knows the length of each link. In a strange nod the first problem has a maximum solution, whereas the second problem has no maxim solution (only if the network is oriented and do not allow circuits, conditions that take out the issue from the general sphere, drastically customizing it. The first problem can also develop in the situation in which the issue is to exclude all arcs, less one and almost symptomatic: there was no procedure to offer the second minimum path in the graph. Here, it is proposed a modality to find the second minimum path avoiding the complete enumeration of paths between the 2 nodes taken in consideration. The study case presented in this paper is based on railway terminals-Gara de Nord’s traffic - after the first shortest way for stabling which will be the next, and also this type of application can be used on the efficiency of maritime berth. The utility of the idea concerning the second minimal path is found in the current exploitation of almost any transport system (for e.g. the review of the initial planning, when the established side-tracking in receiving board from the final station cannot be used for intensive traffic reasons, or receiving the train at to another line must be done so as all the future movement of the traffic circulation or train wagon marshal to mess as little as possible the set of movements necessary for further exploitation, receiving the bus to another platform because the first platform is busy with a defective bus).