Loading...
Please wait, while we are loading the content...
Similar Documents
A Genetic Approach for Solving Bi-Level Programming Problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hosseini, Eghbal Kamalabadi, I. I. Nakhai |
| Copyright Year | 2013 |
| Abstract | The bi-level programming problem (BLPP) however theoretically is interested by many researchers but in recent years it is known as a suitable method for solving the real and complex problems in applicable areas. There are several forms of the BLPP as an NP-hard problem. The literature shows a few attempts for using meta-heuristic algorithms and in this paper we show an effective method based on genetic algorithm (GA) for solving such problems. To obtain efficient upper bounds and lower bounds we use the Karush -Kuhn -Tucker (KKT) conditions for transforming the BLPP into single level problem. Thus by using the proposed GA, the single problems are solved. The proposed approach achieves ficient and feasible solutions and they are evaluated by comparing with references and test problems. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://camo.ici.ro/journal/vol15/v15c13.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
