Mathematical Model and Algorithm of Multi-Index Transportation Problem in the Background of Artificial Intelligence
Bibliographic record
Abstract
The development of artificial intelligence has brought rapid changes to human life and brought great convenience to human activities. The development of various modes of transportation has also brought convenience to people’s travel and commodity transactions, but it has also added more issues that need to be carefully considered. Because of the diversification of transportation methods, transportation problems also arise many fields, such as air transportation, water transportation, and land transportation. The development of mathematical models and algorithms for transportation problems is also in full swing, and it is a major trend to introduce mathematical models and algorithms into the solution of transportation problems. This paper deals with the multi-index transportation problem by establishing a multi-index mathematical model and algorithm to find a scientific transportation method for the goods to be transported, so as to save the cost and time of transportation. Experiments show that the mathematical model established in this paper has high efficiency for solving the multi-index transportation problem. At the same time, the most suitable transportation method can also be selected for the transportation of goods, and the route planned by the mathematical model and algorithm can reduce the risk to 12.34%.
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 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.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".