• DocumentCode
    532629
  • Title

    Genetic algorithm design of the Min -max weighted distance problem

  • Author

    Liu, Lin ; Zhang, Yuxia

  • Author_Institution
    Dept. of Math. & Phys., Zhengzhou Inst. of Aeronaut. Ind. Manage., Zhengzhou, China
  • Volume
    6
  • fYear
    2010
  • fDate
    22-24 Oct. 2010
  • Abstract
    The location problem is one kind of special type optimized problems. The Min-max weighted distance problem is a new class of location problem, its decision problem is a NP-Complete problem. This paper designs a genetic algorithm by some properties of the problem, and gives the design and selection method of crossover operator, mutation operator and reproduction operator.
  • Keywords
    genetic algorithms; NP-complete problem; crossover operator; decision problem; genetic algorithm design; location problem; min-max weighted distance problem; mutation operator; reproduction operator; special type optimized problems; Annealing; Biological cells; Switches; Location; design; genetic algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Application and System Modeling (ICCASM), 2010 International Conference on
  • Conference_Location
    Taiyuan
  • Print_ISBN
    978-1-4244-7235-2
  • Electronic_ISBN
    978-1-4244-7237-6
  • Type

    conf

  • DOI
    10.1109/ICCASM.2010.5620857
  • Filename
    5620857
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=532629