.png){kind=icon}
.png){kind=icon}
Return
A multi-objective evolutionary artificial bee colony algorithm for optimizing network topology design
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2017.07.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The topological design of a computer communication network is a well-known NP-hard problem. The problem complexity is further magnified by the presence of multiple design objectives and numerous design constraints. This paper presents a goal programming-based multi-objective artificial bee colony optimization (MOABC) algorithm to solve the problem of topological design of distributed local area networks (DLANs). Five design objectives are considered herein, namely, network reliability, network availability, average link utilization, monetary cost, and network delay. Goal programming (GP) is incorporated to aggregate the multiple design objectives into a single objective function. A modified version of MOABC, named as evolutionary multi-objective ABC (EMOABC) is also proposed which incorporates the characteristics of simulated evolution (SE) algorithm for improved local search. The effect of control parameters of MOABC is investigated. Comparison of EMOABC with MOABC and the standard ABC (SABC) shows better performance of EMOABC. Furthermore, a comparative analysis is also done with non-dominated sorting genetic algorithm II (NSGA-II), Paretodominance particle swarm optimization (PDPSO) algorithm and two recent variants of decomposition based multi-objective evolutionary algorithms, namely, MOEA/D-1 and MOEA/D-2. Results indicate that EMOABC demonstrated superior performance than all the other algorithms.
Keywords:
Artificial bee colony algorithm
Goal programming
Network topology design
Multi-objective optimization
Simulated evolution
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W