Submit Manuscript

Journal of Applied Sciences

Year: 2002 | Volume: 2 | Issue: 1 | Page No.: 71-73
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail
Research Article

A Genetic Algorithm to Solve the Maximum Partition Problem

Wael Mustafa

ABSTRACT

A maximum partition of a directed weighted graph is partitioning the nodes into two sets such that is maximizes the total weights of edges between the two sets. In this study a genetic algorithm it proposed to solve the maximum partition problem. Experiments performed on randomly generated graphs of different sizes show that the proposed algorithm converges to an optimal solution faster than the existing heuristic algorithm.
PDF References Citation

Search

REFERENCES

  1. Davis, L., 1991. Handbook of Genetic Algorithms. 1st Edn., Van Nostrand Reinhold, New York, USA., ISBN-13: 9780442001735, Pages: 385.
  2. Goldberg, D.E., 1989. Genetic Algorithms in Search, Optimization and Machine Learning. 1st Edn., Addison-Wesley Publishing Company, New York, USA., ISBN: 0201157675, pp: 36-90.
  3. Holland, J.H., 1975. Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. 1st Edn., University of Michigan Press, Ann Arbor, MI., USA., ISBN-13: 9780472084609, Pages: 183.
  4. Horowitz, E. and S. Sahni, 1978. Fundamentals of Computer Algorithms. Computer Science Publishers, Rockville, Md., ISBN-10: 0914894226.
    Direct Link
  5. Fuhr, N. and T. Rolleke, 1997. A probabilistic relational algebra for the integration of information retrieval and database systems. ACM Trans. Inform. Syst., 15: 32-66.
    Direct Link
  6. Mitchell, M., 1998. An Introduction to Genetic Algorithms. The MIT Press, USA., ISBN-10: 0262631857, Page: 221.

Search

Leave a Comment

Your email address will not be published. Required fields are marked *