• DocumentCode
    3489085
  • Title

    Sustainable HFC Genetic Algorithms Based with Adaptive Migration Structure

  • Author

    Li Shaobo ; Chen Xil ; Hu Jianjun

  • Author_Institution
    CAD/CIMS Inst., Guizhou Univ., Guiyang
  • fYear
    2007
  • fDate
    21-25 Sept. 2007
  • Firstpage
    653
  • Lastpage
    657
  • Abstract
    This paper proposes two improved sustainable genetic algorithms based on hierarchical fair competition model (HFC)- the HFC algorithm with adaptive admission threshold (HFC-AMT) and the HFC algorithm with adaptive migration structure (HFC- AMS). These two HFC algorithms can adjust the admission threshold of every grade in HFC and allow dynamic movement such as two-way migration of individuals between certain grades, which share higher similarity to what happens in nature. Our benchmark experiment on the TSP (Traveling Salesman Problem) shows that the proposed adaptive HFC algorithms can not only maintain high diversity of the population and fair competition among individuals, but also assure the limitless search and sustainable evolution.
  • Keywords
    genetic algorithms; sustainable development; travelling salesman problems; adaptive migration structure; hierarchical fair competition model; sustainable genetic algorithm; traveling salesman problem; Calibration; Computer integrated manufacturing; Computer science; Evolutionary computation; Genetic algorithms; Genetic engineering; Genetic mutations; Hybrid fiber coaxial cables; Switches; Traveling salesman problems;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
  • Conference_Location
    Shanghai
  • Print_ISBN
    978-1-4244-1311-9
  • Type

    conf

  • DOI
    10.1109/WICOM.2007.169
  • Filename
    4339944