Results 11 to 20 of about 28,586 (232)
Self-adaptive polynomial mutation in NSGA-II
Evolutionary multi-objective optimization is a field that has experienced a rapid growth in the last two decades. Although an important number of new multi-objective evolutionary algorithms have been designed and implemented by the scientific community, the popular Non-Dominated Sorting Genetic Algorithm (NSGA-II) remains as a widely used baseline for ...
Jose L. Carles-Bou, Severino F. Galán
openaire +2 more sources
Multiobjectivization with NSGA-ii on the noiseless BBOB testbed [PDF]
The idea of multiobjectivization is to reformulate a single-objective problem as a multiobjective one. In one of the scarce studies proposing this idea for problems in continuous domains, the distance to the closest neighbor (DCN) in the population of a multiobjective algorithm has been used as the additional (dynamic) second objective.
Tran, Thanh-Do +2 more
openaire +2 more sources
Improving NSGA-II with an adaptive mutation operator [PDF]
The performance of a Multiobjective Evolutionary Algorithm (MOEA) is crucially dependent on the parameter setting of the operators. The most desired control of such parameters presents the characteristic of adaptiveness, i.e., the capacity of changing the value of the parameter, in distinct stages of the evolutionary process, using feedbacks from the ...
Arthur Gonçalves Carvalho +1 more
openaire +2 more sources
Automatic configuration of NSGA-II with jMetal and irace [PDF]
Universidad de Málaga. Campus de Excelencia Internacional Andalucía Tech.
Antonio J. Nebro +3 more
openaire +4 more sources
Comparison of multi-objective genetic algorithms for optimization of cascade reservoir systems
Multi-objective genetic algorithms (MOGAs) are widely used for multi-reservoir systems’ optimization due to their high efficiency and fast convergence. However, the computational cost grows exponentially with the expansion of multi-reservoir systems and ...
Manlin Wang +5 more
doaj +1 more source
Analysing the Robustness of NSGA-II under Noise
Runtime analysis has produced many results on the efficiency of simple evolutionary algorithms like the (1+1) EA, and its analogue called GSEMO in evolutionary multiobjective optimisation (EMO). Recently, the first runtime analyses of the famous and highly cited EMO algorithm NSGA-II have emerged, demonstrating that practical algorithms with thousands ...
Duc-Cuong Dang +3 more
openaire +2 more sources
Analysis of NSGA-II and NSGA-II with CDAS, and Proposal of an Enhanced CDAS Mechanism
In this work, we analyze the functionality transition in the evolution process of NSGA-II and an enhanced NSGA-II with the method of controlling dominance area of solutions (CDAS) from the viewpoint of front distribution. We examine the relationship between the population of the first front consisting of non-dominated solutions and the values of two ...
Kyoko Tsuchida +3 more
openaire +1 more source
Improved NSGA-II and its application in BIW structure optimization
Based on the crowding distance algorithm of Non-Dominated Sorting Genetic Algorithm-II (NSGA-II), three improved algorithms are proposed: side length optimization strategy, diagonal optimization strategy, center optimization strategy.
Xiao Wu +5 more
doaj +1 more source
Nanoparticles in drug delivery have been widely studied and have become a potential technique for cancer treatment. Doxorubicin (DOX) and carbon graphene are candidates as a drug and a nanocarrier, respectively, and they can be modified or decorated by ...
Kanes Sumetpipat, Duangkamon Baowan
doaj +1 more source
Computing Offloading Strategy for Concurrent Flow Tasks Based on Two-stage Optimization [PDF]
Recently, computing offloading has attracted the attention of researchers as one of the most critical technologies in mobile edge computing. However, the existing research rarely considers the application topology, diversity of optimization objectives ...
YAO Zheng, WU Huaiyu, CHEN Yang
doaj +1 more source

