Zobrazeno 1 - 10
of 10
pro vyhledávání: '"Nghiep Trinh Nguyen Dang"'
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-23 (2024)
Abstract Meta-heuristic algorithms distinguish themselves from conventional optimization methods owing to their intrinsic adaptability and straightforward implementation. Among them, the sine cosine algorithm (SCA) is lauded for its ability to transi
Externí odkaz:
https://doaj.org/article/ee8e96b64389416f8a7afabe73138987
Publikováno v:
Scientific Reports, Vol 14, Iss 1, Pp 1-29 (2024)
Abstract The present study focuses on the problem of vehicle routing with limited capacity, with the objective of minimizing the transportation distance required to serve h clients with predetermined locations and needs. The aim is to create k trips
Externí odkaz:
https://doaj.org/article/46901b34726749c6ba0ee9be685eb4f3
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-20 (2023)
Abstract The global construction industry plays a pivotal role, yet its unique characteristics pose distinctive challenges. Each construction project, marked by its individuality, substantial value, intricate scale, and constrained adaptability, conf
Externí odkaz:
https://doaj.org/article/58c756f190b24ce59f3edb26994ad239
Publikováno v:
International Journal of Computational Intelligence Systems, Vol 16, Iss 1, Pp 1-25 (2023)
Abstract The sine cosine algorithm (SCA) is widely recognized for its efficacy in solving optimization problems, although it encounters challenges in striking a balance between exploration and exploitation. To improve these limitations, a novel model
Externí odkaz:
https://doaj.org/article/29b0e9288af94d9db36440608cba7c60
Publikováno v:
Applied Computational Intelligence and Soft Computing, Vol 2024 (2024)
The emphasis on sustainable development is increasingly recognized as a global imperative, leading to significant transformations in methods and technologies within the construction industry. Specifically, the optimization of the mass of truss struct
Externí odkaz:
https://doaj.org/article/768ce9f89d4f4bd286d53c7c61cdb828
Publikováno v:
Applied Computational Intelligence and Soft Computing, Vol 2024 (2024)
The multiverse optimizer (MVO) is increasingly recognized across various scientific disciplines for its robust search capabilities that enhance decision-making in diverse tasks. Despite its strengths, MVO often encounters limitations due to premature
Externí odkaz:
https://doaj.org/article/ef314cddf1a445298cfb024f70d5b64e
Publikováno v:
Scientific Reports, Vol 13, Iss 1, Pp 1-24 (2023)
Abstract The analysis of the relationship between time and cost is a crucial aspect of construction project management. Various optimization techniques have been developed to solve time–cost trade-off problems. A hybrid multi-verse optimizer model
Externí odkaz:
https://doaj.org/article/0dc376f7b6f94c5d8b2697a435ad46b0
Since the start of critical path method development, time–cost trade-off problems have been intensively explored and have become one of the most essential parts of construction project planning and control. Reasonable use and operation of the works
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8bdec4a6a73691fa904196fc291fadbd
https://doi.org/10.21203/rs.3.rs-2411254/v1
https://doi.org/10.21203/rs.3.rs-2411254/v1
MVO (multi-verse optimizer) and SCA (sine cosine algorithm) are stochastic optimization algorithms used in many scientific fields. SCA is a simple optimization algorithm that can exploit the search area and smoothly shift from exploration to exploita
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1210a531df8407127d086f5868268a00
https://doi.org/10.21203/rs.3.rs-2406972/v1
https://doi.org/10.21203/rs.3.rs-2406972/v1
Time–cost trade-off analysis is one of the most important aspects of construction project planning and control. The completion time of one project can be shortened by allocating additional resources to key activities; however, additional costs are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a03a1f9e003100514b56c12f5ace995
https://doi.org/10.21203/rs.3.rs-2418111/v1
https://doi.org/10.21203/rs.3.rs-2418111/v1