IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v32y2015i05ns0217595915500360.html
   My bibliography  Save this article

New Dynamic Multi-Objective Constrained Optimization Evolutionary Algorithm

Author

Listed:
  • Chun-An Liu

    (Department of Mathematics, Baoji University of Arts and Sciences, Baoji, Shaanxi 721013, P. R. China)

  • Yuping Wang

    (School of Computer Science and Technology, Xidian University, Xi'an, Shaanxi 710071, P. R. China)

  • Aihong Ren

    (Department of Mathematics, Baoji University of Arts and Sciences, Baoji, Shaanxi 721013, P. R. China)

Abstract

For dynamic multi-objective constrained optimization problem (DMCOP), it is important to find a sufficient number of uniformly distributed and representative dynamic Pareto optimal solutions. In this paper, the time period of the DMCOP is first divided into several random subperiods. In each random subperiod, the DMCOP is approximately regarded as a static optimization problem by taking the time subperiod fixed. Then, in order to decrease the amount of computation and improve the effectiveness of the algorithm, the dynamic multi-objective constrained optimization problem is further transformed into a dynamic bi-objective constrained optimization problem based on the dynamic mean rank variance and dynamic mean density variance of the evolution population. The evolution operators and a self-check operator which can automatically checkout the change of time parameter are introduced to solve the optimization problem efficiently. And finally, a dynamic multi-objective constrained optimization evolutionary algorithm is proposed. Also, the convergence analysis for the proposed algorithm is given. The computer simulations are made on four dynamic multi-objective optimization test functions and the results demonstrate that the proposed algorithm can effectively track and find the varying Pareto optimal solutions or the varying Pareto fronts with the change of time.

Suggested Citation

  • Chun-An Liu & Yuping Wang & Aihong Ren, 2015. "New Dynamic Multi-Objective Constrained Optimization Evolutionary Algorithm," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 32(05), pages 1-23.
  • Handle: RePEc:wsi:apjorx:v:32:y:2015:i:05:n:s0217595915500360
    DOI: 10.1142/S0217595915500360
    as

    Download full text from publisher

    File URL: http://www.worldscientific.com/doi/abs/10.1142/S0217595915500360
    Download Restriction: Access to full text is restricted to subscribers

    File URL: https://libkey.io/10.1142/S0217595915500360?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

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

    References listed on IDEAS

    as
    1. Barrett, Alan & Kearney, Ide & Garrett, Shane & McCarthy, Yvonne, 2005. "Quarterly Economic Commentary, Winter 2005," Forecasting Report, Economic and Social Research Institute (ESRI), number QEC20054, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Eoin O'Malley, 2012. "A Survey of Explanations for the Celtic Tiger Boom," The Institute for International Integration Studies Discussion Paper Series iiisdp417, IIIS.
    2. Sheng-Nian Luo & Lianqing Zheng & Qi An & Shijin Zhao, 2006. "Tensile Failure Of Single-Crystal And Nanocrystalline Lennard-Jones Solids Under Uniaxial Strain," International Journal of Modern Physics C (IJMPC), World Scientific Publishing Co. Pte. Ltd., vol. 17(11), pages 1551-1561.
    3. M. Reza Peyghami, 2009. "An Interior Point Approach For Semidefinite Optimization Using New Proximity Functions," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 26(03), pages 365-382.

    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:wsi:apjorx:v:32:y:2015:i:05:n:s0217595915500360. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.