Design of a hybridization between Tabu search and PAES algorithms to solve a multi-depot, multi-product 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
Vehicle routing problem (VRP) is a classic problem studied in logistic. One of the most important variations within this problem is called Green Vehicle Routing Problem (GVRP), in which environmental aspects are considered when designing product delivery routes. This variant arises due to the high levels of pollution produced by transport vehicles, so it is a variation whose study represents a vital impact nowadays. This project will consider a GVRP and will be developed considering the characteristics of multi-depot (MDVRP) and multi-product (MPVRP) to minimize the costs of assignation of vehicles and CO2 emissions. To solve the problem, this project proposes a hybridization between the classic tabu search (TS) metaheuristic and the PAES algorithm (TS+PAES) to generate the Pareto frontier of both objectives. An integer mixed linear programming model is formulated and developed for each objective function separately to have an optimal point of comparison for the efficiency of the proposed algorithm. Also, the TS+PAES algorithm is compared to the nearest neighbor algorithm for large instances. Two computational experiments were carried out, one for small and the other one for large instances. The experiment for small instances showed that the GAP of each extreme of the frontier compared to the MILP model is on average 0.73%. For large instances, the metaheuristic improves in 0.1% the results presented by the MILP model showing that the metaheuristic provides closer near-optimal solutions in less computational time. Besides, the metaheuristic, in comparison with the nearest neighborhood heuristic, improves in 44.21% the results of emissions and in 3.88% the costs. All these results demonstrate the effectiveness of the metaheuristic.
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.005 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.004 |
| 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 it