IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0328005.html
   My bibliography  Save this article

MOSRS: An engineering multi-objective optimization through Einsteinian concept

Author

Listed:
  • Vahid Goodarzimehr
  • João Luiz Junho Pereira
  • Nima Khodadadi

Abstract

Multi-objective optimization stands at the intersection of mathematics, engineering, and decision-making, and metaheuristics offer a promising avenue for tackling such challenges. The literature shows they are the best, and there is space for new algorithms to deliver Pareto Fronts (PFs) with more convergence and coverage at lower computational costs. This paper presents the Multi-objective Special Relativity Search (MOSRS) for the first time. It relies on principles inspired by the theory of special relativity physics, which iteratively refines solutions toward optimality and self-adapts its parameters using these laws. Unlike most algorithms in the literature today, the user sets only the number of iterations and particles (or population). To test the performance, MOSRS is applied to the most challenging test functions set (CEC 2009) and 21 real and constrained world problems, being compared with a total of eleven metaheuristics: NSGA-II, NSGA-III, MOEA/D, MOPSO, MOGWO, ARMOEA, TiGE2, CCMO, ToP, and AnD. Inverted Generational Distance, Spacing, Maximum Spread, and Hypervolume are used to identify the best algorithm. MOSRS was robust in finding the best PF in most studied problems. The source codes of the MOSRS algorithm are publicly available at https://nimakhodadadi.com/algorithms-%2B-codes.

Suggested Citation

  • Vahid Goodarzimehr & João Luiz Junho Pereira & Nima Khodadadi, 2025. "MOSRS: An engineering multi-objective optimization through Einsteinian concept," PLOS ONE, Public Library of Science, vol. 20(7), pages 1-33, July.
  • Handle: RePEc:plo:pone00:0328005
    DOI: 10.1371/journal.pone.0328005
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0328005
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0328005&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0328005?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
    ---><---

    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:plo:pone00:0328005. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.