%0 Journal Article %1 shami:1997:ftrr %A Shami, S. H. %A Kirkwood, I. M. A. %A Sinclair, M. C. %D 1997 %J Electronics Letters %K algorithms, genetic networks, programming, routing telecommunications %N 17 %P 1440--1441 %T Evolving Simple Fault-tolerant Routing Rules using Genetic Programming %V 33 %X 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 failures.

@article{shami:1997:ftrr, 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 failures.}, added-at = {2008-06-19T17:35:00.000+0200}, author = {Shami, S. H. and Kirkwood, I. M. A. and Sinclair, M. C.}, biburl = {https://www.bibsonomy.org/bibtex/2e56dca8f2bf96b166096939d6d58877b/brazovayeye}, email = {mcs@essex.ac.uk}, interhash = {40ad866278b2fb7f6cad215a04999882}, intrahash = {e56dca8f2bf96b166096939d6d58877b}, journal = {Electronics Letters}, keywords = {algorithms, genetic networks, programming, routing telecommunications}, month = {August}, notes = {Letter. Multiple populations uni-direction ring and injection both with 3 subpopulations. Dijkstra fitness. lilgp. {"}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.{"}}, number = 17, pages = {1440--1441}, timestamp = {2008-06-19T17:51:32.000+0200}, title = {Evolving Simple Fault-tolerant Routing Rules using Genetic Programming}, volume = 33, year = 1997 }