A tabu search algorithm for self-healing ring network design

Fortz, Bernard;Soriano, P.;Wynants, C.
(2003) European Journal of Operational Research — Vol. 151, n° 2, p. 280-295 (2003)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 408.35 KB
Request a copy

Details

Authors
  • Fortz, BernardUCLouvain
    Author
  • Soriano, P.
    Author
  • Wynants, C.
    Author
Abstract
We consider the problem of designing self-healing rings in order to protect the transmission of telecommunication demands in a zonal network. This problem stems from a real application with operational constraints such as dual homing and hop limit per ring. A modeling approach taking into account ring interactions is proposed as well as a tabu search heuristic for solving it. Computational results for a comprehensive set of real and randomly generated instances are presented.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Fortz, B., Soriano, P., & Wynants, C. (2003). A tabu search algorithm for self-healing ring network design. European Journal of Operational Research, 151(2), 280-295. https://doi.org/10.1016/S0377-2217(02)00826-3 (Original work published 2003)