ArticlePloS one2025
Development of an integrated intelligent BIM-based model for multi-objective optimization in engineering assembly processes.
Article in PloS one, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
1 author.
Funding
No grant is acknowledged in the PubMed record.
Abstract
To enhance construction efficiency and economic performance in prefabricated building projects under limited resource conditions, this study proposes an integrated intelligent optimization model based on Building Information Modeling (BIM) semantic representation. The model is designed to generate optimal assembly plans under multi-objective trade-offs, achieving a balanced compromise between shortened construction periods, reduced costs, and minimized resource conflicts. The study begins by constructing an assembly semantic model using the publicly available BuildingNet dataset, extracting key components' geometric structures and spatial topology to establish a data foundation suitable for multi-objective scheduling modeling. A multi-objective particle swarm optimization (MOPSO) algorithm enhanced with a dynamic objective weighting mechanism is then introduced. By allowing flexible prioritization of construction duration, budget cost, and resource usage, the model generates a diverse solution set and provides multiple candidate optimization schemes. Furthermore, a Deep Q-Network (DQN)-based reinforcement learning strategy is integrated to provide real-time feedback on each solution's performance during simulated scheduling, enabling continuous policy updates and adaptive evolution. Experiments conducted on 100 standardized assembly tasks demonstrate the model's effectiveness, producing feasible solution sets under varying objective weights. For a representative configuration, the model achieves an average construction period of 85.2 days, a budget cost of USD 1.486 million, and fewer than 1.7 resource conflict events. Compared with rule-based scheduling models, the Non-dominated Sorting Genetic Algorithm II (NSGA-II), and static MOPSO without feedback mechanisms, the proposed approach outperforms in terms of objective coverage, convergence speed, and solution diversity. It achieves superior results in key metrics, including hypervolume (HV = 0.683), solution spread (Spread = 0.227), and inverted generational distance (IGD = 0.017), validating its robustness and adaptability in complex trade-off scenarios. The findings indicate that integrating semantic modeling, evolutionary optimization, and learning-based feedback offers significant potential for dynamic multi-objective construction optimization, providing effective support for BIM practices oriented toward benefit-schedule-resource coordination.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.