Abstract
Synchronous Optical Network (SONET) in North America and Synchronous Digital Hierarchy (SDH) in Europe and Japan are the current transmission and multiplexing standards for high speed signals within the carrier infrastructure. The typical topology of a SONET network is a collection of rings connecting all the customer sites. We deal with a design problem in which each customer has to be assigned to exactly one ring and these rings have to be connected through a single federal ring. A capacity constraint on each ring is also imposed. The problem is to find a feasible assignment of the customers minimizing the total number of rings used. A Tabu Search method is proposed to solve the problem. The key elements are the use of a variable objective function and the strategic use of two neighborhoods. We have also implemented other techniques such as Path Relinking, eXploring Tabu Search and a Scatter Search. Extensive computational experiments have been done using two sets of benchmark instances. The performances of the proposed algorithms have also been compared with those of three multistart algorithms involving greedy methods previously proposed for the problem, and of the CPLEX solver. The computational experiments show the effectiveness of the proposed Tabu Search.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dell'Amico, M., A. Lodi and F. Maffioli (1999) "Solution of the Cumulative Assignment Problem with a Well-Structured Tabu Search Method," Journal of Heuristics, 5(2): 123–143.
Dell'Amico, M. and M. Trubian (1998) "Solution of Large Weighted Equicut Problems," European J. Oper. Res., 106(2–3):500–521.
Glover, F (1997) A Template for Scatter Search and Path Relinking. In J. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers, Editors, Lecture Notes in Computer Science, 1363:13–54.
Glover, F (1999) Scatter Search and Path Relinking. In D. Corne, M. Dorigo and F. Glover, Editors, New Ideas in Optimization, 297–316. McGraw Hill.
Glover, F. and M. Laguna (1997) Tabu Search. Kluwer Academic Publishers, Boston.
Glover, F., M. Laguna and R. Martà (2000) "Fundamentals of Scatter Search and Path Relinking," Control and Cybernetics, 39(3):653–684.
Goldschmidt, O., A. Laugier and E.V. Olinick (2003) "Sonet/SDH Ring Assignment with Capacity Contraints," Discr. Appl. Math., 129:99–128.
Laguna, M (2001) Scatter Search. In P.M. Pardalos and M.G.C. Resende, Editors, Handbook of Applied Optimization. Oxford Academic Press.
Laguna, M., R. MartÃand V. Campos (1999) "Intensification and Diversification with Elite Tabu Search Solutions for the Linear Ordering Problem," Computers Oper. Res., 26:1217–1230.
Laguna, M. (1994) "Clustering for the Design of SONET Rings in Interoffice Telecommunications," Management Science, 40:1533–1541.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Kluwer Academic Publishers
About this chapter
Cite this chapter
Aringhieri, R., Dell'Amico, M. (2005). Solution of the SONET Ring Assignment Problem with Capacity Constraints. In: Sharda, R., Voß, S., Rego, C., Alidaee, B. (eds) Metaheuristic Optimization via Memory and Evolution. Operations Research/Computer Science Interfaces Series, vol 30. Springer, Boston, MA. https://doi.org/10.1007/0-387-23667-8_4
Download citation
DOI: https://doi.org/10.1007/0-387-23667-8_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-8134-7
Online ISBN: 978-0-387-23667-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)