Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
2019
DOI: 10.1109/access.2019.2894726
|View full text |Cite
|
Sign up to set email alerts
|

A Novel Double-Strand DNA Genetic Algorithm for Multi-Objective Optimization

Abstract: Multi-objective optimization is important for many businesses, science, and engineering applications. Existing evolutionary algorithms for multi-objective optimization problems based on single chain encoding still have difficulties in obtaining high-quality results. This paper presents a new DNA genetic algorithm that uses a novel double-strand DNA encoding, a set of new genetic operators, and two new ranking criteria to obtain solutions that closely approximate the Pareto-optimal front. The extensive experime… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 36 publications
(53 reference statements)
0
3
0
Order By: Relevance
“…GAs work through its fundamental operators of selection, crossover, and mutation for reproduction of the new population of candidate solution at each step increment in generations. The generic workflow of GAs operations is illustrated in Figure 3, while further necessary details of processing blocks can be seen in [38,39]. Many constrained and unconstrained nonlinear optimization problems are effectively addressed with competency of GAs such as optimization in filter designing [40], life prediction of supercapacitors [41], salesman problem [42], multiaccess edge computing [43], and multiobjective optimization [44].…”
Section: Design Methodologymentioning
confidence: 99%
“…GAs work through its fundamental operators of selection, crossover, and mutation for reproduction of the new population of candidate solution at each step increment in generations. The generic workflow of GAs operations is illustrated in Figure 3, while further necessary details of processing blocks can be seen in [38,39]. Many constrained and unconstrained nonlinear optimization problems are effectively addressed with competency of GAs such as optimization in filter designing [40], life prediction of supercapacitors [41], salesman problem [42], multiaccess edge computing [43], and multiobjective optimization [44].…”
Section: Design Methodologymentioning
confidence: 99%
“…The performance of the multi-objective clustering algorithm depends critically on the clustering objectives. In this paper, we choose the FCM objective function J FCM [11] and fuzzy separation S FCM [24] as the two clustering objectives. The definition of J FCM is given in Eq.(1).…”
Section: Objective Functions Of Multi-objective Clusteringmentioning
confidence: 99%
“…Each antibody s i in S needs to be reproduced with q i times. First, the variant crowding distance (VCD) [24] of each active antibody is calculated. Then, the active antibody with higher VCD has a larger q i for enhancing local search around the active antibody.…”
Section: B Grid-based Selection Of Active Antibodiesmentioning
confidence: 99%