Multimodal Transport Path Selection of Cold Chain Logistics Based on Improved Particle Swarm Optimization Algorithm
Bibliographic record
Abstract
Multimodal transport is a process of effectively moving cargoes in a single container by combining land transport (road or rail) and maritime or river transport (vessel or barge) in one transport chain. However, cold chain logistics (CCL), as a special while major kind of cargo delivery, has not been incorporated with this beneficial combination. In order to realize efficient delivery of cold chain foods (CCF), in this study, the characteristics of multimodal and CCL are analyzed and integrated to select the optimal logistics path. In establishing the path-selection model, customer satisfaction is introduced, which is reflected by arrival punctuality and the quality of CCF. An improved particle swarm optimization algorithm (IPSO) is introduced to address the model and is proven to retain a fast convergence rate and achieve outstanding solving accuracy through the experimental study. Sensitivity analysis is also conducted to present the impact of railway speed and cost variation on path selection. Results show that compared with highway transport, railway transport is preferable to the medium and long distance. The influence of railway speed improvement is more striking than cost reduction in motivating decision makers to choose railway transport mode in logistics operations.
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.001 |
| 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.000 |
| 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.002 | 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".