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.