Skip to main content
Log in

Path assignment for call routing: An application of tabu search

  • Various Applications
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

We describe an implementation of tabu search that solves the path assignment problem, which is the problem of routing video data through an undercapacitated telecommunications network. Two versions of the tabu search were studied. Our results compare very favourably with those from other methods.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. L.A. Cox, L. Davis and Y. Qiu, Dynamic anticipatory routing in circuit-switched telecommunications networks, in:Handbook of Genetic Algorithms, ed. L. Davis (Van Nostrand/Reinhold, New York, 1991).

    Google Scholar 

  2. L. Davis, private communication.

  3. F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.

    Google Scholar 

  4. F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4–32.

    Google Scholar 

  5. F. Glover and M. Laguna, Tabu search for a scheduling problem, preprint.

  6. Y. Qiu, private communication.

  7. J. Ryan (ed.), Heuristics for combinatorial optimization, CU-Denver Math Clinic Report (Spring 1990).

  8. J. Yen, Finding thek-shortest loopless paths in a network, Manag. Sci. 17(1971)712–716.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This research was supported by a grant from the Colorado Advanced Software Institute. The work of Jennifer Ryan was also partially supported by the Air Force Office of Scientific Research and the Office of Naval Research Contract #F49620-90-C-0033.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Anderson, C.A., Fraughnaugh, K., Parker, M. et al. Path assignment for call routing: An application of tabu search. Ann Oper Res 41, 299–312 (1993). https://doi.org/10.1007/BF02022997

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02022997

Keywords

Navigation