A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization

Kazi Shah Nawaz RIPON; Sam KWONG; K. F. MAN

doi:10.1016/j.ins.2006.07.019

A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization

Kazi Shah Nawaz RIPON, Sam KWONG, K. F. MAN

Research output: Journal Publications › Journal Article (refereed) › peer-review

136 Citations (Scopus)

Abstract

This paper presents a real jumping gene genetic algorithm (RJGGA) as an enhancement of the jumping gene genetic algorithm (JGGA) [T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, A jumping gene algorithm for multiobjective resource management in wideband CDMA systems, The Computer Journal 48 (6) (2005) 749-768; T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, Multiobjective optimization of radio-to-fiber repeater placement using a jumping gene algorithm, in: Proceedings of the IEEE International Conference on Industrial Technology (ICIT 2005), Hong Kong, 2005, pp. 291-296; K.F. Man, T.M. Chan, K.S. Tang, S. Kwong, Jumping-genes in evolutionary computing, in: Proceedings of the IEEE IECON'2004, Busan, 2004, pp. 1268-1272]. JGGA is a relatively new multiobjective evolutionary algorithm (MOEA) that imitates a jumping gene phenomenon discovered by Nobel Laureate McClintock during her work on the corn plants. The main feature of JGGA is that it only has a simple operation in which a transposition of gene(s) is induced within the same or another chromosome in the genetic algorithm (GA) framework. In its initial formulation, the search space solutions are binary-coded and it inherits the customary problems of conventional binary-coded GA (BCGA). This issue motivated us to remodel the JGGA into RJGGA. The performance of RJGGA has been compared to other MOEAs using some carefully chosen benchmark test functions. It has been observed that RJGGA is able to generate non-dominated solutions with a wider spread along the Pareto-optimal front and better address the issues regarding convergence and diversity in multiobjective optimization. © 2006 Elsevier Inc. All rights reserved.

Original language	English
Pages (from-to)	632-654
Journal	Information Sciences
Volume	177
Issue number	2
DOIs	https://doi.org/10.1016/j.ins.2006.07.019
Publication status	Published - 15 Jan 2007
Externally published	Yes

Bibliographical note

The authors wish to thank Prof. Brian Ralph of Brunel University for his feedback. His comments helped us to substantially improve the quality of this paper and to make it more readable. We also gratefully acknowledge the support from City University Strategic Grant 7001955.

Keywords

Benchmark test functions
Binary-coding
Jumping gene genetic algorithm
Jumping genes
Multiobjective evolutionary algorithms
Performance metrics
Real-coding

Access to Document

10.1016/j.ins.2006.07.019

Cite this

@article{3959da43386a425b8a4628d7a387fe58,

title = "A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization",

abstract = "This paper presents a real jumping gene genetic algorithm (RJGGA) as an enhancement of the jumping gene genetic algorithm (JGGA) [T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, A jumping gene algorithm for multiobjective resource management in wideband CDMA systems, The Computer Journal 48 (6) (2005) 749-768; T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, Multiobjective optimization of radio-to-fiber repeater placement using a jumping gene algorithm, in: Proceedings of the IEEE International Conference on Industrial Technology (ICIT 2005), Hong Kong, 2005, pp. 291-296; K.F. Man, T.M. Chan, K.S. Tang, S. Kwong, Jumping-genes in evolutionary computing, in: Proceedings of the IEEE IECON'2004, Busan, 2004, pp. 1268-1272]. JGGA is a relatively new multiobjective evolutionary algorithm (MOEA) that imitates a jumping gene phenomenon discovered by Nobel Laureate McClintock during her work on the corn plants. The main feature of JGGA is that it only has a simple operation in which a transposition of gene(s) is induced within the same or another chromosome in the genetic algorithm (GA) framework. In its initial formulation, the search space solutions are binary-coded and it inherits the customary problems of conventional binary-coded GA (BCGA). This issue motivated us to remodel the JGGA into RJGGA. The performance of RJGGA has been compared to other MOEAs using some carefully chosen benchmark test functions. It has been observed that RJGGA is able to generate non-dominated solutions with a wider spread along the Pareto-optimal front and better address the issues regarding convergence and diversity in multiobjective optimization. {\textcopyright} 2006 Elsevier Inc. All rights reserved.",

keywords = "Benchmark test functions, Binary-coding, Jumping gene genetic algorithm, Jumping genes, Multiobjective evolutionary algorithms, Performance metrics, Real-coding",

author = "RIPON, {Kazi Shah Nawaz} and Sam KWONG and MAN, {K. F.}",

note = "The authors wish to thank Prof. Brian Ralph of Brunel University for his feedback. His comments helped us to substantially improve the quality of this paper and to make it more readable. We also gratefully acknowledge the support from City University Strategic Grant 7001955.",

year = "2007",

month = jan,

day = "15",

doi = "10.1016/j.ins.2006.07.019",

language = "English",

volume = "177",

pages = "632--654",

journal = "Information Sciences",

issn = "0020-0255",

publisher = "Elsevier Inc.",

number = "2",

}

TY - JOUR

T1 - A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization

AU - RIPON, Kazi Shah Nawaz

AU - KWONG, Sam

AU - MAN, K. F.

N1 - The authors wish to thank Prof. Brian Ralph of Brunel University for his feedback. His comments helped us to substantially improve the quality of this paper and to make it more readable. We also gratefully acknowledge the support from City University Strategic Grant 7001955.

PY - 2007/1/15

Y1 - 2007/1/15

N2 - This paper presents a real jumping gene genetic algorithm (RJGGA) as an enhancement of the jumping gene genetic algorithm (JGGA) [T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, A jumping gene algorithm for multiobjective resource management in wideband CDMA systems, The Computer Journal 48 (6) (2005) 749-768; T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, Multiobjective optimization of radio-to-fiber repeater placement using a jumping gene algorithm, in: Proceedings of the IEEE International Conference on Industrial Technology (ICIT 2005), Hong Kong, 2005, pp. 291-296; K.F. Man, T.M. Chan, K.S. Tang, S. Kwong, Jumping-genes in evolutionary computing, in: Proceedings of the IEEE IECON'2004, Busan, 2004, pp. 1268-1272]. JGGA is a relatively new multiobjective evolutionary algorithm (MOEA) that imitates a jumping gene phenomenon discovered by Nobel Laureate McClintock during her work on the corn plants. The main feature of JGGA is that it only has a simple operation in which a transposition of gene(s) is induced within the same or another chromosome in the genetic algorithm (GA) framework. In its initial formulation, the search space solutions are binary-coded and it inherits the customary problems of conventional binary-coded GA (BCGA). This issue motivated us to remodel the JGGA into RJGGA. The performance of RJGGA has been compared to other MOEAs using some carefully chosen benchmark test functions. It has been observed that RJGGA is able to generate non-dominated solutions with a wider spread along the Pareto-optimal front and better address the issues regarding convergence and diversity in multiobjective optimization. © 2006 Elsevier Inc. All rights reserved.

AB - This paper presents a real jumping gene genetic algorithm (RJGGA) as an enhancement of the jumping gene genetic algorithm (JGGA) [T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, A jumping gene algorithm for multiobjective resource management in wideband CDMA systems, The Computer Journal 48 (6) (2005) 749-768; T.M. Chan, K.F. Man, K.S. Tang, S. Kwong, Multiobjective optimization of radio-to-fiber repeater placement using a jumping gene algorithm, in: Proceedings of the IEEE International Conference on Industrial Technology (ICIT 2005), Hong Kong, 2005, pp. 291-296; K.F. Man, T.M. Chan, K.S. Tang, S. Kwong, Jumping-genes in evolutionary computing, in: Proceedings of the IEEE IECON'2004, Busan, 2004, pp. 1268-1272]. JGGA is a relatively new multiobjective evolutionary algorithm (MOEA) that imitates a jumping gene phenomenon discovered by Nobel Laureate McClintock during her work on the corn plants. The main feature of JGGA is that it only has a simple operation in which a transposition of gene(s) is induced within the same or another chromosome in the genetic algorithm (GA) framework. In its initial formulation, the search space solutions are binary-coded and it inherits the customary problems of conventional binary-coded GA (BCGA). This issue motivated us to remodel the JGGA into RJGGA. The performance of RJGGA has been compared to other MOEAs using some carefully chosen benchmark test functions. It has been observed that RJGGA is able to generate non-dominated solutions with a wider spread along the Pareto-optimal front and better address the issues regarding convergence and diversity in multiobjective optimization. © 2006 Elsevier Inc. All rights reserved.

KW - Benchmark test functions

KW - Binary-coding

KW - Jumping gene genetic algorithm

KW - Jumping genes

KW - Multiobjective evolutionary algorithms

KW - Performance metrics

KW - Real-coding

UR - http://www.scopus.com/inward/record.url?scp=33750291345&partnerID=8YFLogxK

U2 - 10.1016/j.ins.2006.07.019

DO - 10.1016/j.ins.2006.07.019

M3 - Journal Article (refereed)

SN - 0020-0255

VL - 177

SP - 632

EP - 654

JO - Information Sciences

JF - Information Sciences

IS - 2

ER -

A real-coding jumping gene genetic algorithm (RJGGA) for multiobjective optimization

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this