Work place: Dept. of Computer Engineering and Information Technology, Amirkabir University of Technology, Tehran, Iran
E-mail: mmeybodi@aut.ac.ir
Website:
Research Interests: Software Creation and Management, Computer systems and computational processes, Computational Learning Theory, Systems Architecture, Computer Networks, Parallel Computing
Biography
Mohammad Reza Meybodi received the B. Sc. and M. Sc. degrees in economics from Shahid Beheshti University in Iran, in 1973 and 1977, respectively. He also received the M. Sc. and Ph.D. degrees in computer science from Oklahoma University,
USA, in 1980 and 1983, respectively. Currently, he is a Full Professor in Computer Engineering Department, Amirkabir University of Technology, Tehran, Iran. Prior to current position, he worked as an Assistant Professor at Western Michigan University (1983 to 1985), as an Associate Professor at Ohio University, USA (1985 to 1991). His research interests include wireless networks, fault tolerant systems, learning systems, parallel algorithms, soft computing and software development.
By Helena Bahrami Marjan Abdechiri Mohammad Reza Meybodi
DOI: https://doi.org/10.5815/ijisa.2012.02.06, Pub. Date: 8 Mar. 2012
The novel Imperialist Competitive Algorithm (ICA) that was recently introduced has a good performance in some optimization problems. The ICA inspired by socio-political process of imperialistic competition of human being in the real world. In this paper, a new Imperialist Competitive Algorithm with Adaptive Radius of Colonies movement (ICAR) is proposed. In the proposed algorithm, for an effective search, the Absorption Policy changed dynamically to adapt the radius of colonies movement towards imperialist’s position. The ICA is easily stuck into a local optimum when solves high-dimensional multi-modal numerical optimization problems. To overcome this shortcoming, we use probabilistic model that utilize the information of colonies positions to balance the exploration and exploitation abilities of the Imperialist Competitive Algorithm. Using this mechanism, ICA exploration capability will enhance. Some famous unconstraint benchmark functions used to test the ICAR performance. Simulation results show this strategy can improve the performance of the ICA algorithm significantly.
[...] Read more.Subscribe to receive issue release notifications and newsletters from MECS Press journals