Metaheuristics and Applications to Optimization Problems in Telecommunications

Recent years have witnessed huge advances in computer technology and communication networks, entailing hard optimization problems in areas such as network design and routing. Metaheuristics are general high-level procedures that coordinate simple heuristics and rules to find good approximate solutions to computationally difficult combinatorial optimization problems. Among them, we find simulated annealing, tabu search, GRASP, VNS, genetic algorithms, and others. They are some of the most effective solution strategies for solving optimization problems in practice and have been applied to a very large variety of problems in telecommunications. In this chapter, we review the main components that are common to different metaheuristics. We also describe the main principles associated with several metaheuristic and we give templates for basic implementations of them. Finally, we present an account of some successful applications of metaheuristics to optimization problems in telecommunications.

[1]  Celso C. Ribeiro,et al.  Local search with perturbations for the prize‐collecting Steiner tree problem in graphs , 2001, Networks.

[2]  Hanan Luss,et al.  Design of Stacked Self-Healing Rings Using a Genetic Algorithm , 2000, J. Heuristics.

[3]  R. Ruthen.  The Frustrations of a Quark Hunter , 1992 .

[4]  Stefan Voß,et al.  Solving General Ring Network Design Problems by Meta-Heuristics , 2000 .

[5]  Fred Glover,et al.  Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory , 2000 .

[6]  Brunilde Sansò,et al.  A Tabu Search Algorithm for Access Network Design , 2001, Ann. Oper. Res..

[7]  Fred Glover,et al.  Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges , 1997 .

[8]  Celso C. Ribeiro,et al.  A Parallel GRASP Heuristic for the 2-Path Network Design Problem (Research Note) , 2002, Euro-Par.

[9]  Celso C. Ribeiro,et al.  Scheduling workover rigs for onshore oil production , 2006, Discret. Appl. Math..

[10]  J. Mellis,et al.  Successful Application of Genetic Algorithms to Network Design and Planning , 2000 .

[11]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[12]  Panos M. Pardalos,et al.  GRASP with Path Relinking for Three-Index Assignment , 2005, INFORMS J. Comput..

[13]  Celso C. Ribeiro,et al.  Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment , 2000, INFORMS J. Comput..

[14]  Rafael Martí,et al.  GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization , 1999, INFORMS J. Comput..

[15]  Edoardo Amaldi,et al.  Planning UMTS base station location: optimization models with power control and algorithms , 2003, IEEE Trans. Wirel. Commun..

[16]  Michel Minoux,et al.  A Comparison of Heuristics for the Discrete Cost Multicommodity Network Optimization Problem , 2003, J. Heuristics.

[17]  Sehun Kim,et al.  A channel allocation for cellular mobile radio systems using simulated annealing , 2000, Telecommun. Syst..

[18]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[19]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[20]  Celso C. Ribeiro,et al.  Greedy randomized adaptive search procedures for the Steiner problem in graphs. , 1997 .

[21]  P. Hansen,et al.  Developments of Variable Neighborhood Search , 2002 .

[22]  Celso C. Ribeiro,et al.  Applications and Parallel Implementations of Metaheuristics in Network Design and Routing , 2004, AACC.

[23]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[24]  Mauricio G. C. Resende,et al.  A Hybrid Heuristic for the p-Median Problem , 2004, J. Heuristics.

[25]  Marcus Randall,et al.  A Simulated Annealing Approach to Communication Network Design , 2002, J. Comb. Optim..

[26]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[27]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Path Relinking , 2001 .

[28]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .

[29]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[30]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[31]  Aravind Srinivasan,et al.  Optimal design of signaling networks for Internet telephony , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[32]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[33]  Jin-Kao Hao,et al.  Tabu Search for Frequency Assignment in Mobile Radio Networks , 1998, J. Heuristics.

[34]  Nenad Mladenović,et al.  An Introduction to Variable Neighborhood Search , 1997 .

