Skip to main content
SpringerLink
Log in

Metaheuristics and Applications to Optimization Problems in Telecommunications

  • Chapter
Book cover Handbook of Optimization in Telecommunications

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  • E. Aarts and J. Korst. Selected topics in simulated annealing. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 1–37. Kluwer, 2002.

    Google Scholar 

  • E.H.L. Aarts and J. Korst. Simulated annealing and Boltzmann machines: A stochastic approach to combinatorial optimization and neural computing, Wiley, 1989.

    Google Scholar 

  • J. Abello, P.M. Pardalos, and M.G.C. Resende. On maximum clique problems in very large graphs. In J. Abello and J. Vitter, editors, External memory algorithms and visualization, volume 50 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 119–130. American Mathematical Society, 1999.

    Google Scholar 

  • J. Abello, M.G.C. Resende, and S. Sudarsky. Massive quasi-clique detection. Lecture Notes in Computer Science, 2286:598–612, 2002.

    Article  MathSciNet  Google Scholar 

  • R.K. Ahuja, J.B. Orlin, and A. Tiwari. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research, 27:917–934, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • R.M. Aiex, S. Binato, and M.G.C. Resende. Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29:393–430, 2003.

    Article  MathSciNet  Google Scholar 

  • R.M. Aiex, M.G.C. Resende, P.M. Pardalos, and G. Toraldo. GRASP with path-relinking for three-index assignment. INFORMS Journal on Computing, 17:224–247, 2005.

    Article  MathSciNet  Google Scholar 

  • D.J. Aloise, D. Aloise, C.T.M. Rocha, C.C. Ribeiro, J.C. Ribeiro Filho, and L.S.S. Moura. Scheduling workover rigs for onshore oil production. Discrete Applied Mathematics, 2005. To appear.

    Google Scholar 

  • E. Amaldi, A. Capone, and F. Malucelli. Planning UMTS base station location: Optimization models with power control and algorithms. IEEE Transactions on Wireless Communications, 2:939–952, 2003.

    Article  Google Scholar 

  • M. Armony, J.C. Klincewicz, H. Luss, and M.B. Rosenwein. Design of stacked self-healing rings using a genetic algorithm. Journal of Heuristics, 6:85–105, 2000.

    Article  Google Scholar 

  • S. Binato, H. Faria Jr., and M.G.C. Resende. Greedy randomized adaptive path relinking. In J.P. Sousa, editor, Proceedings of the IV Metaheuristics International Conference, pages 393–397, 2001.

    Google Scholar 

  • L.S. Buriol, M.G.C. Resende, C.C. Ribeiro, and M. Thorup. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Networks, 46(1): 36–56, 2005.

    Article  MATH  MathSciNet  Google Scholar 

  • S.A. Canuto, M.G.C. Resende, and C.C. Ribeiro. Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks, 38:50–58, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  • D. Castelino and N. Stephens. A surrogate constraint tabu thresholding implementation for the frequency assignment problem. Annals of Operations Research, 86: 259–270, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  • L.A. Cox and J.R. Sanchez. Designing least-cost survivable wireless backhaul networks. Journal of Heuristics, 6:525–540, 2000.

    Article  MATH  Google Scholar 

  • H. Delmaire, J.A. Díaz, E. Fernández, and M. Ortega. Reactive GRASP and tabu search based heuristics for the single source capacitated plant location problem. INFOR, 37:194–225, 1999.

    Google Scholar 

  • M. Dorigo and T. Stützle. The ant colony optimization metaheuristic: Algorithms, applications, and advances. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 251–285. Kluwer, 2003.

    Google Scholar 

  • T.A. Feo and M.G.C. Resende. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters, 8:67–71, 1989.

    Article  MATH  MathSciNet  Google Scholar 

  • T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  • E.L.R. Fernandes and C.C. Ribeiro. A multistart constructive heuristic for sequencing by hybridization using adaptive memory. Electronic Notes in Discrete Mathematics, 2005. In press.

    Google Scholar 

  • P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Randomized heuristics for the max-cut problem. Optimization Methods and Software, 7, 2002.

    Google Scholar 

  • P. Festa and M.G.C. Resende. GRASP: An annotated bibliography. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 325–367. Kluwer, 2002.

    Google Scholar 

  • A. Fink, G. Schneidereit, and S. Voss. Solving general ring network design problems by meta-heuristics. In M. Laguna and J. L. Gonzalez, editors, Computing Tools for Modeling, Optimization and Simulation(Interfaces in Computer Science and Operations Research), pages 91–113. Kluwer Academic Publishers, 1999.

    Google Scholar 

  • C. Fleurent and F. Glover. Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS Journal on Computing, 11:198–204, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  • V. Gabrel,, A. Knippel, and M. Minoux. A comparison of heuristics for the discrete cost multicommodity network optimization problem. Journal of Heuristics, 9:429–445, 2003.

    Article  Google Scholar 

  • B. Gendron, J.-Y. Potvin, and P. Soriano. Diversification strategies in local search for a nonbifurcated network loading problem. European Journal of Operational Research, 142:231–241, 2000.

    Article  MathSciNet  Google Scholar 

  • A. Girard, B. Sansó, and L. Dadjo. A tabu search algorithm for access network design. Annals of Operations Research, 106:229–262, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  • F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13:533–549, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  • F. Glover. Tabu search-Part I. ORSA Journal on Computing, 1:190–206, 1989.

    MATH  MathSciNet  Google Scholar 

  • F. Glover. Tabu search-Part II. ORSA Journal on Computing, 2:4–32, 1990.

    MATH  Google Scholar 

  • F. Glover. Tabu search and adaptive memory programming — Advances, applications and challenges. In R.S. Barr, R.V. Helgason, and J.L. Kennington, editors, Interfaces in Computer Science and Operations Research, pages 1–75. Kluwer, 1996.

    Google Scholar 

  • F. Giover. Multi-start and strategic oscillation methods — Principles to exploit adaptive memory. In M. Laguna and J.L. Gonzáles-Velarde, editors, Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research, pages 1–24. Kluwer, 2000.

    Google Scholar 

  • F. Glover and M. Laguna. Tabu Search, Kluwer, 1997.

    Google Scholar 

  • F. Glover, M. Laguna, and R. Martí. Scatter search and path relinking: Advances and applications. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuris-tics, pages 1–35. Kluwer, 2003.

    Google Scholar 

  • P. Hansen. The steepest ascent mildest descent heuristic for combinatorial programming. In Congress on Numerical Methods in Combinatorial Optimization, Capri, 1986.

    Google Scholar 

  • P. Hansen and N. Mladenović. An introduction to variable neighbourhood search. In S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Metaheuristics: Advances and trends in local search procedures for optimization, pages 433–458. Kluwer, 1999.

    Google Scholar 

  • P. Hansen and N. Mladenović. Developments of variable neighborhood search. In C.C. Ribeiro and P. Hansen, editors, Essays and Surveys in Metaheuristics, pages 415–439. Kluwer, 2002.

    Google Scholar 

  • P. Hansen and N. Mladenović. Variable neighborhood search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 145–184. Kluwer, 2003.

    Google Scholar 

  • J. Hao, R. Dorne, and P. Galinier. Tabu search for frequency assignment in mobile radio networks. Journal of Heuristics, 4:47–62, 1998.

    Article  MATH  Google Scholar 

  • L. He and N. Mort. Hybrid genetic algorithms for telecommunications network backup routeing. BT Technol. J., 18:42–50, 2000.

    Article  Google Scholar 

  • D. Henderson, S.H. Jacobson, and A.W. Johnson. The theory and practice of simulated annealing. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 287–319. Kluwer, 2003.

    Google Scholar 

  • J.H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, 1975.

    Google Scholar 

  • J.H. Holland. Genetic algorithms. Scientific American, 267:44–50, 1992.

    Article  Google Scholar 

  • S-H. Kim, K-N Chang, and S. Kim. A channel allocation for cellular mobile radio systems using simulated annealing. Telecommunication Systems, 14:95–106, 2000.

    Article  MATH  Google Scholar 

  • S. Kirkpatrick, C.D. Gelatt Jr., and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671–680, 1983.

    Article  MathSciNet  Google Scholar 

  • J.G. Klincewicz. Avoiding local optima in the p-hub location problem using tabu search and grasp. Annals of Operations Research, 40:283–302, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  • J.G. Klincewicz. Enumeration and search procedures for a hub location problem with economies of scale. Annals of Operations Research, 110:107–122, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Laguna and J.L. González-Velarde. A search heuristic for just-in-time scheduling in parallel machines. Journal of Intelligent Manufacturing, 2:253–260, 1991.

    Article  Google Scholar 

  • M. Laguna and R. Martí. GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS Journal on Computing, 11:44–52, 1999.

    Article  MATH  Google Scholar 

  • B. Li, F. Chen, and L. Yin. Server replication and its placement for reliable multicast. In Proceedings of the IEEE ICCCN-00, pages 396–401, 2000.

    Google Scholar 

  • Y. Li, P.M. Pardalos, and M.G.C. Resende. A greedy randomized adaptive search procedure for the quadratic assignment problem. In P.M. Pardalos and H. Wolkowicz, editors, Quadratic assignment and related problems, volume 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 237–261. American Mathematical Society, 1994.

    Google Scholar 

  • P. Manohar, D. Manunath, and R.K. Shevgaonkar. Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Communication Letters, 5:211–213, 2002.

    Article  Google Scholar 

  • S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Greedy randomized adaptive search procedures for the Steiner problem in graphs. In P.M. Pardalos, S. Rajasejaran, and J. Rolim, editors, Randomization Methods in Algorithmic Design, volume 43 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pages 133–145. American Mathematical Society, 1999.

    Google Scholar 

  • S.L. Martins, C.C. Ribeiro, and I. Rosseti. Applications and parallel implementations of metaheuristics in network design and routing. Lecture Notes in Computer Science, 3285:205–213, 2004.

    Google Scholar 

  • N. Mladenović and P. Hansen. Variable neighbourhood search. Computers and Operations Research, 24:1097–1100, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  • T.F. Noronha and C.C. Ribeiro. Routing and wavelength assignment by partition coloring. Technical report, Department of Computer Science, Universidade Federal Fluminense, Niterói, Rio de Janeiro 22410-240, Brazil, 2004. To appear in European Journal of Operational Research.

    Google Scholar 

  • F.S. Pamuk and C. Sepil. A solution to the hub center problem via a single-relocation algorithm with tabu search. HE Transactions, 33:399–411, 2001.

    Google Scholar 

  • K.F. Poon, A. Conway, G. Wardrop, and J. Mellis. Successful application of genetic algorithms to network design and planning. BT Technol. J., 18:32–41, 2000.

    Article  Google Scholar 

  • M. Prais and C.C. Ribeiro. Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS Journal on Computing, 12:164–176, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • M. Randall, G. McMahon, and S. Sugden. A simulated annealing approach to communication network design. J. of Combinatorial Optimization, 6:55–65, 2002.

    Article  MATH  MathSciNet  Google Scholar 

  • C. Reeves. Genetic algorithms. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 65–82. Kluwer, 2003.

    Google Scholar 

  • C.R. Reeves. Genetic algorithms. In C.R. Reeves, editor, Modern heuristic techniques for combinatorial problems, pages 151–196. Wiley, 1993.

    Google Scholar 

  • C.R. Reeves and T. Yamada. Genetic algorithms, path relinking and the flowshop sequencing problem. Evolutionary Computation, 6:45–60, 1998.

    Article  Google Scholar 

  • M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for private virtual circuit routing. Networks, 41:104–114, 2003a.

    Article  MATH  MathSciNet  Google Scholar 

  • M.G.C. Resende and C.C. Ribeiro. GRASP and path-relinking: Recent advances and applications. In T. Ibaraki and Y. Yoshitomi, editors, Proceedings of the Fifth Metaheuristics International Conference, pages T6-1–T6-6, 2003b.

    Google Scholar 

  • M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 219–249. Kluwer, 2003c.

    Google Scholar 

  • M.G.C. Resende and R.F. Werneck. A hybrid heuristic for the p-median problem. Journal of Heuristics, 10:59–88, 2004.

    Article  MATH  Google Scholar 

  • C.C. Ribeiro. GRASP: Une métaheuristique gloutone et probabiliste. In J. Teghem and M. Pirlot, editors, Optimisation approchée en recherche opérationnelle, pages 153–176. Hermès, 2002.

    Google Scholar 

  • C.C. Ribeiro and I. Rosseti. A parallel GRASP heuristic for the 2-path network design problem. Lecture Notes in Computer Science, 2400:922–926, 2002.

    Article  Google Scholar 

  • C.C. Ribeiro and M.C. Souza. Tabu search for the Steiner problem in graphs. Networks, 36:138–146, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  • C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 14:228–246, 2002.

    Article  MathSciNet  Google Scholar 

  • C.C. Ribeiro and D.S. Vianna. A genetic algorithm for the phylogeny problem using an optimized crossover strategy based on path-relinking. Revista Tecnologia da Informação, 3(2):67–70, 2003.

    Google Scholar 

  • M.C. Souza, C. Duhamel, and C.C. Ribeiro. A GRASP with path-relinking heuristic for the capacitated minimum spanning tree problem. In M.G.C. Resende and J. Souza, editors, Metaheuristics: Computer Decision Making, pages 627–658. Kluwer, 2003.

    Google Scholar 

  • A. Srinivasan, K.G. Ramakrishnan, K. Kumaram, M. Aravamudam, and S. Naqvi. Optimal design of signaling networks for Internet telephony. In IEEE INFOCOM 2000, March 2000.

    Google Scholar 

  • G.N. Varela and M.C. Sinclair. Ant colony optimisation for virtual-wavelength-path routing and wavelength allocation. In P.J. Angeline, Z. Michalewicz, M. Schoe-nauer, X. Yao, and A. Zalzala, editors, Proceedings of the Congress on Evolutionary Computation, volume 3, pages 1809–1816, Washington D.C., 1999. IEEE Press.

    Google Scholar 

  • S. Watanabe, T. Hiroyasu, and M. Miki. Parallel evolutionary multi-criterion optimization for mobile telecommunication networks optimization. In Proceedings of the EUROGEN 200I Conference, pages 167–172, Athens, 2001.

    Google Scholar 

  • O. Wittner, P.E. Heegaard, and B. Helvik. Scalable distributed discovery of resource paths in telecommunication networks using cooperative ant-like agents. In Proceedings of the 2003 Congress on Evolutionary Computation, Canberra, 2003.

    Google Scholar 

  • J. Xu, S.Y. Chiu, and F. Glover. Tabu search for dynamic routing communications network design. Telecommunications Systems, 8:55–77, 1997.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Universidade Federal Fluminense, Niterói, Rio de Janeiro, 22410-240, Brazil

    Simone L. Martins & Celso C. Ribeiro

Authors
  1. Simone L. Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Celso C. Ribeiro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. AT&T Labs Research, Florham Park, New Jersey

    Mauricio G. C. Resende

  2. University of Florida, Gainesville, Florida

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer Science+Business Media, Inc.

About this chapter

Cite this chapter

Martins, S.L., Ribeiro, C.C. (2006). Metaheuristics and Applications to Optimization Problems in Telecommunications. In: Resende, M.G.C., Pardalos, P.M. (eds) Handbook of Optimization in Telecommunications. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30165-5_4

Download citation

Publish with us

Policies and ethics

Search

Navigation