An improved uniform design-based genetic algorithm for multi-objective bilevel convex programming Online publication date: Sat, 06-Feb-2016
by Liping Jia; Yuping Wang; Lei Fan
International Journal of Computational Science and Engineering (IJCSE), Vol. 12, No. 1, 2016
Abstract: Bilevel programming problems have a nested structure in which two optimisation programming problems are involved, one is the constraints of the other. Among bilevel programming problems, multiobjective bilevel programming problems are applicable but seldom studied. In this paper, a multi-objective bilevel convex programming is considered. To deal with this problem effectively, the lower level is transformed into a single optimisation problem by multiplying by a weighted vector. The vector is generated by scheme of uniform design. By designing a pattern of encoding, initial population generation, uniform design-based crossover, mutation, selection operator and fitness function, an improved uniform design-based genetic algorithm is proposed. Numerical experiments are implemented to test the efficiency of the proposed algorithm with the known results.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computational Science and Engineering (IJCSE):
Login with your Inderscience username and 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