A Differential Evolution with Two Mutation Strategies for Linear Bilevel Programming Problems

被引：5

作者：

Li, Hong ^{[1
]}

Zhang, Li ^{[1
]}

机构：

[1] Xidian Univ, Sch Math & Stat, Xian, Peoples R China

来源：

2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS) | 2013年

关键词：

Linear bilevel programming problem; Differential evolution; Constraint handling technique; GENETIC ALGORITHMS; BRANCH;

D O I：

10.1109/CIS.2013.19

中图分类号：

TP18 [人工智能理论];

学科分类号：

140502 [人工智能];

摘要：

An improved constraint handling technique based on a comparison mechanism is presented, and then it is combined with selection operator in differential evolution to fulfill constraint handling and selection simultaneously. A differential evolution with two mutation strategies based on this new constraint handling technique is developed to solve the linear bilevel programming problems. The simulation results show that the proposed algorithm can find global optimal solutions with less computation burden.

引用

收藏

页码：55 / 60

页数：6

相关论文

共 17 条

[1]

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

ANANDALINGAM, G ;

WHITE, DJ .

IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1990, 35 (10) :1170-1173

[2]

New branch-and-cut algorithm for bilevel linear programming [J].

Audet, C. ;

Savard, G. ;

Zghal, W. .

JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2007, 134 (02) :353-370

[3]

A BRANCH AND BOUND ALGORITHM FOR THE BILEVEL PROGRAMMING PROBLEM [J].

BARD, JF ;

MOORE, JT .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1990, 11 (02) :281-292

[4]

Bard Jonathan F, 2013, Practical bilevel optimization: algorithms and applications, V30

[5]

A new approach for solving linear bilevel problems using genetic algorithms [J].

Calvete, Herminia I. ;

Gale, Carmen ;

Mateo, Pedro M. .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 188 (01) :14-28

[6]

Differential Evolution: A Survey of the State-of-the-Art [J].

Das, Swagatam ;

Suganthan, Ponnuthurai Nagaratnam .

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (01) :4-31

[7]

A computational study of global algorithms for linear bilevel programming [J].

de Sabóia, CHM ;

Campêlo, M ;

Scheimberg, S .

NUMERICAL ALGORITHMS, 2004, 35 (2-4) :155-173

[8]

An efficient constraint handling method for genetic algorithms [J].

Deb, K .

COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 2000, 186 (2-4) :311-338

[9]

NEW BRANCH-AND-BOUND RULES FOR LINEAR BILEVEL PROGRAMMING [J].

HANSEN, P ;

JAUMARD, B ;

SAVARD, G .

SIAM JOURNAL ON SCIENTIFIC AND STATISTICAL COMPUTING, 1992, 13 (05) :1194-1217

[10]

Linear bilevel programming solution by genetic algorithm [J].

Hejazi, SR ;

Memariani, A ;

Jahanshahloo, G ;

Sepehri, MM .

COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (13) :1913-1925