Multi-Objective Optimization to Find The Shortest Paths Tree Problem in The Computer Networks

Authors

Mahmoud A. Mofaddel, Math. and Computer Science Dept., Faculty of Science, Sohag University, Sohag, EgyptFollow
Ahmed Y. Hamed, College of Applied Studies and Community Services, Imam Abdul-Rahman Bin Faisal University, KSAFollow

Author Country (or Countries)

Egypt

Abstract

The shortest paths tree problem when considering cost and bandwidth constraints is addressed in this paper as multiobjective shortest paths tree problem. A multi-objective genetic algorithm is suitable to solve the presented problem. Therefore, this paper presents a multi-objective genetic algorithm based on Random Weighted Genetic Algorithm (RWGA) to solve the shortest paths tree problem subject to cost and bandwidth constraints. The objective of the proposed algorithm is to search the optimal set of edges connecting all nodes such that the sum of costs is minimized and the value bandwidth is maximized. The presented algorithm has been applied on two sample networks to illustrate their efficiency.

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/120115

Recommended Citation

A. Mofaddel, Mahmoud and Y. Hamed, Ahmed (2018) "Multi-Objective Optimization to Find The Shortest Paths Tree Problem in The Computer Networks," Applied Mathematics & Information Sciences: Vol. 12: Iss. 1, Article 15.
DOI: http://dx.doi.org/10.18576/amis/120115
Available at: https://digitalcommons.aaru.edu.jo/amis/vol12/iss1/15