IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v66y2015i10p1686-1698.html
   My bibliography  Save this article

A new orthogonal evolutionary algorithm based on decomposition for multi-objective optimization

Author

Listed:
  • Cai Dai

    (School of Computer Science and Technology, Xidian University, Xian, P.R. China)

  • Yuping Wang

    (School of Computer Science and Technology, Xidian University, Xian, P.R. China)

  • Wei Yue

    (School of Computer Science and Technology, Xidian University, Xian, P.R. China)

Abstract

The diversity of solutions is very important for multi-objective evolutionary algorithms to deal with multi-objective optimization problems (MOPs). In order to achieve the goal, a new orthogonal evolutionary algorithm based on objective space decomposition (OEA/D) is proposed in this paper. To be specific, the objective space of an MOP is firstly decomposed into a set of sub-regions via a set of direction vectors, and OEA/D maintains the diversity of solutions by making each sub-region have a solution to the maximum extent. Also, the quantization orthogonal crossover (QOX) is used to enhance the search ability of OEA/D. Experimental studies have been conducted to compare this proposed algorithm with classic MOEA/D, NSGAII, NICA and D2MOPSO. Simulation results on six multi-objective benchmark functions show that the proposed algorithm is able to obtain better diversity and more evenly distributed Pareto fronts than other four algorithms.

Suggested Citation

  • Cai Dai & Yuping Wang & Wei Yue, 2015. "A new orthogonal evolutionary algorithm based on decomposition for multi-objective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(10), pages 1686-1698, October.
  • Handle: RePEc:pal:jorsoc:v:66:y:2015:i:10:p:1686-1698
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n10/pdf/jors201480a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: http://www.palgrave-journals.com/jors/journal/v66/n10/full/jors201480a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Zhang, Yue & Zhang, Qi & Farnoosh, Arash & Chen, Siyuan & Li, Yan, 2019. "GIS-Based Multi-Objective Particle Swarm Optimization of charging stations for electric vehicles," Energy, Elsevier, vol. 169(C), pages 844-853.
    2. Fei Han & Yu-Wen-Tian Sun & Qing-Hua Ling, 2018. "An Improved Multiobjective Quantum-Behaved Particle Swarm Optimization Based on Double Search Strategy and Circular Transposon Mechanism," Complexity, Hindawi, vol. 2018, pages 1-22, November.
    3. Yue, Wei & Wang, Yuping, 2017. "A new fuzzy multi-objective higher order moment portfolio selection model for diversified portfolios," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 124-140.
    4. Neungmatcha, Woraya, 2016. "Multi-objective particle swarm optimization for mechanical harvester route planning of sugarcane field operationsAuthor-Name: Sethanan, Kanchana," European Journal of Operational Research, Elsevier, vol. 252(3), pages 969-984.
    5. Chiranjit Changdar & Rajat Kumar Pal & Ghanshaym Singha Mahapatra & Abhinandan Khan, 2020. "A genetic algorithm based approach to solve multi-resource multi-objective knapsack problem for vegetable wholesalers in fuzzy environment," Operational Research, Springer, vol. 20(3), pages 1321-1352, September.
    6. Qi You & Jun Sun & Feng Pan & Vasile Palade & Bilal Ahmad, 2021. "DMO-QPSO: A Multi-Objective Quantum-Behaved Particle Swarm Optimization Algorithm Based on Decomposition with Diversity Control," Mathematics, MDPI, vol. 9(16), pages 1-20, August.
    7. Zhang, XuWei & Liu, Hao & Tu, LiangPing & Zhao, Jian, 2020. "An efficient multi-objective optimization algorithm based on level swarm optimizer," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 177(C), pages 588-602.

    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:pal:jorsoc:v:66:y:2015:i:10:p:1686-1698. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.