Skip to main content
SpringerLink
Log in

Using Simulated annealing to solve concentrator location problems in telecommunication networks

  • Chapter
Applied Simulated Annealing

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 396))

Abstract

In this paper we describe an algorithm which optimizes the cost of telecommunication networks. The problem consists in finding the number of concentrators, their locations, and the connection of the terminals to concentrators minimizing the total cost of the network. It is also sometimes necessary to dimension concentrators and links when terminals have given traffic characteristics. The algorithm is based on the simulated annealing optimization technique. We compare its results with those obtained with a classical Lagrangian relaxation algorithm. Lastly, we briefly describe a practical operational study: the optimization of the “Française des Jeux” network having more than ten thousand terminals.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. E. Aarts and J. Korst, Simulated annealing and Boltzmann machines, Wiley (1989)

    Google Scholar 

  2. G. Anandalingam, Simulated annealing to optimize LAN interconnection, preprint.

    Google Scholar 

  3. Klaus Andersen, Villy Baek Iversen and René Victor Valqui Vidal, Design of a data communication network using simulated annealing, this issue

    Google Scholar 

  4. J. Beardwood, J.H. Halton and J.M. Hammersley, The shortest path through many points, Proc. of the Cambridge Phil. Society 55 (1959) 299–327

    Google Scholar 

  5. Ernesto Bonomi and Jean Luc Lutton, The N-city travelling salesman problem: statistical mechanics and the Metropolis algorithm, SIAM Review 26 (1984)

    Google Scholar 

  6. Jaime Barcelo, Elna Fernandez and Kurt O. Jörnten, Computational results from a new Lagrangian relaxation algorithm for the capacited plant location problem, European Journal of Operational Research 53 (1991) 38–45

    Article  Google Scholar 

  7. Chi-Chun Lo and aaron Kershenbaum, A two-phase algorithm and performance bounds for the star-star concentrator location problem, IEEE transaction on communication 37 (1989) 1151–1163

    Article  Google Scholar 

  8. Brian A. Coan, Will E. Leland, Mario P. Vecchi, Abel Weinrib and Liang T. Wu, Using distributed topology update and preplanned configurations to achieve trunk network survivability, IEEE Transaction on Reliability 40 (1991) 404–416

    Article  Google Scholar 

  9. G. Cornuéjols, M.L. Fisher and G.L. Nemhauser, Location of banks accounts to optimize float: an analytic study of exact and approximated algorithm, Management Science 23 (1977) 789–810

    Article  Google Scholar 

  10. G. Cornuéjols, R. Sridharan and J.M. Thizy, A comparison of heuristics and relaxations for the capacited plant location problem, European Journal of Operational Research 50 (1991) 280–297

    Article  Google Scholar 

  11. Erlenkotter, A dual-based procedure for uncapacited facilities location, Operations Research 26 (1978) 992–1009

    Article  Google Scholar 

  12. S. Geman and D. Geman, Stochastic relaxation, Gibbs distribution and the Bayesian restoration of images, IEEE Transaction Pattern Analysis and Machine Intelligence PAMI-6 (1984) 721–741

    Google Scholar 

  13. B. Gidas, Non stationnary markov, chains and convergence of the annealing algorithm, Journal of Statistical Physics 39 1 & 2 (1985)

    Google Scholar 

  14. Gabriel Y. Handler and Pitu B. Mirchandani, Location on network: theory and algorithm, MIT Press (1979)

    Google Scholar 

  15. S. Kirkpatrick, C.D. Gelait and M.M. Vecchi, Optimization by simulated annealing, Science 220 (1983) 671–680

    Article  Google Scholar 

  16. Krarupnd P. Pruzan, Simple plant location problem: survey and synthesis, European Journal of Operational Research 12 (1983) 1107–1113

    Google Scholar 

  17. Jean Luc Lutton and Ernesto Bonomi, Simulated annealing algorithm for the minimum weighted perfect Euclidian matching problem, RAIRO Operation Research 20 (1986) 177–197

    Google Scholar 

  18. Jean Luc Lutton, Alain Sutter and Pierre Chardaire, Thermostatistical persistency: a powerful improving concept for simulated annealing algorithm, CNET Technical Report NT/PAA/ATR/ORI/2941, submitted to EOJR.

    Google Scholar 

  19. N. Metropolis, A. Rosenbluth, M. Rosenbluth, A. Teller and E. Teller, Equation of state calculations by fast computing machines, Journal of Chemical Physics 21 (1953) 1087–1092

    Article  Google Scholar 

  20. Pitu B. Mirchandani and Richard L. Francis (edts), Discrete Location theory, Wiley-Interscience Series in Discrete Mathematics and Optimization (1990)

    Google Scholar 

  21. A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: approximation algorithm and bounds, Networks 15 (1985) 1–20

    Google Scholar 

  22. C.H. Papadimitriou, Worst-case and probabilistic analysis of a geometric location problem, SIAM Journal of Computing 10 (1981) 542–557

    Article  Google Scholar 

  23. Alain Sutter, Pierre Chardaire and Jean Luc Lutton, A simulated annealing algorithm for the minimum cost multicommodity flow problem, CNET Technical Report NT/PAA/ATR/ORI/3043, submitted to Telecommunication Systems.

    Google Scholar 

  24. A. Vernekar, G. Anandalingam, and C.N. Dorny, Optimization of ressource location in hierarchical computer network, Computers & operations research, 17 (1990) 375–388

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Groupement PAA/ATR, Centre National d’Etudes des Télécommunications, 38,40 Avenue du Général Leclerc, F-92131, Issy Les Moulineaux, France

    Pierre Chardaire & Jean Luc Lutton

Authors
  1. Pierre Chardaire
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jean Luc Lutton
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Institute of Mathematical Statistics and Operations Research, The Technical University of Denmark, Building 321, DK-2800, Lyngby, Denmark

    René V. V. Vidal (Professor in Operations Research) (Professor in Operations Research)

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Chardaire, P., Lutton, J.L. (1993). Using Simulated annealing to solve concentrator location problems in telecommunication networks. In: Vidal, R.V.V. (eds) Applied Simulated Annealing. Lecture Notes in Economics and Mathematical Systems, vol 396. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46787-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-46787-5_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56229-0

  • Online ISBN: 978-3-642-46787-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation