By Topic

A Genetic Algorithm for Multiobjective Bilevel Convex Optimization Problems

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
$33 $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)
Liping Jia ; Sch. of Comput. Sci. & Technol., Xidian Univ., Xi'an, China ; Yuping Wang

Multiobjective bilevel programming problem (MBPP) has a wide field of applications and has been proven to be an NP-hard problem. In this paper, a special multiobjective bilevel convex programming problem (MBCPP) is studied, and it is first transformed into an equivalent single objective bilevel convex programming problem by weighted sum of objectives. Then, for the equivalent problem, we design a scheme for generating weight vectors. Thereafter, a crossover operator and mutation operator are designed. Based on all these, a genetic algorithm called Ga-BCPP is proposed for MBCPP. At last, the simulation is made and the performance of the proposed algorithm is compared with one peer genetic algorithm. The results show that the proposed algorithm is effective.

Published in:

Computational Intelligence and Security, 2009. CIS '09. International Conference on  (Volume:1 )

Date of Conference:

11-14 Dec. 2009