Multiple objectives such as cost, time, distance, risk, delay, reliability, quality of service and environmental impact arise in network optimization problems. The main purpose is to optimize performance with respect to predefined objectives. While dealing with the above said network, one requires the computation of shortest path from one node to another, called shortest path problem (SPP). Recently, Sastry, et al (Ref. 1) have introduced three algorithms to obtain a Pareto optimal path in MOSSP. The present article introduces a new concept of properly Pareto optimal path from one node to another in MOSSP which is stronger than Pareto optimal path. (6 refs.)
展开▼
