Solving the Multi-Objective Facility Layout Problem Using Evolutionary Multi-Objective Optimization Algorithms
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
The multi-objective facility layout problem is defined in the literature as an extension of the famous quadratic assignment problem (QAP). Most previous mathematical models tried to combine both the quantitative and the qualitative objectives into a single objective by using weighting factors. This paper introduces a multi-objective mathematical model and solves it using the revised Strength Pareto Evolutionary Algorithm (SPEAII). The purpose of this paper is to find an efficient set of solutions “Pareto optimal set” which could be introduced to the decision maker to select the best alternative, while considering conflicting and noncommensurate objectives. A computer program is developed to define the mathematical model, code candidate solutions into genetic form, and use Evolutionary Multi-Objective Optimization algorithms (EMO) to find the efficient set of solutions. The problem model is built according to its customized data input. The suggested model and solution algorithms are applied to a wide set of different benchmark problems. Results showed the superiority of the suggested models and algorithms in terms of the quality of solution and objective space exploration.
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.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