IDEAS home Printed from https://ideas.repec.org/a/igg/jaec00/v1y2010i2p1-27.html
   My bibliography  Save this article

Ordered Incremental Multi-Objective Problem Solving Based on Genetic Algorithms

Author

Listed:
  • Wenting Mo

    (IBM, China)

  • Sheng-Uei Guan

    (Xian Jiaotong-Liverpool University, China)

  • Sadasivan Puthusserypady

    (Technical University of Denmark, Denmark)

Abstract

Many Multiple Objective Genetic Algorithms (MOGAs) have been designed to solve problems with multiple conflicting objectives. Incremental approach can be used to enhance the performance of various MOGAs, which was developed to evolve each objective incrementally. For example, by applying the incremental approach to normal MOGA, the obtained Incremental Multiple Objective Genetic Algorithm (IMOGA) outperforms state-of-the-art MOGAs, including Non-dominated Sorting Genetic Algorithm-II (NSGA-II), Strength Pareto Evolutionary Algorithm (SPEA) and Pareto Archived Evolution Strategy (PAES). However, there is still an open question: how to decide the order of the objectives handled by incremental algorithms? Due to their incremental nature, it is found that the ordering of objectives would influence the performance of these algorithms. In this paper, the ordering issue is investigated based on IMOGA, resulting in a novel objective ordering approach. The experimental results on benchmark problems showed that the proposed approach can help IMOGA reach its potential best performance.

Suggested Citation

  • Wenting Mo & Sheng-Uei Guan & Sadasivan Puthusserypady, 2010. "Ordered Incremental Multi-Objective Problem Solving Based on Genetic Algorithms," International Journal of Applied Evolutionary Computation (IJAEC), IGI Global, vol. 1(2), pages 1-27, April.
    • Handle: RePEc:igg:jaec00:v:1:y:2010:i:2:p:1-27
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jaec.2010040101
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jaec00:v:1:y:2010:i:2:p:1-27. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.