By Topic

Computationally effective search and optimization procedure using coarse to fine approximations

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

2 Author(s)
Nain, P.K.S. ; Kanpur Genetic Algorithms Lab., Indian Inst. of Technol., Kanpur, India ; Deb, K.

This paper presents a concept of combining genetic algorithms (GAs) with an approximate evaluation technique to achieve a computationally effective search and optimization procedure. The major objective of this work is to enable the use of GAs on computationally expensive problems, while retaining their basic robust search capabilities. Starting with a coarse approximation model of the problems, GAs successively use finer models, thereby allowing the proposed algorithm to find the optimal or a near-optimal solution of computationally expensive problems faster. A general methodology is proposed for combining any approximating technique with GA. The proposed methodology is also tested in conjunction with one particular approximating technique, namely the artificial neural network, on a B-spline curve fitting problem successfully. Savings in the exact function evaluation up to 32% are achieved. The computational advantage demonstrated here should encourage the use of the proposed approach to more complex and computationally demanding real-world problems.

Published in:

Evolutionary Computation, 2003. CEC '03. The 2003 Congress on  (Volume:3 )

Date of Conference:

8-12 Dec. 2003