• DocumentCode
    2691071
  • Title

    Hybrid optimization using DIRECT, GA, and SQP for global exploration

  • Author

    Hiwa, S. ; Hiroyasu, Tomoyuki ; Miki, M.

  • Author_Institution
    Doshisha Univ., Kyoto
  • fYear
    2007
  • fDate
    25-28 Sept. 2007
  • Firstpage
    1709
  • Lastpage
    1716
  • Abstract
    This paper presents a new hybrid optimization approach, which combines multiple optimization algorithms. To develop an efficient hybrid optimization algorithm, it is necessary to determine how the optimization process is performed. This paper focuses on the balance between local and broad searches, and multiple optimization methods are controlled to derive both the optimum point and the information of the landscape. By this approach, we can describe the global landscape after derivation of optimization. To achieve the proposed optimization strategy, three distinguished optimization algorithms are introduced: DIRECT (Dividing RECTangles), GAs (Genetic Algorithms), and SQP (Sequential Quadratic Programming). To integrate these three algorithms, each algorithm, especially DIRECT, was modified and developed. The performance of the proposed hybrid algorithm was examined through numerical experiments. From these experiments, not only the optimum point but also the information of the landscape was determined. The information of the landscape verified the reliability of optimization results.
  • Keywords
    genetic algorithms; quadratic programming; search problems; broad search; dividing rectangles; genetic algorithms; global exploration; global landscape; hybrid optimization; local search; sequential quadratic programming; Algorithm design and analysis; Constraint optimization; Convergence; Design optimization; Genetic algorithms; Optimization methods; Quadratic programming; Simulated annealing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
  • Conference_Location
    Singapore
  • Print_ISBN
    978-1-4244-1339-3
  • Electronic_ISBN
    978-1-4244-1340-9
  • Type

    conf

  • DOI
    10.1109/CEC.2007.4424679
  • Filename
    4424679