ArticlePloS one2020
Decomposition and adaptive weight adjustment method with biogeography/complex algorithm for many-objective optimization.
Article in PloS one, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
In the EMO (evolutionary multi-objective, EMO) algorithm, MaOPs (many objective optimization problems, MaOPs) are sometimes difficult to keep the balance of convergence and diversity. The decomposition based EMO developed for MaOPs has been proved to be effective, and BBO/Complex (the biogeography based optimization for complex system, BBO/Complex) algorithm is a low complexity algorithm. In this paper, a decomposition and adaptive weight adjustment based BBO/Complex algorithm (DAWA-BBO/Complex) for MaOPs is proposed. First, a new method based on crowding distance is designed to generate a set of weight vectors with good uniformly. Second, an adaptive weight adjustment method is used to solve MaOPs with complex Pareto optimal front. Subsystem space obtains a non-dominated solution by a new selection strategy. The experimental results show that the algorithm is superior to other new algorithms in terms of convergence and diversity in DTLZ benchmark problems. Finally, the algorithm is used to solve the problem of NC (numerical control machine, NC) cutting parameters, and the final optimization result is obtained by AHP (Analytic Hierarchy Process, AHP) method. The results show that the cutting speed is 10.8m/min, back cutting depth is 0.13mm, the cutting time is 504s and the cutting cost is 22.15yuan. The proposed algorithm can effectively solve the practical optimization problem.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.