A Genetic Algorithm to Solve the Minimum-Cost Paths Tree Problem
Ahmed Younes Hamed, Hassan M. R · International journal of Computer Networks & Communications · 2015
One of the important steps in routing is to find a feasible path based on the state information.In order to support real-time multimedia applications, the feasible path that satisfies one or more constraints has to be computed within a very short time.Therefore, the paper presents a genetic algorithm to solve the paths tree problem subject to cost constraints.The objective of the algorithm is to find the set of edges connecting all nodes such that the sum of the edge costs from the source (root) to each node is minimized.I.e. the path from the root to each node must be a minimum cost path connecting them.The algorithm has been applied on two sample networks, the first network with eight nodes, and the last one with eleven nodes to illustrate its efficiency.