Changing range genetic algorithm for multimodal function optimisation
by Adil Amirjanov; Konstantin Sobolev
International Journal of Bio-Inspired Computation (IJBIC), Vol. 7, No. 4, 2015

Abstract: The performance of a sequential changing range genetic algorithm (SCRGA) is described. This algorithm enables the transformation of an unconstrained numerical optimisation problem to a constrained problem by implementing constraints which convert the area near previously found optima to an infeasible region. This SCRGA feature is used for locating all optima of unconstrained and constrained numerical optimisation problems. Several test cases, related to unconstrained and constrained numerical optimisation problems, demonstrate the ability of this approach to reduce the computational costs, significantly improving success rates, accurately and precisely locating all optimal solutions.

Online publication date: Tue, 11-Aug-2015

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com