By Topic

Improved chromosome encoding for genetic-algorithm-based assembly sequence planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yong-qiang Liang ; Dept. of Math. & Comput. Sci., Yulin Normal Univ., Yulin, China ; Xiao-shu Zhu ; Miao Xie

In order to ensure every feasible assembly sequence is included in the searching space of genetic algorithm, this paper proposes an improved genetic encoding method. In this method, every chromosome is encoded by a permutation of integer. Although the final form of chromosome is the same as the existing form, the decoding process is different. In our decoding process, every permutation of integer is transformed into an ordered set of all edges in the stability-directed graph, and then the ordered set of edges is transform into an ordered set of assembly states. The correctness of this method is proved, the combination of this method and the existing genetic algorithm is discussed, and an example is presented to show the effectiveness of our encoding method.

Published in:

Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on

Date of Conference:

22-24 Oct. 2010