Biased random-key genetic algorithms with applications in telecommunications

被引：0
作者：
Mauricio G. C. Resende
机构：
[1] AT&T Labs Research,Algorithms and Optimization Research Department
来源：
TOP | 2012年 / 20卷
关键词：
Optimization in telecommunications; Genetic algorithm; Biased random-key genetic algorithm; Random keys; Combinatorial optimization; Heuristics; Metaheuristics; 90C27; 90C35; 90C59; 90C90;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper surveys several applications of biased random-key genetic algorithms (BRKGA) in optimization problems that arise in telecommunications. We first review the basic concepts of BRKGA. This is followed by a description of BRKGA-based heuristics for routing in IP networks, design of survivable IP networks, redundant server location for content distribution, regenerator location in optical networks, and routing and wavelength assignment in optical networks.
引用
收藏
页码：130 / 153
页数：23
相关论文
共 60 条
[1]  
Bannerjee D(1995)Practical approach for routing and wavelength assignment in large wavelength routed optical networks IEEE J Sel Areas Commun 14 903-908
[2]  
Mukherjee B(1994)Genetic algorithms and random keys for sequencing and optimization ORSA J Comput 6 154-160
[3]  
Bean JC(2005)A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing Networks 46 36-56
[4]  
Buriol LS(2007)Survivable IP network design with OSPF routing Networks 49 51-64
[5]  
Resende MGC(2010)A biased random-key genetic algorithm for road congestion minimization Optim Lett 4 619-633
[6]  
Ribeiro CC(2010)The regenerator location problem Networks 55 205-220
[7]  
Thorup M(1959)A note on two problems in connection of graphs Numer Math 1 269-271
[8]  
Buriol LS(2002)A genetic algorithm for the weight setting problem in OSPF routing J Comb Optim 6 299-333
[9]  
Resende MGC(2007)Heuristic solutions for general concave minimum cost network flow problems Networks 50 67-76
[10]  
Thorup M(2004)Increasing Internet capacity using local search Comput Optim Appl 29 13-48
123456