Accelerated Genetic Algorithms with Markov Chains

@inproceedings{Wang2010AcceleratedGA,
  title={Accelerated Genetic Algorithms with Markov Chains},
  author={Crown Guan Wang and Chen Chen and Kwok Yip Szeto},
  booktitle={NICSO},
  year={2010}
}
[Abstract] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for complex problem optimization. The important input for this guided search is the ranking scheme of the chromosomes. It is found that the effect of mutation using the transition matrix yields faster convergence as well as overall higher fitness in the search for optimal solutions for the 0-1 Knapsack problem, when… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 14 references

in I

  • K. Y. Szeto, J. Zhang
  • Lirkov, S. Margenov, and J. Wasniewski (Eds…
  • 2006
2 Excerpts

Szeto, Rule Extraction in Short Memory Time Series using Genetic Algorithms

  • K. Y. Alex L.Y. Fong
  • European Physical Journal B
  • 2001
2 Excerpts

Distributed parallel genetic algorithm with path splitting scheme for the large traveling salesman problems,

  • R. Jiang, K. Y. Szeto, Y. P. Luo, D. C. Hu
  • Proceedings of Conference on Intelligent…
  • 2000
2 Excerpts

K

  • S. P. Li
  • Y. Szeto, “Crytoarithmetic problem using parallel…
  • 1999
2 Excerpts

Effects of dimensionality on parallel genetic algorithms,

  • K. Y. Szeto, K. H. Cheung, S. P. Li
  • Proceedings of the 4 International Conference on…
  • 1998
2 Excerpts

Similar Papers

Loading similar papers…