Interactive genetic algorithm based on accelerating convergent mutation strategy

Yong Qing Huang; Chang Yong Liang; Shan Lin Yang; Qing Lu

Interactive genetic algorithm based on accelerating convergent mutation strategy

Yong Qing Huang
, Chang Yong Liang
, Shan Lin Yang
, Qing Lu

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Based on introduction of a novel mutation strategy, a new interactive genetic algorithm was proposed aiming on inefficient searching ability and local optimization of current interactive genetic algorithm caused by using a small population size and a few generations. The issues to implement were proposed. The efficiency of the proposed algorithm was analyzed. The simulation of function optimization and fashion design indicates the mutation strategy and the algorithm is effective.

Original language	English
Pages (from-to)	1913-1916
Number of pages	4
Journal	Xitong Fangzhen Xuebao / Journal of System Simulation
Volume	19
Issue number	9
State	Published - 5 May 2007
Externally published	Yes

Keywords

Fashion design
Human fatigue
Interactive genetic algorithm
Mutation

Cite this

@article{cf05ea9a46114be18f5dad5338d0ae1a,

title = "Interactive genetic algorithm based on accelerating convergent mutation strategy",

abstract = "Based on introduction of a novel mutation strategy, a new interactive genetic algorithm was proposed aiming on inefficient searching ability and local optimization of current interactive genetic algorithm caused by using a small population size and a few generations. The issues to implement were proposed. The efficiency of the proposed algorithm was analyzed. The simulation of function optimization and fashion design indicates the mutation strategy and the algorithm is effective.",

keywords = "Fashion design, Human fatigue, Interactive genetic algorithm, Mutation",

author = "Huang, \{Yong Qing\} and Liang, \{Chang Yong\} and Yang, \{Shan Lin\} and Qing Lu",

year = "2007",

month = may,

day = "5",

language = "英语",

volume = "19",

pages = "1913--1916",

journal = "Xitong Fangzhen Xuebao / Journal of System Simulation",

issn = "1004-731X",

publisher = "Acta Simulata Systematica Sinica",

number = "9",

}

TY - JOUR

T1 - Interactive genetic algorithm based on accelerating convergent mutation strategy

AU - Huang, Yong Qing

AU - Liang, Chang Yong

AU - Yang, Shan Lin

AU - Lu, Qing

PY - 2007/5/5

Y1 - 2007/5/5

N2 - Based on introduction of a novel mutation strategy, a new interactive genetic algorithm was proposed aiming on inefficient searching ability and local optimization of current interactive genetic algorithm caused by using a small population size and a few generations. The issues to implement were proposed. The efficiency of the proposed algorithm was analyzed. The simulation of function optimization and fashion design indicates the mutation strategy and the algorithm is effective.

AB - Based on introduction of a novel mutation strategy, a new interactive genetic algorithm was proposed aiming on inefficient searching ability and local optimization of current interactive genetic algorithm caused by using a small population size and a few generations. The issues to implement were proposed. The efficiency of the proposed algorithm was analyzed. The simulation of function optimization and fashion design indicates the mutation strategy and the algorithm is effective.

KW - Fashion design

KW - Human fatigue

KW - Interactive genetic algorithm

KW - Mutation

UR - https://www.scopus.com/pages/publications/34248670149

M3 - 文章

AN - SCOPUS:34248670149

SN - 1004-731X

VL - 19

SP - 1913

EP - 1916

JO - Xitong Fangzhen Xuebao / Journal of System Simulation

JF - Xitong Fangzhen Xuebao / Journal of System Simulation

IS - 9

ER -

Interactive genetic algorithm based on accelerating convergent mutation strategy

Abstract

Keywords

Other files and links

Fingerprint

Cite this