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.
Solution of the SONET ring assignment problem with capacity constraints / R., Aringhieri; Dell'Amico, Mauro. - STAMPA. - 30(2005), pp. 93-116.
|Data di pubblicazione:||2005|
|Titolo:||Solution of the SONET ring assignment problem with capacity constraints|
|Autore/i:||R., Aringhieri; Dell'Amico, Mauro|
|Titolo del libro:||Metaheuristic Optimization via Memory and Evolution. Tabu Search and Scatter Search|
|Nazione editore:||STATI UNITI D'AMERICA|
|Citazione:||Solution of the SONET ring assignment problem with capacity constraints / R., Aringhieri; Dell'Amico, Mauro. - STAMPA. - 30(2005), pp. 93-116.|
File in questo prodotto:
I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris