A tabu search heuristic for the design of two-connected networks with bounded rings

Fortz, Bernard;Labbé, Martine
(2002)

Files

WP74Fortz.pdf
  • Open Access
  • Adobe PDF
  • 69.61 KB
Download

Details

Authors
  • Fortz, Bernard
    Author
  • LabbĂ©, Martine
    Author
Abstract
We present a tabu search heuristic for a network design problem which consists in determining at minimum cost a two-connected network such that the shortest cycle to which each edge belongs (a "ring") does not exceed a given length K. Numerical results are provided for randomly generated graphs and graphs coming from real-world applications.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Fortz, B., & Labbé, M. (2002). A tabu search heuristic for the design of two-connected networks with bounded rings (IAG Working Papers 2002/74). https://hdl.handle.net/2078.5/34892