Publication: The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems
Issued Date
2011-12-01
Resource Type
ISSN
2157362X
21573611
21573611
Other identifier(s)
2-s2.0-84856546222
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
IEEE International Conference on Industrial Engineering and Engineering Management. (2011), 476-481
Suggested Citation
R. Sirovetnukul, P. Chutima, W. Wattanapornprom, P. Chongstitvatana The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems. IEEE International Conference on Industrial Engineering and Engineering Management. (2011), 476-481. doi:10.1109/IEEM.2011.6117963 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/11644
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems
Other Contributor(s)
Abstract
Most evolutionary algorithms optimize the information from good solutions found in the population. A selection method discards the below-average solutions assuming that they do not contribute any information to update the probabilistic models. This work develops an algorithm called Coincidence algorithm (COIN) which merges negative correlation learning into the optimization process. A knight's tour problem, one of NP-hard multimodal Hamiltonian path problems, is tested with COIN. The results show that COIN is a competitive algorithm in converging to better solutions and maintaining diverse solutions to solve combinatorial optimization problems. © 2011 IEEE.