Revolutionizing RPAS logistics and reducing CO2 emissions with advanced RPAS technology for delivery systems
Bibliographic record
Abstract
To manage remotely piloted aircraft system (RPAS) networks effectively, this research presents a multi-objective location-routing optimization model. This model integrates time window constraints, concurrent pick-up and delivery demands, and rechargeable battery functionality, and also introduces a standardized framework to clarify the RPAS CO2 emission model. These integrations significantly decrease battery consumption in Remotely Piloted Aircraft Systems (RPAS) and lower transportation costs, while also optimizing delivery times, reducing operational risks, and minimizing CO2 emissions. The model’s enhancement for optimizing delivery schedules takes into account uncertain traffic conditions, thus improving accuracy in dynamic environments and further contributing to environmental sustainability. Risk assessment employs the Specific Operations Risk Assessment (SORA) standard, adding a third objective function. This combination of the model, further enhance the efficiency and sustainability of RPAS operations, by optimizing delivery schedules, reducing CO2 emissions and battery consumption, and improving accuracy under dynamic conditions. Also, it make RPAS logistics more practical and effective in real-world applications. As result, the NSGA-II algorithm achieves significant reductions across all objectives: 33.3 % in cost, 6.48 % in time, 33.3 % in risk, and 35.7 % in battery usage within 250 generations. The use of the NSGA-II meta-heuristic method for validation enhances the credibility and practicality of the model. The optimization model’s performance over 250 generations shows rapid initial improvements in cost, time, risk, and battery usage, followed by stabilization, indicating efficient convergence and effective evolutionary computation. Also the findings show that with a CO2 emission rate of 3.773 × 10 4 kg of CO 2 per Wh, highlighting the model’s efficiency and effectiveness.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 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".