Linear bilevel programming solution by genetic algorithm

Linear bilevel programming solution by genetic algorithm

0.00 Avg rating0 Votes
Article ID: iaor2003391
Country: United Kingdom
Volume: 29
Issue: 13
Start Page Number: 1913
End Page Number: 1925
Publication Date: Nov 2002
Journal: Computers and Operations Research
Authors: , , ,
Keywords: heuristics
Abstract:

Bilevel programming, a tool for modeling decentralized decisions, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be NP-hard problem. Numerous algorithms have been developed so far for solving bilevel programming problem. In this paper, an attempt has been made to develop an efficient approach based on genetic algorithm. The efficiency of the algorithm is ascertained by comparing the results with Gendreau et al. method.

Reviews

Required fields are marked *. Your email address will not be published.