A Novel Improved Adaptive Genetic Algorithm for the Solution to Optimal Assignment Problem
Optimal Assignment Problem (OAP) is classical,important, and universal in many fields, and Hungary Algorithm has become a current typical method for the solution to it, though the algorithm is not convergent in some instances. Aiming at an effective solution of OAP, a novel improved Adaptive Genetic Algorithm is presented, in which the gene is coded by integral number, a new method for initialization is designed for an advisable Populations Diversity, a selection mechanism of best individuals are introduced, and a new self-adaptive method in adjusting the probabilities of crossover and mutation is developed. The algorithm is good at rapidity and convergence as a solution to OAP, in contrast with some other typical algorithm.
genetic algorithm self adaptation optimal assignment problem.
ZHANG yanduo LU Jing TIAN Hui
School of Computer Science and Engineering Wuhan Institute of Technology Wuhan, China, 430073
国际会议
武汉
英文
136-141
2007-07-25（万方平台首次上网日期，不代表论文的发表时间）