Comparing metaheuristic algorithms for SONET network design problems

DOI10.1007/s10732-005-6998-7zbMath1122.90319OpenAlexW1969385974WikidataQ59222279 ScholiaQ59222279MaRDI QIDQ2573001

Roberto Aringhieri, Mauro Dell'Amico

Publication date: 7 November 2005

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-005-6998-7

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (3)

A two level metaheuristic for the operating room scheduling and assignment problem ⋮ Composing medical crews with equity and efficiency ⋮ Combining workload balance and patient priority maximisation in operating room planning through hierarchical multi-objective optimisation

Uses Software

• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intensification and diversification with elite tabu search solutions for the linear ordering problem
• SONET/SDH ring assignment with capacity constraints
• Solution of large weighted equicut problems
• Solution of the cumulative assignment problem with a well-structured tabu search method
• A branch-and-cut algorithm for solving an intraring synchronous optical network design problem
• The SONET edge‐partition problem
• Clustering for the Design of SONET Rings in Interoffice Telecommunications

This page was built for publication: Comparing metaheuristic algorithms for SONET network design problems