IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v214y2023icp334-351.html
   My bibliography  Save this article

The Directed Multi-Objective Estimation Distribution Algorithm (D-MOEDA)

Author

Listed:
  • Botello-Aceves, Salvador
  • Hernandez-Aguirre, Arturo
  • Valdez, S. Ivvan

Abstract

Improvement Direction Mapping (IDM) methods have been applied as a local search strategy to hybridize global search algorithms. A natural question is whether this concept could be applied within a global search scheme, so that the stochastic search operators are directed toward promising regions, promoting a more efficient search. This paper introduces a novel Multi-Objective Evolutionary Algorithm (MOEA) that incorporates the IDM into the reproduction operator of an Estimation of Distribution Algorithm (EDA). In this proposal, the search directions of the IDM based on aggregation functions are used to directly steer the search process of a multi-objective evolutionary algorithm based on decomposition, by orienting a local probability distribution towards a search direction, the proposal intends to steer solutions toward the Pareto front (PF) of the Multi-Objective Optimization Problem (MOP), exploiting the search features of the aggregation functions. The proposal is tested using a set of well-known benchmark MOPs and compared to state of the art MOEAs. Results showed statistical evidence about the importance of the orientation of the search probability distribution to improve the convergence to the Pareto front.

Suggested Citation

  • Botello-Aceves, Salvador & Hernandez-Aguirre, Arturo & Valdez, S. Ivvan, 2023. "The Directed Multi-Objective Estimation Distribution Algorithm (D-MOEDA)," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 214(C), pages 334-351.
  • Handle: RePEc:eee:matcom:v:214:y:2023:i:c:p:334-351
    DOI: 10.1016/j.matcom.2023.07.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037847542300294X
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.matcom.2023.07.013?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.

    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:eee:matcom:v:214:y:2023:i:c:p:334-351. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    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.