BHARAT: A simple and effective multi-criteria decision-making method that does not need fuzzy logic, Part-2: Role in multi- and many-objective optimization problems
Bibliographic record
Abstract
A simple and effective multi-attribute decision-making method, named as BHARAT method, is proposed in Part-1 of this paper and the same method is used now as a multi- and many-objective decision-making method for evaluating the Pareto optimal solutions. The proposed BHARAT method is used to identify the best compromise Pareto solution. Based on their importance for the given optimization problem, the objectives are ranked, and the weights are assigned. The weights of the objectives and the normalized values of the objectives for different Pareto optimal solutions are used to compute the total scores. The total scores are used to differentiate the alternative optimal solutions and an alternative solution that gets the highest total score is suggested as the best compromise solution. Three case studies are presented to illustrate and validate the proposed BHARAT method. The case study 1 is a multi-objective optimization problem related to cloud manufacturing with 3 objectives and 20 alternative solutions; case study 2 is a many-objective optimization problem of electro-discharge machining process with 4 objectives and 50 alternative solutions; case study 3 is a many-objective optimization of milling process parameters with 4 objectives and 100 alternative solutions. The outcomes of the suggested BHARAT method are compared with those of the other popular decision-making approaches for each of the three case studies considered. The suggested simple and more logical BHARAT method can be used in multi- and many-objective optimization problems to select the best compromise solution.
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.007 | 0.009 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.002 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.007 | 0.001 |
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".