IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v61y2024i2d10.1007_s12597-023-00737-x.html
   My bibliography  Save this article

Solving time cost optimization problem with adaptive multi-verse optimizer

Author

Listed:
  • Vu Hong Son Pham

    (Ho Chi Minh City University of Technology (HCMUT), Vietnam National University (VNU-HCM))

  • Nghiep Trinh Nguyen Dang

    (Ho Chi Minh City University of Technology (HCMUT), Vietnam National University (VNU-HCM))

Abstract

The construction industry holds a central role globally, marked by its unique attributes that lead to distinct challenges. Given projects in this sector are often tailored to specific needs, operate on a grand scale, showcase complex designs, and have limited adaptability, the industry frequently confronts the dual challenges of time and cost. In construction project management, a fundamental task is to harmonize these time and cost considerations effectively. The Multi-Verse Optimizer (MVO) algorithm has been identified as a potential tool to navigate the intricate search spaces typical of construction endeavors. However, MVO is not without its challenges, specifically its slower convergence rate and propensity for entrapment in local optima. In response to these challenges, this research introduces the Adaptive Multi-Verse Optimizer (aMVO) model. By integrating the Modified Adaptive Weight Approach (MAWA) with the MVO algorithm, the aMVO aims to bolster optimization efficiency. Centering on the complex domain of time-cost optimization problems (TCP), this study embarks on an in-depth evaluation of the aMVO against benchmarks covering scenarios with 18, 90, and 180 activities. The findings compellingly underscore the superiority of aMVO in navigating the complexities of TCP, particularly when contrasted with methods such as GA, MFO, SCA, DA, and ALO. This firmly positions aMVO as an indispensable tool in the domain of construction project management.

Suggested Citation

  • Vu Hong Son Pham & Nghiep Trinh Nguyen Dang, 2024. "Solving time cost optimization problem with adaptive multi-verse optimizer," OPSEARCH, Springer;Operational Research Society of India, vol. 61(2), pages 662-679, June.
  • Handle: RePEc:spr:opsear:v:61:y:2024:i:2:d:10.1007_s12597-023-00737-x
    DOI: 10.1007/s12597-023-00737-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-023-00737-x
    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/s12597-023-00737-x?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:spr:opsear:v:61:y:2024:i:2:d:10.1007_s12597-023-00737-x. 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.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.