A genetic algorithm for solving multistage graph problem | IEEE Conference Publication | IEEE Xplore

A genetic algorithm for solving multistage graph problem


Abstract:

A multistage graph is center problem of computer science, many coordination and consistency problems can be convert into multistage graph problem. We obtained the fitness...Show More

Abstract:

A multistage graph is center problem of computer science, many coordination and consistency problems can be convert into multistage graph problem. We obtained the fitness function by coding the vertex of multistage graph, and designed the genetic algorithm for solving multistage graph problem. Experiment results show that this algorithm is very effective and feasible.
Date of Conference: 28-30 May 2016
Date Added to IEEE Xplore: 08 August 2016
ISBN Information:
Electronic ISSN: 1948-9447
Conference Location: Yinchuan, China

Contact IEEE to Subscribe

References

References is not available for this document.