Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation

Research output: Contribution to journalArticle

22 Scopus citations

Abstract

The network design problem with relays arises in telecommunications and distribution systems where the payload must be reprocessed at intermediate stations called relays on the route from its origin to its destination. In fiber-optic networks, for example, optical signals may be regenerated several times to overcome signal degradation because of attenuation and other factors. Given a network and a set of commodities, the network design problem with relays involves selecting network edges, determining a route for each commodity, and locating relays to minimize the network design cost. This paper presents a new formulation to the problem based on set covering constraints. The new formulation is used to design a genetic algorithm with a specialized crossover/mutation operator which generates a feasible path for each commodity, and the locations of relays on these paths are determined by solving the corresponding set covering problem. Computational experiments show that the proposed approach can outperform other approaches, particularly on large size problems.

Original languageEnglish (US)
Pages (from-to)829-837
Number of pages9
JournalEuropean Journal of Operational Research
Volume218
Issue number3
DOIs
StatePublished - May 1 2012

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation'. Together they form a unique fingerprint.

  • Cite this