ABSTRACT College of Business, CB 419 University of Colorado Boulder, CO 80309 email:
Fred. Glover@ colorado. edu Tabu search (TS) has provided advances for solving difficult …

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 …

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 …

Evolutionary computation techniques have attracted increasing att-tions in recent years for
solving complex optimization problems. They are more robust than traditional methods …

This paper presents a new algorithm that can be readily applied to solve the all-terminal
network reliability allocation problems. The optimization problem solved considers the …

This paper presents the application of a tabu search algorithm for solving the frequency
assignment problem. This problem, known to be NP-hard, is to find an assignment of …

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

Network design problem is a well-known NP-hard problem which involves the selection of a
subset of possible links or a network topology in order to minimize the network cost …

Abstract Design of a reliable network in presence of flow loss has become the primary
objective of today's network designers. However, there are other important conflicting …

The reliability and cost are two important performance measures of an interconnection
network. Both these aspects need to be attended at the layout design stage for an …