Finding multi-constrained path using genetic algorithm

• Main Authors: Yussof S., See O.H.
• Other Authors: 16023225600
• Format: Conference paper
• Published: 2023
• Subjects: Genetic algorithm; Multi-constrained path; QoS routing; Algorithms; Bioelectric phenomena; Diesel engines; Food additives; Genetic algorithms; Heuristic programming; Image storage tubes; Nuclear propulsion; Quality of service; Telecommunication systems; Exact algorithms; Genetic Algorithm (GA); High probability; International conferences; Malaysia; Multimedia applications; NP-Complete; One way; QoS guarantees; Approximation algorithms

To properly support networked multimedia applications, it is important for the network to provide quality-of-service (QoS) guarantees. One way to provide QoS guarantees is for the network to perform QoS routing, where the path taken must fulfill certain constraints. Multi-constrained path (MCP) problem refers to the problem of finding a path through a network subject to multiple additive constraints. It has been proven that this problem is NP-complete and therefore no exact algorithm can be found. As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. This paper presents a solution to the MCP problem using genetic algorithm (GA). Through simulation, this algorithm has been shown to give a high probability of finding a feasible path if such paths exist. �2007 IEEE.