Skip to main navigation Skip to search Skip to main content

The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems

  • Chulalongkorn University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationIEEE International Conference on Industrial Engineering and Engineering Management, IEEM2011
Pages476-481
Number of pages6
DOIs
Publication statusPublished - 2011
EventIEEE International Conference on Industrial Engineering and Engineering Management, IEEM2011 - Singapore, Singapore
Duration: 6 Dec 2011 → 9 Dec 2011

Publication series

NameIEEE International Conference on Industrial Engineering and Engineering Management
ISSN (Print)2157-3611
ISSN (Electronic)2157-362X

Conference

ConferenceIEEE International Conference on Industrial Engineering and Engineering Management, IEEM2011
Country/TerritorySingapore
CitySingapore
Period6/12/11 → 9/12/11

Keywords

  • Coincidence algorithm
  • Combinatorial optimization problems
  • Negative knowledge

Fingerprint

Dive into the research topics of 'The effectiveness of hybrid negative correlation learning in evolutionary algorithm for combinatorial optimization problems'. Together they form a unique fingerprint.

Cite this