Abstract
Microgenetic Algorithm(MGA) is Genetic Algorithm(GA) using a very small population size (population size < 20). The weighted graph matching problem (WGMP) receives tremendous attention in the field of pattern recognition recently. In this paper, a hybrid MGA with larger population is proposed to solved the weighted graph matching problem. In our hybrid microgenetic algorithm, many modules, such as local search algorithm, biased initial population, a modified selection scheme, and a refining procedure, are embedded to improve the performance of the algorithm. Experimental results show that our method outperforms a well-known method, the Symmetric Polynomial Transform (SPT), on most instances of the weighted graph matching problems.
| Original language | English |
|---|---|
| Pages (from-to) | 638-643 |
| Number of pages | 6 |
| Journal | Proceedings of the IEEE International Conference on Systems, Man and Cybernetics |
| Volume | 1 |
| State | Published - 1995 |
| Event | Proceedings of the 1995 IEEE International Conference on Systems, Man and Cybernetics. Part 2 (of 5) - Vancouver, BC, Can Duration: 22 Oct 1995 → 25 Oct 1995 |