By Topic

Engineering Case Studies Using Parameterless Penalty Non-dominated Ranked Genetic Algorithm

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

6 Author(s)
Al Jadaan, O. ; CSE Dept., EC, Osmania Univ., Hyderabad, India ; Jabas, A. ; Abdula, W. ; Rajamani, L.
more authors

The new elitist multi-objective genetic algorithm PPNRGA have been used for solving engineering design problems with multiple objectives. Although there exists a number of classical techniques, evolutionary algorithms (EAs) have an edge over the classical methods where they can find multiple Pareto optimal solutions in one single simulation run. The new proposed algorithm is a parameterless penalty non-dominated ranking GA (PP-NRGA), uses a fast non-dominated sorting procedure, an elitist-preserving approach, a two tier ranked based roulette wheel selection operator, and it does not require fixing any niching parameter. PP-NRGA tested on two engineering design problems borrowed from the literature, where the PP-NRGA can find a much wider spread of solutions than NSGA-II other evolutionary algorithm. The results are encouraging and suggests immediate application of the proposed method to other more complex engineering design problems.

Published in:

Computational Intelligence, Communication Systems and Networks, 2009. CICSYN '09. First International Conference on

Date of Conference:

23-25 July 2009