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: Research Article
Authors: Nikanjam, Amin | Sharifi, Hadi | Rahmani, Adel T.
Affiliations: School of Computer Engineering, Iran University of Science and Technology, Narmak, Tehran 1684613114, Iran. E-mails: nikanjam@iust.ac.ir, hsharifi@comp.iust.ac.ir, rahmani@iust.ac.ir
Note: [] Corresponding author. E-mail: nikanjam@iust.ac.ir.
Abstract: Detecting multivariate interactions between the variables of a problem is a challenge in traditional genetic algorithms (GAs). This issue has been addressed in the literature as the linkage learning problem. It is widely acknowledged that the success of GA in solving any problem depends on the proper detection of multivariate interactions in the problem. Different approaches have thus been proposed to detect and represent such interactions. Estimation of distribution algorithms (EDAs) are amongst these approaches that have been successfully applied to a wide range of hard optimization problems. They build a model of the problem to detect multivariate interactions, but the model building process is often computationally intensive. In this paper, we propose a new clustering algorithm that turns pair-wise interactions in a dependency structure matrix (DSM) into an interaction model efficiently. The model building process is carried out before the evolutionary algorithm to save computational burden. The accurate interaction model obtained in this way is then used to perform an effective recombination of building blocks (BBs) in the GA. We applied the proposed approach to solve exemplar hard optimization problems with different types of linkages to show the effectiveness and efficiency of the proposed approach. Theoretical analysis and experiments showed that the building of an accurate model requires O(nlog (n)) number of fitness evaluations. The comparison of the proposed approach with some existing algorithms revealed that the efficiency of the model building process is enhanced significantly.
Keywords: Estimation of distribution algorithm, model building, linkage learning, dependency structure matrix
DOI: 10.3233/AIC-2011-0498
Journal: AI Communications, vol. 24, no. 3, pp. 213-231, 2011
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