DNA Computing Based Multi-objective Genetic Algorithm

Jili Tao (), Ridong Zhang () and Yong Zhu ()
Additional contact information
Jili Tao: NingboTech University, School of Information Science and Engineering
Ridong Zhang: Hangzhou Dianzi University, The Belt and Road Information Research Institute
Yong Zhu: NingboTech University, School of Information Science and Engineering

Chapter Chapter 4 in DNA Computing Based Genetic Algorithm, 2020, pp 81-100 from Springer

Abstract: Abstract In this chapter, DNA computing based non-dominated sorting genetic algorithm is described for solving the multi-objective optimization problems. First, the inconsistent multi-objective functions are converted into Pareto rank value and density information of solution distribution. Then, the archive is introduced to keep the Pareto front individuals by Pareto sorting, and the maintaining scheme is executed to maintain the evenness of individual distribution in terms of individual crowding measuring.

Date: 2020
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-981-15-5403-2_4

Ordering information: This item can be ordered from
http://www.springer.com/9789811554032

DOI: 10.1007/978-981-15-5403-2_4

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().