Research Article

A Genetic Algorithm to Solve the Maximum Partition Problem

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

How to cite this article

Wael Mustafa, 2002. A Genetic Algorithm to Solve the Maximum Partition Problem. Journal of Applied Sciences, 2: 71-73.

DOI: 10.3923/jas.2002.71.73

URL: https://scialert.net/abstract/?doi=jas.2002.71.73

Journal of Applied Sciences

Article Trend

Total views 246

Search

Authors

Wael Mustafa

Keywords

Research Article

A Genetic Algorithm to Solve the Maximum Partition Problem

How to cite this article

Leave a Comment