This paper presents a genetic algorithm for designing minimum-cost two-connected networks such that the shortest cycle to which each edge belongs to does ...
This paper presents a genetic algorithm for designing minimum-cost two-connected networks such that the shortest cycle to which each edge belongs to does ...
This paper is among the first to document the implementation of a genetic algorithm for the design of two-connected networks with the added constraint of ...
This paper presents a genetic algorithm for designing minimum-cost two-connected networks such that the shortest cycle to which each edge belongs to does ...
A genetic algorithm for the design of two-connected networks with bounded rings. M. Ventresca and B. Ombuki. Technical Report # CS-04-09. July 2004. Brock ...
Aug 25, 2020 · Mario Ventresca, Beatrice M. Ombuki: A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings.
Our genetic algorithm is compared to commercial solvers on instances of up to 15 demand types, resources, and 500 demand scenarios. Experimental evidence shows ...
Missing: cost | Show results with:cost
A Genetic Algorithm for the Design of Minimum-cost Two-connected Networks with Bounded Rings · M. VentrescaBeatrice M. Ombuki-Berman. Computer Science ...
People also ask
What are the two main features of a genetic algorithm?
What is the genetic algorithm for rule set production?
In this paper, we consider the problem of designing a minimum cost communication network subject to certain two-connected survivability constraints.
This chapter surveys up-to-date research efforts to address the reliable network design problem and proposes a new hybrid heuristic of the genetic algorithm and ...