A Hybrid Search Method for Evolutionary Dynamic Optimization of the 3-dimensional Personnel Assignment Problem and its Case Study Evaluation at The City of Calgary
Bibliographic record
Abstract
Evolutionary dynamic optimization is receiving more attention as it continues to deliver value in more application areas. In this thesis, an evolutionary dynamic optimization method for solving both static and dynamic personnel assignment optimization problems is proposed. This evolutionary method is based on the idea of genetic algorithms. Starting with the static scenario, I build an evolutionary algorithm that utilizes two variations of an OR-tree-based search method in generating the initial population and offspring. I then use the evolutionary algorithm for the static scenario as a framework into which I integrate two new strategies for tackling dynamism in the problem. In this thesis, I focus on the type of changes that require getting new (i.e. up-to-date) solutions as fast as possible right after the change. This type of changes has many applications in areas such as aircraft landing and take-off scheduling and mobile wireless network routing. Motivated by a real-world problem (at the City of Calgary), I focus on the changes in the availability of personnel in personnel assignment problems. I have two proposed solution approaches to the dynamism which utilize OR-tree-based search features and epigenetics mechanisms (both inside the evolutionary algorithm). Three additional strategies for tackling other types of changes are also presented. In this research, multidimensionality and dynamism are for the first time brought together into the personnel assignment problem. Using both real-world data (for the case study) and synthetic data (for additional evaluation) in the experiments, the experimental results prove the usefulness and responsiveness of my proposed solution approaches. Moreover, the feedback from the domain experts and higher level management in the case study show a strong preference for using my system and its outputs over the current practice. The case study took place in the Waste and Recycling Services business unit at the City of Calgary in Alberta, Canada. The synthetic data was generated based on the real-world data.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".