A Strategic Study of Hybrid Algorithms Applied to Optimize the External Tool Repository Tool Restriction Problem in the FMS Shop Floor Planning Process
Bibliographic record
Abstract
The article firstly establishes a mathematical model of the FMS shop floor planning process problem, and combines the rescheduling strategy and rolling scheduling strategy for solving the FJSP problem.Subsequently, the simulated annealing genetic algorithm is improved by relying on genetic algorithm, simulated annealing algorithm and particle swarm optimization algorithm, and the application of hybrid optimization algorithm in problem solving is proposed.The simulated annealing algorithm is incorporated into the crossover and mutation operations of the genetic algorithm to strengthen the local search capability, and then the global annealing operation is incorporated into the new individuals obtained.The overall design of the mixed reality-based FMS virtual simulation system was tested with a view to optimizing the external tool library tool limitation problem in the FMS shop floor planning process.The results of the simulation experiments show that although the algorithm of this paper, SaDE and CoDE algorithms can reach the optimal solution, the convergence speed of the algorithm proposed in this paper is significantly better than the other two algorithms.Based on the experimental results, the article finally constructs a mixed reality-based FMS virtual simulation system to solve the external tool library tool limitation problem in the FMS shop floor planning process.
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.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".