Multiyear Maintenance and Rehabilitation Optimization for Large-Scale Infrastructure Networks: An Enhanced Genetic Algorithm Approach
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.
Bibliographic record
Abstract
Multiyear network maintenance and rehabilitation optimization is a key, longstanding challenge for infrastructure asset management. Although genetic algorithms (GAs) have been widely used as the default optimization tool, successes were limited to small-scale networks. As the network size increases, the performance of conventional GAs quickly deteriorates because the traditional crossover and mutation operations disrupt promising solution compositions and drastically reduce the likelihood of obtaining a feasible solution. To address this gap, this paper introduced an enhanced GA that pivots on two innovations: a new crossover technique that swaps annual plans as a block of genes; and a novel mutation technique that incorporates linear programming (LP) to solve annual plans with a randomly perturbed budget profile. Both operations preserved the integrity of individual annual plans throughout the evolutionary process and enhanced local search capabilities. The hybrid LP-GA was tested with two practical case studies, one with a small-scale sewer network flushing program, and the other involving 13,610 pavement segments. Both case studies showed that the proposed algorithm quickly converged with 100% feasible solutions to optimum or near-to-optimum solutions. Through this work, we offered a sophisticated algorithmic tool for infrastructure planning, setting a stage for further advances in the domain.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it