Evolving Simple Fault-tolerant Routing Rules using Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.3872

  author =       "S. H. Shami and I. M. A. Kirkwood and M. C. Sinclair",
  title =        "Evolving Simple Fault-tolerant Routing Rules using
                 Genetic Programming",
  journal =      "Electronics Letters",
  year =         "1997",
  volume =       "33",
  number =       "17",
  pages =        "1440--1441",
  month =        aug,
  keywords =     "genetic algorithms, genetic programming,
                 telecommunications networks, routing, fault-tolerant
                 routing rules, link failures, near-shortest paths,
                 network routing, restoration problems, circuit layout
                 CAD, fault tolerant computing, network routing",
  DOI =          "doi:10.1049/el:19970996",
  ISSN =         "0013-5194",
  abstract =     "A novel approach to solving network routing and
                 restoration problems using the genetic programming (GP)
                 paradigm is presented, in which a single robust and
                 fault-tolerant program is evolved which determines the
                 near-shortest paths through a network subject to link
  email =        "mcs@essex.ac.uk",
  notes =        "Letter. Multiple populations uni-direction ring and
                 injection both with 3 subpopulations. Dijkstra fitness.

                 {"}GP has some limited potential, for small networks,
                 to evolve near-optimal fault-tolerant routing rules
                 which are robust enough to be able to solve a high
                 proportion of multiple link failures. Overall, though,
                 this approach lacks adequate performance even for
                 modest-sized networks.{"}",

Genetic Programming entries for S H Shami I M A Kirkwood Mark C Sinclair