Skip to main content
Log in

Tabu search for dynamic routing communications network design

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

This paper presents a tabu search approach for optimizing the link capacities in a dynamic routing telecommunications network. The traffic between any two nodes in the network is routed over a one‐link direct path or, if no direct capacity is available, over a two‐link alternate path. The alternate routing paths can be changed dynamically from hour to hour as the traffic between pairs of nodes may vary with the time of day. The problem is to determine the optimal capacity level for each link in the network to minimize cost while satisfying the grade‐of‐service constraints. Although the problem can be formulated as a nonlinear integer programming problem, no efficient solution procedures are available. In this paper, we develop a two‐level tabu search heuristic for solving the problem that utilizes probabilistic move selection and coordinated solution recovery strategies. The macro level of the algorithm iteratively determines an hour for possible improvement and then the micro level seeks to optimize the routing paths for that hour. Our computational experience with both real and simulated problems indicates that significant savings can be obtained by this approach over the conventional network designs.

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

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. A. Anderson, K.F. Jones and J. Ryan, Path assignment for call routing: An application of tabu search, Annals of Operations Research 41 (1993).

  2. G.R. Ash, R.H. Cardwell and R.P. Murray, Design and optimization of networks with dynamic routing, The Bell System Technical Journal 60 (1981) 1787–1820.

    Google Scholar 

  3. R.F. Farmer and I. Kaufman, On the numerical evaluation of some basic traffic formulae, Networks 8 (1978) 153–186.

    Google Scholar 

  4. F. Glover, Tabu search – Part I, ORSA Journal of Computing 3 (1989) 190–206.

    Google Scholar 

  5. F. Glover, Tabu search fundamentals and uses, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1995).

    Google Scholar 

  6. F. Glover and M. Laguna, Tabu search, in: Modern Heuristics for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific Publishing, 1993).

  7. F. Glover and A. Løkketangen, Probabilistic tabu search for zero–one mixed integer programming problems, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1994).

    Google Scholar 

  8. A. Kershenbaum, Telecommunications Network Design Algorithms (McGraw-Hill, 1993).

  9. M. Laguna, Clustering for the design of SONET rings in interoffice telecommunications, Management Science 40 (1994) 1533–1544.

    Article  Google Scholar 

  10. M. Laguna and F. Glover, Bandwidth packing: A tabu search approach, Management Science 39 (1993) 492–500.

    Google Scholar 

  11. Y. Rapp, Planning of junction networks in a multi-exchange area, Ericson, Technics 1 (1964).

  12. E. Rosenberg, A nonlinear programming heuristics for computing optimal link capacities in a multi-hour alternate routing communications network, Operations Research 35 (1987) 354–364.

    Google Scholar 

  13. D. Skorin-Kapov and J. Skorin-Kapov, On tabu search for the location of interacting hub facilities, European Journal of Operations Research 73 (1994) 502–509.

    Article  Google Scholar 

  14. R. Syski, Introduction to Congestion Theory in Telephone Systems (Oliver and Boyd, London, 1960).

    Google Scholar 

  15. R.I. Wilkenson, Theories for toll traffic engineering in the USA, The Bell System Technical Journal 35 (1956) 421–514.

    Google Scholar 

  16. J. Xu, S.Y. Chiu and F. Glover, Tabu search heuristics for designing a Steiner tree based digital line network, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1995).

    Google Scholar 

  17. J. Xu, S.Y. Chiu and F. Glover, Probabilistic tabu search for telecommunications network design, Journal of Combinatorial Optimization, Special issue on topological network design (1996).

  18. J. Xu, S.Y. Chiu and F. Glover, Fine-tuning a tabu search algorithm with statistical tests, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1996).

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xu, J., Chiu, S.Y. & Glover, F. Tabu search for dynamic routing communications network design. Telecommunication Systems 8, 55–77 (1997). https://doi.org/10.1023/A:1019149101850

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1019149101850

Keywords

Navigation