An extended PSO algorithm for cold-chain vehicle routing problem with independent loading and minimum fuel volume
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
With the increasing complexity of the distribution environment, customers usually propose higher requirements, such as independent loading of local and foreign cold-chain items in the event of an emergency. Moreover, minimum fuel volume plays an important role in the process of transportation with different speeds and different kinds of vehicles. In this paper, we present a new mathematical model to characterize cold-chain vehicle routing optimization with independent loading of local and foreign items and minimum fuel volume. To address the above mathematical model, an extended particle swarm optimization (PSO) algorithm is proposed by combining original PSO with 2-opt optimization to improve diversity and reduce convergence speed. Six sets of experiments are set to verify the practical performance and stability of the extended PSO algorithm based on three standard datasets of C201, R201, and RC201 from Solomon.
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