Abstract
This paper considers two problems that arise in the design of optical telecommunication networks when a ring-based topology is adopted, namely the SONET Ring Assignment Problem and the Intraring Synchronous Optical Network Design Problem. We show that these two network topology problems correspond to graph partitioning problems with capacity constraints: the first is a vertex partitioning problem, while the latter is an edge partitioning problem. We consider solution methods for both problems, based on metaheuristic algorithms. We first describe variable objective functions that depend on the transition from one solution to a neighboring one, then we apply several diversification and intensification techniques including Path Relinking, eXploring Tabu Search and Scatter Search. Finally we propose a diversification method based on the use of multiple neighborhoods. A set of extensive computational results is used to compare the behaviour of the proposed methods and objective functions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aringhieri, R., M. Dell’Amico, and L. Grasselli. (2001). “Solution of the Sonet Ring Assignment Problem with Capacity Constraints.” Technical Report 12, DISMI, University of Modena and Reggio Emilia.
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.K. Hao, E. Lutton, E. Ronald, M. Schoenauer, and D. Snyers (eds.), Lecture Notes in Computer Science, vol. 1363, pp. 13–54.
Glover, F. (1999). “Scatter Search and Path Relinking.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization, McGraw Hill, pp. 297–316.
Glover, F. and M. Laguna. (1997). Tabu Search. Boston. Kluwer Academic Publishers.
Glover, F., M. Laguna, and R. Martì. (2000). “Fundamentals of Scatter Search and Path Relinking.” Control and Cybernetics 39(3), 653–684.
Goldschmidt, O., D.S. Hochbaum, A. Levin, and E.V. Olinick. (2003). The sonet edge-partition problem. Networks (41), 3–23.
Goldschmidt, O., A. Laugier, and E.V. Olinick. (2003). “SONET/SDH Ring Assignment with Capacity Contraints. Discrete Applied Mathematics, (129), 99–128.
Hansen, P. and N. Mladenoviè. (2001). “Variable Neighborhood Search.” In P.M. Pardalos and M.G.C. Resende (eds.), Handbook of Applied Optimization. Oxford Academic Press.
Laguna, M. (1994). “Clustering for the Design of Sonet Rings in Interoffice Telecommunications.” Management Science, 40(11), 1533–1541.
Laguna, M. (2001). “Scatter Search.” In P.M. Pardalos and M.G.C. Resende (eds.), 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.
Lee, Y., H.D. Sherali, J. Han, and S. Kim. (2000). “A branch-and-Cut Algorithm For Solving an Intraring Synchronous Optical Network Design Problem.” Networks 35(3), 223–232.
Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aringhieri, R., Dell’Amico, M. Comparing Metaheuristic Algorithms for Sonet Network Design Problems. J Heuristics 11, 35–57 (2005). https://doi.org/10.1007/s10732-005-6998-7
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-005-6998-7