Research Repository

A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks

Rubio-Largo, Á and Zhang, Q and Vega-Rodríguez, MA (2014) 'A multiobjective evolutionary algorithm based on decomposition with normal boundary intersection for traffic grooming in optical networks.' Information Sciences, 289 (1). 91 - 116. ISSN 0020-0255

Full text not available from this repository.

Abstract

© 2014 Elsevier Inc. All rights reserved. This paper presents a multiobjective optimization algorithm for solving tri-objective optimization problems with objectives of very different scales. As a version of the Multiobjective Evolutionary Algorithm based on Decomposition (MOEA/D), it adopts the Normal Boundary Intersection (NBI) based Tchebycheff approach to decompose a multiobjective optimization problem into a number of single objective subproblems. Particular attention has been paid to set the weight vectors of these subproblems for handling disparately scaled objectives. We have applied our proposed algorithm to a traffic grooming problem in the telecommunication fields. We also propose to use an indirect encoding approach to handle this very complicated problem. Our experimental studies show that our proposed method is able to produce very promising results for this real-world telecommunication problem.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions: Faculty of Science and Health > Computer Science and Electronic Engineering, School of
Depositing User: Jim Jamieson
Date Deposited: 08 Jul 2015 14:13
Last Modified: 17 Oct 2019 14:15
URI: http://repository.essex.ac.uk/id/eprint/14102

Actions (login required)

View Item View Item