An efficient controlled elitism non-dominated sorting genetic algorithm for multi-objective supplier selection under fuzziness
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
Abstract Supplier selection and order allocation constitute vital strategic decisions that must be made by managers within supply chain management environments. In this paper, we propose a multi-objective fuzzy model for supplier selection and order allocation in a two-level supply chain with multi-period, multi-source, and multi-product characteristics. The supplier evaluation objectives considered in this model include cost, delay, and electronic-waste (e-waste) minimization, as well as coverage and weight maximization. A signal function is used to model the price discount offered by the suppliers. Triangular fuzzy numbers are used to deal with the uncertainty of delay and e-waste parameters while the fuzzy Technique for Order Performance by Similarity to Ideal Solution (TOPSIS) is used to obtain the weights of the suppliers. The resulting NP-hard problem, a Pareto-based meta-heuristic algorithm called controlled elitism non-dominated sorting genetic algorithm (CENSGA), is developed. The Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO) are used to validate the applicability of the CENSGA algorithm and the Taguchi technique to tune the parameters of the algorithms. The results are analysed using graphical and statistical comparisons illustrating how the proposed CENSGA dominates NSGA-II and MOPSO in terms of mean ideal solution distance (MID) and spacing metrics.
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.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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