Paper Info
Title
Solving the Ring Loading Problem Using Genetic Algorithms with Intelligent Multiple Operators
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 can 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 counter-clockwise. In this paper, we propose a genetic algorithm employing multiple crossover and mutation operators. 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 the amount fitness improvements achieve over a number of previous operations (recombinations/mutations). We use tournament selection for this purpose. Simulation results with the different methods implemented are compared.
Year
DOI
Venue
2008
10.1007/978-3-540-85863-8_28
INTERNATIONAL SYMPOSIUM ON DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE 2008
Keywords
Field
DocType
Optimization,Genetic Algorithms,Ring Loading Problem
Genetic operator,Mathematical optimization,Crossover,Quadratic assignment problem,Computer science,Meta-optimization,Combinatorial optimization,Tournament selection,Optimization problem,Genetic algorithm
Conference
Volume
ISSN
Citations 
50
1615-3871
5
PageRank 
References 
Authors
0.45
10
5
Name
Order
Citations
PageRank
Anabela Moreira Bernardino1759.44
Eugénia Moreira Bernardino2759.44
Juan Manuel Sánchez-Pérez321928.40
Juan Antonio Gómez-Pulido433443.02
Miguel A. Vega-Rodríguez5741113.05