ABSTRACT

Transportation networks are represented by geometrical figures. Some points (nodes) are mutually connected by lines (links). In the transportation networks, the nodes are usually intersections of lines. In some cases, when searching for the optimal path, one simultaneously tries to optimize two or more objectives. For example, when searching for the best path, one could try to simultaneously optimize travel time, as well as travel costs. In such cases one is dealing with multicriteria shortest path problems. One of the most efficient algorithms for finding shortest paths from one node to all other nodes in a network is the Dijkstra’s algorithm. During the process of discovering the shortest paths, each node can be in one of two possible states: in an open state, if the node is denoted by a temporary label, or in a closed state, if it is denoted by a permanent label.