A novel framework for a stand-alone Orienteering Problem reinforcement learning-driven beam search
Bibliographic record
Abstract
This study improves the orienteering algorithm since neural network-based routing strategies have crucial issues. Most conventional approaches use node coordinates, but they use encoder-decoder patterns that don't understand the self-referential nature of routing tasks, resulting in low accuracy during the first steps of node selection and making them impractical. A hybrid technique using a variant beam search algorithm and a learnt heuristic function with higher quality and shorter computation time is offered to overcome these difficulties. Our solution uses an attention-based functional neural network to learn structural dependence between nodes via distance matrices. The reinforcement learning infrastructure trains the heuristic function to enhance node choices and sequences. Experiments show that the single- and multi-label temporal correlation models surpass existing benchmarks on numerous benchmark datasets. In particular, the suggested model generates near optimum solutions with 98.7% accuracy and beats the state-of-the-art technique by 4.3%. Using the suggested framework, convergence is 30% quicker and computing efficiency increases. These findings show that the strategy is beneficial and more efficient, accurate, and practical than current approaches for handling routing difficulties.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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".