A Computational Method Based on Adaptive Genetic Algorithm for Bilevel Linear Programming
Bilevel programming is a useful tool for modeling decentralized decisions with hierarchical structure.So,many methods are proposed to solve this problem.And the genetic algorithm is an alternative to conventional approaches to find solution to the bilevel programming.In this paper,the performance of this proposed algorithm is illustrated by the randomly generating examples after describing the steps of the adaptive genetic algorithm for solving the bilevel linear programming problem to overcome the difficulty of determining the probabilities of crossover and mutation.
bilevel linear programming genetic algorithm fitness value adaptive operator probabilities crossover and mutation
Guangmin Wang Zhongping Wan Xianjia Wang
School of Economics and Management,China University of Geosciences,China School of Mathematics and Statistics,Wuhan University,China Systems Engineering Institute,Wuhan University,China
国际会议
长沙
英文
1041-1048
2008-10-28(万方平台首次上网日期,不代表论文的发表时间)