Applying tabu search to spare capacity planning for network restoration

Computers and Operations Research

Volumn 26, Issue 12, 1999, Pages 1175-1194

  Shyur, Ching Chir ^a   Lu, Ta Chien ^a   Wen, Ue Pyng ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Capacity planning; Tabu search; Telecommunication network

Indexed keywords

NETWORK SPARE CAPACITY PLANNING PROBLEMS; TABU SEARCH;

ALGORITHMS; COMPUTATIONAL METHODS; CONGESTION CONTROL (COMMUNICATION); PROBLEM SOLVING; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC;

TELECOMMUNICATION NETWORKS;

MATHEMATICAL METHOD;

EID: 0033400246     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(98)00102-6     Document Type: Article

References (26)

1. Nemhauser GL, Rinnooy Kan AHG, Todd MJ. Handbooks in Operations Researcher and Management Science: Volume 1-Optimization. Amsterdam: North-Holland, 1989.
2. Dijkstra, E. A note on two problems in connexion with graphs. Numerical Mathematics 1959;1:269-71.
3. Chujo T, Komine H, Miyazaki K, Ogura T, Soelima T. The design and simulation of an intelligent transport network with distributed control. Proceedings of Network Operations Management Symposium. San Diego, CA, February 1990.
4. Sakauchi H, Nashimura Y, Hasegawa S. A self-healing network with an economical spare-channel assignment. Proceedings of IEEE GLOBECOM'90, San Diego, CA, 1990:403.1.1-6.
5. Grover WD, Rawat V, MacGregor MH. Fast heuristic principle for spare capacity placement in mesh-restorable SONET/SDH transport networks. Electronics Letters 1997;33(3):195-6.
6. Digital Cross-connect Systems in Transport Network Survivability: Survivability Analysis of Transport Network, SR-NWT-002514, Bellcore, Issue 1, 1993.
7. Wu T-H. Fiber Network Service Survivability. Boston, MA: Artech House, 1992.
8. Roohy-Laleh E, Abdou E, Hopkins J, Wagner MA. A procedure for designing a low connected survivable fiber network. IEEE Journal on Selected Areas in Communications 1986;SAC-4(7):1112-7.
9. Hasegawa S, Kanemasa A, Sakaguchi H, Maruta R. Dynamic reconfiguration of digital cross-connect systems with network control and management. Proceedings of IEEE Globecom '87, 1987:28.3.1-5.
10. Sabat J, Lakshminarayan M. An algorithm for improving survivability of fiber based networks. Proceeding 4th International Network Planning Symposium, Palam de Mallorca, Spain, 1989:379-84.
11. Horong WG. A mathematical model for deciding the capacity of standby links in transmission network. TL Technical Journal 1989;19(3):313-9.
12. Grover WD, Bilodeau TD, Venables BD. Near optimal spare capacity planning in a mesh-restorable network. Proceedings Of IEEE Globecom '91, 1991:2007-12.
13. Venables BD, Grover WD, Macgregor MH. Two strategies for spare capacity placement in mesh restorable networks. Proceedings of IEEE ICC93, 1993:267-71.
14. Herzberg M, Bye SJ, Utano A. The hop-limit approach for spare-capacity assignment in survivability networks. IEEE/ACM Transactions on Networking 1995;3(6):775- 84.
15. Wu YM, Shyur CC, Tsao SH. Digital cross-connect system restoration application planning. Proceedings of International Symposium on Communication, Hsinchu, Taiwan, ROC, 1993:4.1.1-11.
16. Glover F. Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 1986;13:533-49.
17. Glover F. Tabu search-Part I. ORSA Journal on Computing 1989;1(3):190-206.
18. Laguna M, Glover F. Bandwidth packing: A tabu search approach. Management Science 1993;39 (4):492-500.
19. Knox J. Tabu search performance on the symmetric traveling salesman problem. Computers and Operations Research 1994;21(8):867-76.
20. Widmer M, Hertz A. A new heuristic method for the flow shop sequencing problem. European Journal of Operations Research 1989;41:186-93.
21. Dell'Amico M, Trubian M. Applying tabu search to the job-shop scheduling problem. Annals of Operations Research 1993;41:231-52.
22. Rochat Y, Semet F. A tabu search approach for delivering pet food and flour in Switzerland. Journal Operational Research Society 1994; 45(11):1233-46.
23. Anderson CA, Fraughnaugh K, Parker M, Ryan J. Path assignment for call routing: An application of tabu search. Annals of Operations Research 1993;41:301-12.
24. Glover F, Laguna M. Tabu search. In: Reeves C, editors. Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publishing, 1993:70-141.
25. Koh SJ, Lee CY. A tabu search for the survivable fiber optic communication network design. Computers and Industrial Engineering 1995;28(4):689-700.
26. Ahuja RK, Magnanti TL, Orlin JB. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, 1993:113-22 Englewood Cliff, N.J.