Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Other
Authors: Sivaraj, R.
Affiliations: Velalar College of Engineering and Technology, Erode, Tamil Nadu, India. E-mail: rsivarajcse@gmail.com
Abstract: Genetic algorithms are commonly used in many types of applications. Yet they suffer from longer execution time and premature convergence. To improve both these factors, the research work proposes two new procedural modifications in the basic genetic algorithm procedure and a new population initialization mechanism. The proposed algorithms are implemented in two types of real world problems of different sizes and the results confirm the superiority of the algorithms over existing ones both in terms of execution time and optimality.
Keywords: Clustering genetic algorithm, gene grouping genetic algorithm, selective initialization
DOI: 10.3233/AIC-150661
Journal: AI Communications, vol. 29, no. 4, pp. 545-546, 2016
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl