Abstract
Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Pages | 187-196 |
| Number of pages | 10 |
| Volume | 6883 LNAI |
| Edition | PART 3 |
| DOIs | |
| Publication status | Published - 2011 |
| Externally published | Yes |
| Event | 15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011 - Kaiserslautern Duration: 2011 Sep 12 → 2011 Sep 14 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Number | PART 3 |
| Volume | 6883 LNAI |
| ISSN (Print) | 03029743 |
| ISSN (Electronic) | 16113349 |
Other
| Other | 15th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems, KES 2011 |
|---|---|
| City | Kaiserslautern |
| Period | 11/9/12 → 11/9/14 |
Fingerprint
Keywords
- bilevel programming problems
- ergodic branch-and-bound
- logistics distribution centers
- mixed integer programming problems
ASJC Scopus subject areas
- Computer Science(all)
- Theoretical Computer Science
Cite this
Solving bilevel quadratic programming problems and its application. / Yaakob, Shamshul Bahar; Watada, Junzo.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6883 LNAI PART 3. ed. 2011. p. 187-196 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6883 LNAI, No. PART 3).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Solving bilevel quadratic programming problems and its application
AU - Yaakob, Shamshul Bahar
AU - Watada, Junzo
PY - 2011
Y1 - 2011
N2 - Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.
AB - Bilevel programming is a powerful method recently developed to tackle multi variable and double layer programming problems. These problems appear everywhere especially in the industrial, supply-chain management, and marketing programming applications. In this study, a novel approach was proposed to solve the bilevel quadratic programming problems. The proposed approach named ergodic branch-and-bound method, respectively solving small and large variable-space problems. It's perform better accuracy and computing efficiency compared with traditional approaches even when tackling the non-linear (quadratic) bilevel problems which cannot be solved sometimes by the conventional methods. Furthermore, a logistic distribution centres' application was introduced as an example to present our new proposed approach. The application results indicated that the proposed approach is applicable and advantageous.
KW - bilevel programming problems
KW - ergodic branch-and-bound
KW - logistics distribution centers
KW - mixed integer programming problems
UR - http://www.scopus.com/inward/record.url?scp=80053159598&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=80053159598&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-23854-3_20
DO - 10.1007/978-3-642-23854-3_20
M3 - Conference contribution
AN - SCOPUS:80053159598
SN - 9783642238536
VL - 6883 LNAI
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 187
EP - 196
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -