|
Title:
|
A GENETIC ALGORITHM WITH MULTIPLE OPERATORS FOR SOLVING THE RING LOADING PROBLEM |
|
Author(s):
|
Anabela Moreira Bernardino , Eugénia Moreira Bernardino , Juan M. Sánchez-pérez , Juan A. Gómez-pulido , Miguel A. Vega-rodríguez |
|
ISBN:
|
978-972-8924-56-0 |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2008 |
|
Edition:
|
Single |
|
Keywords:
|
Optimization, Genetic Algorithms, Ring Loading Problem |
|
Type:
|
Short Paper |
|
First Page:
|
415 |
|
Last Page:
|
420 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Planning optical communication networks suggests a number of new optimization problems, most of them in the field of
combinatorial optimization. We address here the Ring Loading Problem. The objective of the problem is to find a routing
scheme such that the maximum weighted load on the ring is minimized. In this paper we consider two variants:
(i) demands may be split into two parts, and then each part is sent in a different direction; (ii) each demand must be
entirely routed in either of the two directions, clockwise or counterclockwise. In this paper, we propose a genetic
algorithm employing multiple crossover and mutation operators for solving this problem. Two sets of available crossover
and mutation operators are established initially. In each generation a crossover method is selected for recombination and
a mutation method is selected for mutation based on a randomly selection. Simulation results with the different methods
implemented are compared. |
|
|
|
|
|
|
