Abstract
This 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
