000 | 01330naa a2200217 4500 | ||
---|---|---|---|
008 | 161007b xxu||||| |||| 00| 0 eng d | ||
100 | _aKumar, M Karun | ||
245 | _aA new algorithm to compute pareto-optimal paths in a multi objective fuzzy weighted network | ||
260 |
_a _b _c |
||
300 | _a50 (3) Jul-Sept 2013, 297-318p. | ||
520 | _aThis paper presents a new algorithm to find the shortest path (Pareto optimal) for both single and multiple objective network optimization problem involving fuzziness in objectives or QoS (Quality of Service) parameters. Each fuzzy objective or QoS parameter on the link of a network is represented as a fuzzy number. This algorithm can compute all the Pareto Optimal paths from a selected source node to all other nodes in a network and is applicable for both cyclic and acyclic networks. Computational complexity of the algorithm is presented and compared with other algorithms. The algorithm is illustrated with single and bi-objective fuzzy network optimization problems. | ||
650 | _aNetwork Optimization | ||
650 | _aShortest Path | ||
650 | _aMultiple Objectives | ||
650 | _aQuality of Service | ||
650 | _aPareto minimum | ||
650 | _aFuzzy Number | ||
700 | _aSastry, V N. | ||
773 | 0 |
_090538 _d _oB- 2510 _tBV- Opsearch (Jul - Dec 2013) |
|
942 |
_2ddc _c8 |
||
999 |
_c90580 _d90580 |