Secured Multi-Dimensional Robust Optimization Model for Remotely Piloted Aircraft System (RPAS) Delivery Network Based on the SORA Standard
Bibliographic record
Abstract
The range of applications of RPAs in various industries indicates that their increased usage could reduce operational costs and time. Remotely piloted aircraft systems (RPASs) can be deployed quickly and effectively in numerous distribution systems and even during a crisis by eliminating existing problems in ground transport due to their structure and flexibility. Moreover, they can also be useful in data collection in damaged areas by correctly defining the condition of flight trajectories. Hence, defining a framework and model for better regulation and management of RPAS-based systems appears necessary; a model that could accurately predict what will happen in practice through the real simulation of the circumstances of distribution systems. Therefore, this study attempts to propose a multi-objective location-routing optimization model by specifying time window constraints, simultaneous pick-up and delivery demands, and the possibility of recharging the used batteries to reduce, firstly, transport costs, secondly, delivery times, and thirdly, estimated risks. Furthermore, the delivery time of the model has been optimized to increase its accuracy based on the uncertain conditions of possible traffic scenarios. It is also imperative to note that the assessment of risk indicators was conducted based on the Specific Operations Risk Assessment (SORA) standard to define the third objective function, which was conducted in a few previous studies. Finally, it shows how the developed NSGA-II algorithm in this study performed successfully and reduced the objective function by 31%. Comparing the obtained results using an NSGA-II meta-heuristic approach, through the rigorous method GAMS, indicates that the results are valid and reliable.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".