Skip to main content

Applications and Parallel Implementations of Metaheuristics in Network Design and Routing

  • Conference paper
Applied Computing (AACC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3285))

Included in the following conference series:

Abstract

Successful applications of metaheuristics in telecommunications and network design and routing are reviewed, illustrating the major role played by the use of these techniques in the solution of many optimization problems arising in these areas. The main issues involved in the parallelization of metaheuristics are discussed. The 2-path network design problem is used to illustrate the development of robust and efficient parallel cooperative implementations of metaheuristics. Computational results on Linux clusters are reported.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight 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.

References

  1. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in GRASP: An experimental investigation. J. of Heuristics 8, 343–373 (2002)

    Article  MATH  Google Scholar 

  2. Alvim, A.C., Ribeiro, C.C.: Load balancing for the parallelization of the GRASP metaheuristic. In: Proceedings of the X Brazilian Symposium on Computer Architecture, Búzios, pp. 279–282 (1998)

    Google Scholar 

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

    Article  Google Scholar 

  4. Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing. Technical report, Internet and Network Systems Research Center, AT&T Labs Research (2003)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Cung, V.-D., Martins, S.L., Ribeiro, C.C., Roucairol, C.: Strategies for the parallel implementation of metaheuristics. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp. 263–308. Kluwer, Dordrecht (2002)

    Google Scholar 

  8. Dahl, G., Johannessen, B.: The 2-path network design problem. Networks 43, 190–199 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Glover, F.: Tabu search and adaptive memory programing – Advances, applications and challenges. In: Barr, R.S., Helgason, R.V., Kennington, J.L. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer, Dordrecht (1996)

    Google Scholar 

  10. Glover, F., Kochenberger, G.: Handbook of Metaheuristics. Kluwer, Dordrecht (2003)

    MATH  Google Scholar 

  11. Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition coloring. European Journal of Operational Research (to appear)

    Google Scholar 

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

    Article  Google Scholar 

  13. Prais, M., Ribeiro, C.C.: 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 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  16. Resende, M.G.C., Ribeiro, C.C.: GRASP and path-relinking: Recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds.) Metaheuristics: Progress as Real Problem Solvers, Kluwer, Dordrecht (to appear)

    Google Scholar 

  17. Ribeiro, C.C., Rosseti, I.: A parallel GRASP for the 2-path network design problem. LNCS, vol. 2004, pp. 922–926 (2002)

    Google Scholar 

  18. Watanabe, S., Hiroyasu, T., Miki, M.: Parallel evolutionary multi-criterion optimization for mobile telecommunication networks optimization. In: Proceedings of the EUROGEN 2001 Conference, Athens, pp. 167–172 (2001)

    Google Scholar 

  19. Wittner, O., Heegaard, P.E., Helvik, B.: 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 

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

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martins, S.L., Ribeiro, C.C., Rosseti, I. (2004). Applications and Parallel Implementations of Metaheuristics in Network Design and Routing. In: Manandhar, S., Austin, J., Desai, U., Oyanagi, Y., Talukder, A.K. (eds) Applied Computing. AACC 2004. Lecture Notes in Computer Science, vol 3285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30176-9_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30176-9_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23659-7

  • Online ISBN: 978-3-540-30176-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics