Solving a multi-trip VRP with real heterogeneous fleet and time windows based on ant colony optimization
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
This paper deals with optimizing a practical variant of Vehicle Routing Problem (VRP), namely multi-trip VRP with heterogeneous fleet and time windows (MTVRPHFTW). To be able to solve this problem for industrial applications, we proposed an efficient constructive-based algorithm based on ant colony optimization (ACO) meta-heuristic. Two additional heuristics are proposed to further improve the performance of the algorithm. For evaluation, the proposed algorithm in this paper, named ACO algorithm with improvement mechanisms (IACO), is tested based on data provided by a logistics company in Canada with real-world settings. Experimental results of IACO demonstrates superiority of the proposed algorithm in terms of travelling cost, number of trips per vehicle, number of total trips, and balancing the load between the drivers compared to existing methods including the actual route history.
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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| 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