Finding Shortest path in a network: Multiple Objective Minimum Cost Problem

The shortest path problem is an interesting subject in Network Flows problems. Some methods have been presented to solve this problem. But if there are multiple types of cost instead of one type, solving this problem is not simple. In fact in this case the nondominated path plays the roll of shortest path. An approach is introduced in this paper determining the nondominated path between every pair of nodes in a network