• DocumentCode
    70420
  • Title

    On the Convergence of Chemical Reaction Optimization for Combinatorial Optimization

  • Author

    Lam, Albert Y. S. ; Li, Victor O. K. ; Jin Xu

  • Author_Institution
    Dept. of Comput. Sci., Hong Kong Baptist Univ., Kowloon Tong, China
  • Volume
    17
  • Issue
    5
  • fYear
    2013
  • fDate
    Oct. 2013
  • Firstpage
    605
  • Lastpage
    620
  • Abstract
    A novel general-purpose optimization method, chemical reaction optimization (CRO), is a population-based metaheuristic inspired by the phenomenon of interactions between molecules in a chemical reaction process. CRO has demonstrated its competitive edge over existing methods in solving many real-world problems. However, all studies concerning CRO have been empirical in nature and no theoretical analysis has been conducted to study its convergence properties. In this paper, we present some convergence results for several generic versions of CRO, each of which adopts different combinations of elementary reactions. We investigate the limiting behavior of CRO. By modeling CRO as a finite absorbing Markov chain, we show that CRO converges to a global optimum solution with a probability arbitrarily close to one when time tends to infinity. Our results also show that the convergence of CRO is determined by both the elementary reactions and the total energy of the system. Moreover, we also study and discuss the finite time behavior of CRO.
  • Keywords
    Markov processes; combinatorial mathematics; convergence; heuristic programming; optimisation; CRO process; chemical reaction optimization convergence; combinatorial optimization; elementary reactions; finite absorbing Markov chain; finite time behavior; global optimum solution; population-based metaheuristic; Chemicals; Convergence; Cost function; Markov processes; Sociology; Statistics; Chemical reaction optimization (CRO); convergence; convergence rate; finite absorbing Markov chain; first hitting time;
  • fLanguage
    English
  • Journal_Title
    Evolutionary Computation, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    1089-778X
  • Type

    jour

  • DOI
    10.1109/TEVC.2012.2227973
  • Filename
    6355648