A decision support tool for forwarding operations with sequence-dependent loading
Bibliographic record
Abstract
High productivity in forest harvesting requires efficient forwarding. Planning is complicated by multiple choices of routes and their order, the number and types of assortments, the loading sequence, and pile organization at the landing. This paper develops and tests a decision support tool for forwarder routing with sequential co-loading of assortments. Input data are the harvester production file (including Global Navigation Satellite Systems tracking), placement of landing, and machine specifications. The trail network is generated from the harvester production data when devising routes to pick up all log piles, including specific assortments and volumes. Multiple assortments can be loaded along each route, and a certain loading sequence of assortments is preferred and (or) required. Sorting time during co-loading varies, depending on the assortment combinations and bunk loading pattern. Route planning is modeled using a set-partitioning problem, and the solution method is a metaheuristic based on repeated matching. In addition to routes and loading sequences, solutions include the organization of assortment piles at the landing, depending on the total volume of each assortment. The tool produces similar results to those attained by skilled forwarder operators on five clearcuts (3–11 ha) in northern Sweden, when the results are compared with data from actual forwarder production files.
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.004 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.018 | 0.003 |
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".