.png){kind=icon}
Return
Linear bilevel programming solution by genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(01)00066-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
optimization
bilevel programming
genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
No organization information available
Cited Papers
ShareSaveExtraction of zinc chloro complexes by high molecular weight amines and quaternary ammonium salts
PREAI
ShareSaveShareSave
ShareSaveShareSaveThe effect of maternal haematocrit on offspring IQ at 4 and 7 years of age: a secondary analysis
PREAI
ShareSaveEnhanced electrochemical response of a modified glassy carbon electrode by poly(2-vinlypyridine-b-methyl methacrylate) conjugated gold nanoparticles for detection of nicotine.png)
RSC Advances
OAAI
RSC AdvancesIF0
OAAIShareSaveShareSave
View more