A New Hybrid Butterfly Optimization Algorithm for Green Vehicle Routing Problem
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
In the industrial sector, transportation plays an essential role in distribution. This activity impacts climate change and global warming. One of the critical problems in distribution is the green vehicle routing problem (G-VRP). This study focuses on G-VRP for a single distribution center. The objective function is to minimize the distribution costs by considering fuel costs, carbon costs, and vehicle use costs. This research aims to develop the hybrid butterfly optimization algorithm (HBOA) to minimize the distribution costs on G-VRP. It was inspired by the butterfly optimization algorithm (BOA), which was by combining the tabu search (TS) algorithm and local search swap and flip strategies. BOA is a new metaheuristic algorithm that has been successfully applied in various engineering fields. Experiments were carried out to test the parameters of the proposed algorithm and vary the speed of vehicles. The proposed algorithm was also compared with several procedures of prior study. The experimental results proved that the HBOA could minimize the total distribution cost compared to other algorithms. Moreover, the computation time is also included in the analysis.
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.
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.001 |
| 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 it