IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-30165-5_4.html
   My bibliography  Save this book chapter

Metaheuristics and Applications to Optimization Problems in Telecommunications

In: Handbook of Optimization in Telecommunications

Author

Listed:
  • Simone L. Martins

    (Universidade Federal Fluminense, Department of Computer Science)

  • Celso C. Ribeiro

    (Universidade Federal Fluminense, Department of Computer Science)

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.

Suggested Citation

  • Simone L. Martins & Celso C. Ribeiro, 2006. "Metaheuristics and Applications to Optimization Problems in Telecommunications," Springer Books, in: Mauricio G. C. Resende & Panos M. Pardalos (ed.), Handbook of Optimization in Telecommunications, chapter 4, pages 103-128, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-30165-5_4
    DOI: 10.1007/978-0-387-30165-5_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-30165-5_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.