• EFFICIENT SOLUTIONS OF THE INTERVAL VALUED BICRITERIA SHORTEST PATH PROBLEM

Abstract

An algorithm is developed to attain efficient solutions of the bicriteria shortest path problem from the optimistic and pessimistic points of view. The two criteria are minimizing the cost and duration of travel.  In real life since cost and time are not precise so they are represented by interval numbers. A partial ordering between intervals is defined whereby all types of interval numbers are comparable. A modified and extended form of Dijkstra’s algorithm is used to obtain the set of efficient solutions of the problem. An example is considered to explain the method.