• DocumentCode
    3284177
  • Title

    GA´s arithmetic on time-cost optimization in architecture engineering

  • Author

    Ping, Lv Shu ; Tian Zhenjie

  • Author_Institution
    Coll. of Autom., Harbin Eng. Univ., Harbin, China
  • fYear
    2011
  • fDate
    15-17 April 2011
  • Firstpage
    3293
  • Lastpage
    3296
  • Abstract
    In the analysis of basic optimization method of multi objective GA, papers was proposed on the improved GA of weights that was based on an improved elitist preservation strategy. Firstly, The algorithm combined improved strategy of the (μ + λ) evolution with GA that is based on weights coefficients. Secondly, it continuously detected the population size and restarted some groups. So they could ensure the diversity of both the population and the search direction, thus ensuring the search results of the Pareto values. Simulation results had demonstrated that the improved GA and MPP model had the effectiveness and feasibility in network planning cost and schedule optimization. In order to address the existence problems that improved algorithm was running slow, we had combined the Niched-Pareto with improved algorithm .Then the result was presenting a hybrid algorithm. The simulation showed that this hybrid algorithm had certain advantages in the search effectiveness and efficiency.
  • Keywords
    Pareto optimisation; architecture; arithmetic; genetic algorithms; search problems; Pareto value; architecture engineering; elitist preservation strategy; genetic algorithm arithmetic; network planning cost; niched-Pareto; schedule optimization; search effectiveness; search efficiency; time-cost optimization; Algorithm design and analysis; Convergence; Evolutionary computation; Industries; Optimization; Presses; Architecture engineering; GA; MPP; Time-cost optimization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Electric Information and Control Engineering (ICEICE), 2011 International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-8036-4
  • Type

    conf

  • DOI
    10.1109/ICEICE.2011.5777802
  • Filename
    5777802