By Topic

ODMA: A new metaheuristic optimization algorithm based on open source development model

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

4 Author(s)
Hajipour, H. ; Comput. Eng. Dept., Persian Gulf Univ. of Bushehr, Bushehr, Iran ; BehzadiKhourmuji, H. ; Rostami, H. ; Oskouei, R.J.

In this paper we intend to formulate a new metahueristic algorithm, called Open Source Development Model Algorithm (ODMA), for solving optimization problem. This algorithm inspired by open source development model and communities, In such way that each potential solution considered to be a software and by evolution the softwares, we search for better solutions to the function that should be optimized. The algorithm has two phases, initial phase and evolution phase. The evolution phase consist of moving to leading software, evolution of leading softwares is based on their history and forking from the leading softwares. We validate the proposed algorithm against benchmark function and then compare its performance with both of GA and PSO algorithms And according to results, we can see that the ODMA is much more efficient in finding the global optima and better accuracy than GA and PSO.

Note: As originally published there is an error in the article title: 'Metaheuristic' should be read instead of 'Metahueristic.' The metadata has been updated but the PDF file remains unchanged.  

Published in:

Intelligent Systems Design and Applications (ISDA), 2012 12th International Conference on

Date of Conference:

27-29 Nov. 2012