[35]  F. S. Pamuk,et al.  A solution to the hub center problem via a single-relocation algorithm with tabu search , 2001 .

[36]  Jean-Yves Potvin,et al.  Diversification strategies in local search for a nonbifurcated network loading problem , 2002, Eur. J. Oper. Res..

[37]  José Luis González Velarde,et al.  A search heuristic for just-in-time scheduling in parallel machines , 1991, J. Intell. Manuf..

[38]  Ashish Tiwari,et al.  A greedy genetic algorithm for the quadratic assignment problem , 2000, Comput. Oper. Res..

[39]  Emile H. L. Aarts,et al.  Selected Topics in Simulated Annealing , 2002 .

[40]  Panos M. Pardalos,et al.  A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem , 1993, Quadratic Assignment and Related Problems.

[41]  Panos M. Pardalos,et al.  Randomized heuristics for the Max-Cut problem , 2002, Optim. Methods Softw..

[42]  M. C. Sinclair,et al.  Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[43]  Sheldon Howard Jacobson,et al.  The Theory and Practice of Simulated Annealing , 2003, Handbook of Metaheuristics.

[44]  Emile H. L. Aarts,et al.  Simulated annealing and Boltzmann machines - a stochastic approach to combinatorial optimization and neural computing , 1990, Wiley-Interscience series in discrete mathematics and optimization.

[45]  N. Mort,et al.  Hybrid Genetic Algorithms for Telecommunications Network Back-Up Routeing , 2000 .

[46]  Fred W. Glover,et al.  Tabu search for dynamic routing communications network design , 1997, Telecommun. Syst..

[47]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .

[48]  Celso C. Ribeiro,et al.  A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking , 2003, WOB.

[49]  Celso C. Ribeiro,et al.  A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy , 2004 .

[50]  Celso C. Ribeiro,et al.  A multistart constructive heuristic for sequencing by hybridization using adaptive memory , 2005, Electron. Notes Discret. Math..

[51]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[52]  J. G. Klincewicz,et al.  Enumeration and Search Procedures for a Hub Location Problem with Economies of Scale , 2002, Ann. Oper. Res..

[53]  D. Manjunath,et al.  Routing and wavelength assignment in optical networks from edge disjoint path algorithms , 2002, IEEE Communications Letters.

[54]  N. M. Stephens,et al.  A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem , 1999, Ann. Oper. Res..

[55]  Celso C. Ribeiro,et al.  Design of Survivable Networks: A survey , 2005 .

[56]  Bo Li,et al.  Server replication and its placement for reliable multicast , 2000, Proceedings Ninth International Conference on Computer Communications and Networks (Cat.No.00EX440).

[57]  J. G. Klincewicz,et al.  Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..

[58]  Louis Anthony Cox,et al.  Designing Least-Cost Survivable Wireless Backhaul Networks , 2000, J. Heuristics.

[59]  Celso C. Ribeiro,et al.  A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs , 2002, INFORMS J. Comput..

[60]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[61]  Sandra Sudarsky,et al.  Massive Quasi-Clique Detection , 2002, LATIN.

[62]  Hugues Delmaire,et al.  REACTIVE GRASP AND TABU SEARCH BASED HEURISTICS FOR THE SINGLE SOURCE CAPACITATED PLANT LOCATION PROBLEM , 1999 .

[63]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[64]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[65]  Poul E. Heegaard,et al.  Scalable distributed discovery of resource paths in telecommunication networks using cooperative ant-like agents , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[66]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[67]  Colin Reeves.  Genetic Algorithms , 2003, Handbook of Metaheuristics.

[68]  Celso C. Ribeiro,et al.  Improved Tabu Search For The Steiner Problem In Graphs , 2000 .

[69]  Panos M. Pardalos,et al.  On maximum clique problems in very large graphs , 1999, External Memory Algorithms.

[70]  Fred Glover,et al.  Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory , 1999, INFORMS J. Comput..