Linear bilevel programming solution by genetic algorithm

被引：138

作者：

Hejazi, SR

Memariani, A

Jahanshahloo, G

Sepehri, MM

机构：

[1] Tarbiat Modarres Univ, Dept Ind Engn, Tehran 4838, Iran

[2] Teacher Training Univ, Dept Math, Tehran, Iran

来源：

COMPUTERS & OPERATIONS RESEARCH | 2002年 / 29卷 / 13期

关键词：

optimization; bilevel programming; genetic algorithm;

D O I：

10.1016/S0305-0548(01)00066-1

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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. (J. Global Optimization 8 (1996) 217-233) method.

引用

页码：1913 / 1925

页数：13

共 22 条

[1] A SOLUTION METHOD FOR THE LINEAR STATIC STACKELBERG PROBLEM USING PENALTY-FUNCTIONS [J].