The Truck Platooning Routing Optimization Model Based on Multicommodity Network Flow Theory
Bibliographic record
Abstract
Truck platooning has been identified as an emerging and promising operational technology with the advantages of fuel consumption savings and carbon emissions reductions. We formulate the truck platooning routing optimization problem as a multi-commodity network flow problem from a transportation optimization and scheduling perspective. Based on fuel consumption savings generated through the reduction of aerodynamic drag by the formation of truck platooning, the route of each truck is also set to be a decision variable needing settlement to facilitate the formation of truck platooning to maximize fuel consumption savings. Considering fuel consumption and detour costs, we construct a truck platooning routing optimization model with minimum overall system fuel consumption as the optimization objective. The output of the routing optimization model could both reflect the composition of each truck platooning on each link and directly show the routings of each truck. To explore the impact of the restrictions on the number of trucks in truck platooning on overall fuel consumption savings, road networks are constructed and the truck platooning routing optimization model is solved by the commercial solver CPLEX. Compared to individual trucks, 8% or 12% fuel consumption savings are achieved, respectively, with the number of trucks being restricted or not restricted in truck platooning. Considering the different fuel reduction rates of the following trucks in platooning on the system performance in terms of the total fuel cost, a sensitivity analysis is also conducted. The results also show that the ideal truck platooning routing plan can be obtained by the proposed model, and the study provides a theoretical reference for the promotion and application of truck platooning.
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.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 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".