Abstract
We present a study of using tabu search to solve a specific network design problem arising in the telecommunication industry. We develop a tabu search heuristic for this problem that incorporates long-term memory and probabilistic move selections. Computational results show that the new heuristic consistently outperforms the best local search currently available, with significantly increased performance differences on more difficult problems.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
F. Glover, Tabu search — Part I, ORSA J. Comput. 3(1989)190–206.
F. Glover, Tabu search fundamentals and uses, Working Paper, Graduate School of Business, University of Colorado at Boulder, Boulder, CO (1995).
F. Glover and M. Laguna, Tabu search, in:Moderin Heuristics for Combinatorial Problems, ed. C. Reeves (Blackwell Scientific, 1993).
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).
F. Glover, M. Laguna, E. Taillard, D. de Werra (eds.), Ann. Oper. Res. 41 (1993).
Y. Lee, L. Lu, Y. Qiu and F. Glover, Strong formulations and cutting planes for designing digital data service networks, Telcom. Syst. 2(1994)261–274.
Y. Lee, Y. Chiu and J. Ryan, A branch and cut algorithm for a Steiner tree-star problem, INFORMS J. Comput., to be published.
J. Xu, S.Y. Chiu and F. Glover, Probabilistic tabu search for telecommunications network design, J. Combinatorial Optimiz., to be published.
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 (1996).
Author information
Authors and Affiliations
Additional information
This research was supported in part by Air Force Office of Scientific Research AASERT Grant No. F49620-92-J-0248-DEF.
Rights and permissions
About this article
Cite this article
Xu, J., Chiu, S.Y. & Glover, F. Using tabu search to solve the Steiner tree-star problem in telecommunications network design. Telecommunication Systems 6, 117–125 (1996). https://doi.org/10.1007/BF02114289
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02114289