Enhancing unmanned aerial vehicles logistics for dynamic delivery: a hybrid non-dominated sorting genetic algorithm II with Bayesian belief networks
Bibliographic record
Abstract
Abstract To address the complexities of managing networks of unmanned aerial vehicles (UAVs) and Just-in-Time problem solving, this study introduces a cutting-edge multi-objective location-routing optimization model. This model integrates time window constraints, concurrent pick-up and delivery demands, and rechargeable battery functionality, significantly enhancing the efficiency of UAV operations. It reduces battery consumption and transportation costs while optimizing delivery times and reducing operational risks. The model improves the refinement of delivery schedules by accounting for uncertain traffic scenarios, thereby increasing its accuracy and reliability in dynamic environments. Additionally, a Bayesian belief networks approach for risk assessment introduces a new layer to operational risk management. The model’s performance and its trade-offs are demonstrated through advanced data visualizations such as 3D Pareto fronts, pair plots, and network graphs, with validation via the NSGA-II approach confirming its reliability and practical applicability. This research represents a major leap forward in drone routing strategies, focusing on efficiency, adaptability, and risk management in UAV logistics and provides a comprehensive framework that bridges the gap between theoretical exploration and practical application.
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.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.001 | 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".