IDEAS home Printed from https://ideas.repec.org/h/tkp/mklp14/117-123.html
   My bibliography  Save this book chapter

An Improved Multi-Objective Evolution Algorithm Based on Shuffled Frog Leaping

Author

Listed:
  • Jianping Luo

    (Shenzhen University, China)

  • Xia Li

    (Shenzhen University, China)

  • Min-Rong Chen

    (Shenzhen University, China)

  • Hongwei Liu

    (Shenzhen University, China)

Abstract

In this paper, we present a meta-heuristic base on improved shuffled frog leaping algorithm (SFLA) to tackle the multi-objective problem (MOP). The SFLA is suitable to solve the single objective problem. For the multi-objective problem, one main issue is that how to evaluate the quality of two optional solutions and select the better one from them. The traditional Pareto dominance cannot generate a strong selection pressure toward the Pareto front when we have many objectives (since almost all solutions in the current population become non-dominated). In our algorithm, we propose a relaxed dominance mechanism to promote the selection pressure in evolution. The comparison between two frogs proposed in this work takes the modified Pareto dominance relations into account. At the same time, the number of frog in each memeplex of SFLA is not too much, we only select two individuals (the best and the worst) to perform the memetic evolution. Therefore, the algorithm has the better selection pressure toward to the Pareto front. The experimental results show that our algorithm processes good performance to solve the MOP.

Suggested Citation

  • Jianping Luo & Xia Li & Min-Rong Chen & Hongwei Liu, 2014. "An Improved Multi-Objective Evolution Algorithm Based on Shuffled Frog Leaping," Human Capital without Borders: Knowledge and Learning for Quality of Life; Proceedings of the Management, Knowledge and Learning International Conference 2014,, ToKnowPress.
  • Handle: RePEc:tkp:mklp14:117-123
    as

    Download full text from publisher

    File URL: http://www.toknowpress.net/ISBN/978-961-6914-09-3/papers/ML14-491.pdf
    File Function: full text
    Download Restriction: no

    File URL: http://www.toknowpress.net/ISBN/978-961-6914-09-3/MakeLearn2014.pdf
    File Function: Conference Programme
    Download Restriction: no
    ---><---

    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:tkp:mklp14:117-123. 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: Maks Jezovnik (email available below). General contact details of provider: http://www.toknowpress.net/proceedings/978-961-6914-09-3/ .

    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.