Strength Pareto Evolutionary Algorithm based Multi-Objective Optimization for Shortest Path Routing Problem in Computer Networks
| Autor: | Chitra Chinnasamy, Subbaraj Potti |
|---|---|
| Rok vydání: | 2011 |
| Předmět: |
Mathematical optimization
education.field_of_study Optimization problem Computer Networks and Communications Computer science Node (networking) Computer Science::Neural and Evolutionary Computation Population Problem statement Pareto principle Evolutionary algorithm Multi-objective optimization Dynamic programming Artificial Intelligence Shortest path problem Routing (electronic design automation) education Cluster analysis Software |
| Zdroj: | Journal of Computer Science. 7:17-26 |
| ISSN: | 1549-3636 |
| DOI: | 10.3844/jcssp.2011.17.26 |
| Popis: | Problem statement: A new multi-objective approach, Strength Pareto Evolutionary Algorithm (SPEA), is presented in this paper to solve the shortest path routing problem. The routing problem is formulated as a multi-objective mathematical programming problem which attempts to minimize both cost and delay objectives simultaneously. Approach: SPEA handles the shortest path routing problem as a true multi-objective optimization problem with competing and noncommensurable objectives. Results: SPEA combines several features of previous multi-objective evolutionary algorithms in a unique manner. SPEA stores nondominated solutions externally in another continuously-updated population and uses a hierarchical clustering algorithm to provide the decision maker with a manageable pareto-optimal set. SPEA is applied to a 20 node network as well as to large size networks ranging from 50-200 nodes. Conclusion: The results demonstrate the capabilities of the proposed approach to generate true and well distributed pareto-optimal nondominated solutions. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|