IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v296y2021i1d10.1007_s10479-019-03407-8.html
   My bibliography  Save this article

Guided Moth–Flame optimiser for multi-objective optimization problems

Author

Listed:
  • Djaafar Zouache

    (University of Mohamed El Bachir Elibrahimi)

  • Fouad Ben Abdelaziz

    (NEOMA Business School, Rouen Campus)

  • Mira Lefkir

    (University of Mohamed El Bachir Elibrahimi)

  • Nour El-Houda Chalabi

    (University of Mohamed El Bachir Elibrahimi)

Abstract

This paper proposes a novel version of Moth–Flame optimiser for solving multi-objective problems (MOMFO). The main idea of this algorithm is that the Moth’s swarm explores the search space around the Flames set (leader solutions). To implement our approach, we integrate the unlimited external archive to guide the Moth’s swarm during the exploration search to find the Pareto solutions set. To ensure a good compromise between convergence and diversity when exploring the search space, we use the epsilon dominance principle to update the external archive. In addition, we use the non-dominated sort and crowding distance in updating the Flame solutions to ensure rapid convergence towards the Pareto solutions set. We validate the proposed algorithm on twelve test functions and compare our results with two well-known meta-heuristics. The results of the proposed algorithm show better convergence behavior with a better diversity of solutions.

Suggested Citation

  • Djaafar Zouache & Fouad Ben Abdelaziz & Mira Lefkir & Nour El-Houda Chalabi, 2021. "Guided Moth–Flame optimiser for multi-objective optimization problems," Annals of Operations Research, Springer, vol. 296(1), pages 877-899, January.
    • Handle: RePEc:spr:annopr:v:296:y:2021:i:1:d:10.1007_s10479-019-03407-8
    DOI: 10.1007/s10479-019-03407-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-019-03407-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-019-03407-8?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. Wei Kun Li & Wan Liang Wang & Li Li, 2018. "Optimization of Water Resources Utilization by Multi-Objective Moth-Flame Algorithm," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 32(10), pages 3303-3316, August.
    2. Kathrin Klamroth & Margaret M. Wiecek, 2000. "Dynamic programming approaches to the multiple criteria knapsack problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(1), pages 57-76, February.
    3. Chatkaew Jariyatantiwait & Gary G. Yen, 2014. "Multiobjective Differential Evolution Based on Fuzzy Performance Feedback," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 5(4), pages 45-64, October.
    4. Zouache, Djaafar & Moussaoui, Abdelouahab & Ben Abdelaziz, Fouad, 2018. "A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 74-88.
    5. Przybylski, Anthony & Gandibleux, Xavier & Ehrgott, Matthias, 2008. "Two phase algorithms for the bi-objective assignment problem," European Journal of Operational Research, Elsevier, vol. 185(2), pages 509-533, March.
    6. Jaszkiewicz, Andrzej, 2002. "Genetic local search for multi-objective combinatorial optimization," European Journal of Operational Research, Elsevier, vol. 137(1), pages 50-71, February.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Nour Elhouda Chalabi & Abdelouahab Attia & Abderraouf Bouziane & Mahmoud Hassaballah & Abed Alanazi & Adel Binbusayyis, 2023. "An Archive-Guided Equilibrium Optimizer Based on Epsilon Dominance for Multi-Objective Optimization Problems," Mathematics, MDPI, vol. 11(12), pages 1-30, June.
    2. Abdelaziz, Fouad Ben & Maddah, Bacel & Flamand, Tülay & Azar, Jimmy, 2024. "Store-Wide space planning balancing impulse and convenience," European Journal of Operational Research, Elsevier, vol. 312(1), pages 211-226.
    3. Zhe Liu & Shurong Li, 2022. "A numerical method for interval multi-objective mixed-integer optimal control problems based on quantum heuristic algorithm," Annals of Operations Research, Springer, vol. 311(2), pages 853-898, April.

    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. Zouache, Djaafar & Moussaoui, Abdelouahab & Ben Abdelaziz, Fouad, 2018. "A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the knapsack problem," European Journal of Operational Research, Elsevier, vol. 264(1), pages 74-88.
    2. Chou, Jui-Sheng & Truong, Dinh-Nhat, 2020. "Multiobjective optimization inspired by behavior of jellyfish for solving structural design problems," Chaos, Solitons & Fractals, Elsevier, vol. 135(C).
    3. Florios, Kostas & Mavrotas, George, 2014. "Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems," MPRA Paper 105074, University Library of Munich, Germany.
    4. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    5. Jamain, Florian, 2014. "Représentations discrètes de l'ensemble des points non dominés pour des problèmes d'optimisation multi-objectifs," Economics Thesis from University Paris Dauphine, Paris Dauphine University, number 123456789/14002 edited by Bazgan, Cristina.
    6. Anthony Przybylski & Xavier Gandibleux & Matthias Ehrgott, 2010. "A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme," INFORMS Journal on Computing, INFORMS, vol. 22(3), pages 371-386, August.
    7. Selçuklu, Saltuk Buğra & Coit, David W. & Felder, Frank A., 2020. "Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems," European Journal of Operational Research, Elsevier, vol. 284(2), pages 644-659.
    8. David Bergman & Merve Bodur & Carlos Cardonha & Andre A. Cire, 2022. "Network Models for Multiobjective Discrete Optimization," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 990-1005, March.
    9. Christian Roed Pedersen & Lars Relund Nielsen & Kim Allan Andersen, 2008. "The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 400-411, August.
    10. Arroyo, Jose Elias Claudio & Armentano, Vinicius Amaral, 2005. "Genetic local search for multi-objective flowshop scheduling problems," European Journal of Operational Research, Elsevier, vol. 167(3), pages 717-738, December.
    11. Holzmann, Tim & Smith, J.C., 2018. "Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations," European Journal of Operational Research, Elsevier, vol. 271(2), pages 436-449.
    12. Li, Yan-Fu & Zhang, Hanxiao, 2022. "The methods for exactly solving redundancy allocation optimization for multi-state series–parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 221(C).
    13. Mei, Yi & Salim, Flora D. & Li, Xiaodong, 2016. "Efficient meta-heuristics for the Multi-Objective Time-Dependent Orienteering Problem," European Journal of Operational Research, Elsevier, vol. 254(2), pages 443-457.
    14. Bogdan Rębiasz, 2009. "A method for selecting an effective investment project portfolio," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 19(3), pages 95-117.
    15. Lakmali Weerasena & Aniekan Ebiefung & Anthony Skjellum, 2022. "Design of a heuristic algorithm for the generalized multi-objective set covering problem," Computational Optimization and Applications, Springer, vol. 82(3), pages 717-751, July.
    16. Luo, Hao & Yang, Xuan & Kong, Xiang T.R., 2019. "A synchronized production-warehouse management solution for reengineering the online-offline integrated order fulfillment," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 211-230.
    17. Calvete, Herminia I. & Galé, Carmen & Iranzo, José A., 2016. "MEALS: A multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem," European Journal of Operational Research, Elsevier, vol. 250(2), pages 377-388.
    18. Aristotelis E. Thanos & Nurcin Celik & Juan P. Sáenz, 2016. "An Evolutionary Sequential Sampling Algorithm for Multi-Objective Optimization," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.
    19. Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, January.
    20. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.

    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:spr:annopr:v:296:y:2021:i:1:d:10.1007_s10479-019-03407-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.