A comprehensive guide to a powerful new analytical tool by two of its foremost innovators
The past decade has witnessed many exciting advances in the use of genetic algorithms …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

As NAND flash memory continues to scale down to smaller process technology nodes, its
reliability and endurance are degrading. One important source of reduced reliability is the …

This paper presents a genetic algorithm (GA) with specialized encoding, initialization, and
local search operators to optimize the design of communication network topologies. This NP …

The topological design of distributed packet switched networks consists of finding a topology
that minimizes the communication costs by taking into account a certain number of …

This paper describes a general approach to the optimal design of communications networks
when considering both economics and reliability. The approach uses a genetic algorithm to …

This paper addresses an NP-hard problem, referred to as Network Topology Design with
minimum Cost subject to a Reliability constraint (NTD-CR), to design a minimal-cost …

This paper describes a heuristic optimization approach using genetic algorithms. The
method solves general network design problems to optimality, or near-optimality, with …

Designing a reliable network becomes a time-consuming task if it involves All-Terminal
Reliability (ATR) calculation, which belongs to the class of NP-hard problems. To make this …

In many computer communications network design problems, such as those faced by
hospitals, universities, research centers, and water distribution systems, the topology is fixed …