MétaCan
Menu
Back to cohort

Resource Optimization Using Combined Simulation and Genetic Algorithms

2003· article· en· W2044479004 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueJournal of Construction Engineering and Management · 2003
Typearticle
Languageen
FieldDecision Sciences
TopicResource-Constrained Project Scheduling
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer scienceScheduling (production processes)Genetic algorithmSoftwareSet (abstract data type)Mathematical optimizationResource (disambiguation)Simulation modelingSimulation softwareIndustrial engineeringEngineeringMachine learning

Abstract

fetched live from OpenAlex

This paper presents a new approach for resource optimization by combining a flow-chart based simulation tool with a powerful genetic optimization procedure. The proposed approach determines the least costly, and most productive, amount of resources that achieve the highest benefit/cost ratio in individual construction operations. To further incorporate resource optimization into construction planning, various genetic algorithms (GA)-optimized simulation models are integrated with commonly used project management software. Accordingly, these models are activated from within the scheduling software to optimize the plan. The result is a hierarchical work-breakdown-structure tied to GA-optimized simulation models. Various optimization experiments with a prototype system on two case studies revealed its ability to optimize resources within the real-life constraints set in the simulation models. The prototype is easy to use and can be used on large size projects. Based on this research, computer simulation and genetic algorithms can be an effective combination with great potential for improving productivity and saving construction time and cost.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.338
Threshold uncertainty score0.361

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.039
GPT teacher head0.304
Teacher spread0.265 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it