.png){kind=icon}
返回
A genetic algorithm for solving linear fractional bilevel problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-008-0416-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bilevel programming has been proposed for dealing with decision processes involving two decision makers with a hierarchical structure. They are characterized by the existence of two optimization problems in which the constraint region of the upper level problem is implicitly determined by the lower level optimization problem. In this paper a genetic algorithm is proposed for the class of bilevel problems in which both level objective functions are linear fractional and the common constraint region is a bounded polyhedron. The algorithm associates chromosomes with extreme points of the polyhedron and searches for a feasible solution close to the optimal solution by proposing efficient crossover and mutation procedures. The computational study shows a good performance of the algorithm, both in terms of solution quality and computational time.
Keyword:
Bilevel programming
Genetic algorithm
Extreme point
Linear fractional
期刊
IF:
4.5
论文数:
8.0K
被引数:
2.1W
机构
引用论文
Laser-Induced Breakdown Spectroscopy (LIBS) Analysis of Calcium Ions Dissolved in Water Using Filter Paper Substrates: An Ideal Internal Standard for Precision Improvement使用滤纸基底对溶解在水中的钙离子进行激光诱导击穿光谱 (LIBS) 分析: 提高精度的理想内标
PREAI
分享收藏Quantitative assessment of circulatory changes in the fetal aortic isthmus during progressive increase of resistance to umbilical blood flow..png)
Circulation
OAAI
CirculationIF0
OAAI分享收藏
查看更多内容