IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v235y2015i1p543-55810.1007-s10479-015-1878-5.html
   My bibliography  Save this article

A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems

Author

Listed:
  • Hecheng Li

Abstract

The bilevel programming problem is strongly NP-hard and non-convex, which implies that the problem is very challenging for most canonical optimization approaches using single-point search techniques to find global optima. In the present paper, a class of nonlinear bilevel programming problems are considered where the follower is a linear fractional program. Based on a novel coding scheme, a genetic algorithm with global convergence was developed. First, potential bases of the follower’s problem were taken as individuals, and a genetic algorithm was used to explore these bases. In addition, in order to evaluate each individual, a fitness function was presented by making use of the optimality conditions of linear fractional programs. Also, the fitness evaluation, as a sub-procedure of optimization, can partly improve the leader’s objective. Finally, some computational examples were solved and the results show that the proposed algorithm is efficient and robust. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Hecheng Li, 2015. "A genetic algorithm using a finite search space for solving nonlinear/linear fractional bilevel programming problems," Annals of Operations Research, Springer, vol. 235(1), pages 543-558, December.
    • Handle: RePEc:spr:annopr:v:235:y:2015:i:1:p:543-558:10.1007/s10479-015-1878-5
    DOI: 10.1007/s10479-015-1878-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-1878-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-1878-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bard, Jonathan F. & Plummer, John & Claude Sourie, Jean, 2000. "A bilevel programming approach to determining tax credits for biofuel production," European Journal of Operational Research, Elsevier, vol. 120(1), pages 30-46, January.
    2. Zeynep Gümüş & Christodoulos Floudas, 2005. "Global optimization of mixed-integer bilevel programming problems," Computational Management Science, Springer, vol. 2(3), pages 181-212, July.
    3. Calvete, Herminia I. & Gale, Carmen & Mateo, Pedro M., 2008. "A new approach for solving linear bilevel problems using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 188(1), pages 14-28, July.
    4. Herminia Calvete & Carmen Galé & Pedro Mateo, 2009. "A genetic algorithm for solving linear fractional bilevel problems," Annals of Operations Research, Springer, vol. 166(1), pages 39-56, February.
    5. Yuping Wang & Hong Li & Chuangyin Dang, 2011. "A New Evolutionary Algorithm for a Class of Nonlinear Bilevel Programming Problems and Its Global Convergence," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 618-629, November.
    6. Abou-Kandil, H. & Bertrand, P., 1987. "Government-private sector relations as a stackelberg game: A degenerate case," Journal of Economic Dynamics and Control, Elsevier, vol. 11(4), pages 513-517, December.
    7. Ayalew Mersha & Stephan Dempe, 2011. "Direct search algorithm for bilevel programming problems," Computational Optimization and Applications, Springer, vol. 49(1), pages 1-15, May.
    8. H. I. Calvete & C. Galé, 1998. "On the Quasiconcave Bilevel Programming Problem," Journal of Optimization Theory and Applications, Springer, vol. 98(3), pages 613-622, September.
    9. Benoît Colson & Patrice Marcotte & Gilles Savard, 2007. "An overview of bilevel optimization," Annals of Operations Research, Springer, vol. 153(1), pages 235-256, September.
    10. J. Glackin & J. G. Ecker & M. Kupferschmid, 2009. "Solving Bilevel Linear Programs Using Multiple Objective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 140(2), pages 197-212, February.
    11. R. Andreani & S. Castro & J. Chela & A. Friedlander & S. Santos, 2009. "An inexact-restoration method for nonlinear bilevel programming problems," Computational Optimization and Applications, Springer, vol. 43(3), pages 307-328, July.
    12. S. Dempe & A. Zemkoho, 2012. "Bilevel road pricing: theoretical analysis and optimality conditions," Annals of Operations Research, Springer, vol. 196(1), pages 223-240, July.
    13. Ben-Ayed, Omar & Boyce, David E. & Blair, Charles E., 1988. "A general bilevel linear programming formulation of the network design problem," Transportation Research Part B: Methodological, Elsevier, vol. 22(4), pages 311-318, August.
    14. Jean Etoa, 2010. "Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm," Journal of Global Optimization, Springer, vol. 47(4), pages 615-637, August.
    15. Kanti Swarup, 1965. "Letter to the Editor—Linear Fractional Functionals Programming," Operations Research, INFORMS, vol. 13(6), pages 1029-1036, December.
    16. Yohan Shim & Marte Fodstad & Steven Gabriel & Asgeir Tomasgard, 2013. "A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints," Annals of Operations Research, Springer, vol. 210(1), pages 5-31, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ankur Sinha & Zhichao Lu & Kalyanmoy Deb & Pekka Malo, 2020. "Bilevel optimization based on iterative approximation of multiple mappings," Journal of Heuristics, Springer, vol. 26(2), pages 151-185, April.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ashenafi Woldemariam & Semu Kassa, 2015. "Systematic evolutionary algorithm for general multilevel Stackelberg problems with bounded decision variables (SEAMSP)," Annals of Operations Research, Springer, vol. 229(1), pages 771-790, June.
    2. Sinha, Ankur & Malo, Pekka & Deb, Kalyanmoy, 2017. "Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping," European Journal of Operational Research, Elsevier, vol. 257(2), pages 395-411.
    3. Zhao, Laijun & Li, Changmin & Huang, Rongbing & Si, Steven & Xue, Jian & Huang, Wei & Hu, Yue, 2013. "Harmonizing model with transfer tax on water pollution across regional boundaries in a China’s lake basin," European Journal of Operational Research, Elsevier, vol. 225(2), pages 377-382.
    4. Jean Etoa, 2010. "Solving convex quadratic bilevel programming problems using an enumeration sequential quadratic programming algorithm," Journal of Global Optimization, Springer, vol. 47(4), pages 615-637, August.
    5. Yogendra Pandey & S. K. Mishra, 2018. "Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators," Annals of Operations Research, Springer, vol. 269(1), pages 549-564, October.
    6. R. Paulavičius & C. S. Adjiman, 2020. "New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm," Journal of Global Optimization, Springer, vol. 77(2), pages 197-225, June.
    7. Martin Weibelzahl & Alexandra Märtz, 2020. "Optimal storage and transmission investments in a bilevel electricity market model," Annals of Operations Research, Springer, vol. 287(2), pages 911-940, April.
    8. Lei Fang & Hecheng Li, 2013. "Lower bound of cost efficiency measure in DEA with incomplete price information," Journal of Productivity Analysis, Springer, vol. 40(2), pages 219-226, October.
    9. Küçükaydin, Hande & Aras, Necati & Kuban AltInel, I., 2011. "Competitive facility location problem with attractiveness adjustment of the follower: A bilevel programming model and its solution," European Journal of Operational Research, Elsevier, vol. 208(3), pages 206-220, February.
    10. Lv, Chengwei & Xu, Jiuping & Xie, Heping & Zeng, Ziqiang & Wu, Yimin, 2016. "Equilibrium strategy based coal blending method for combined carbon and PM10 emissions reductions," Applied Energy, Elsevier, vol. 183(C), pages 1035-1052.
    11. Juan S. Borrero & Oleg A. Prokopyev & Denis Sauré, 2019. "Sequential Interdiction with Incomplete Information and Learning," Operations Research, INFORMS, vol. 67(1), pages 72-89, January.
    12. Bo Zeng, 2020. "A Practical Scheme to Compute the Pessimistic Bilevel Optimization Problem," INFORMS Journal on Computing, INFORMS, vol. 32(4), pages 1128-1142, October.
    13. Yemshanov, Denys & Haight, Robert G. & MacQuarrie, Chris J.K. & Simpson, Mackenzie & Koch, Frank H. & Ryan, Kathleen & Bullas-Appleton, Erin, 2022. "Hierarchical governance in invasive species survey campaigns," Ecological Economics, Elsevier, vol. 201(C).
    14. Liming Zhang & Wei Yang & Yuan Yuan & Rui Zhou, 2017. "An Integrated Carbon Policy-Based Interactive Strategy for Carbon Reduction and Economic Development in a Construction Material Supply Chain," Sustainability, MDPI, vol. 9(11), pages 1-15, November.
    15. Gaoxi Li & Zhongping Wan, 2018. "On Bilevel Programs with a Convex Lower-Level Problem Violating Slater’s Constraint Qualification," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 820-837, December.
    16. Herminia Calvete & Carmen Galé & Pedro Mateo, 2009. "A genetic algorithm for solving linear fractional bilevel problems," Annals of Operations Research, Springer, vol. 166(1), pages 39-56, February.
    17. Sauli Ruuska & Kaisa Miettinen & Margaret M. Wiecek, 2012. "Connections Between Single-Level and Bilevel Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 153(1), pages 60-74, April.
    18. Wang, Guangmin & Gao, Ziyou & Xu, Meng, 2019. "Integrating link-based discrete credit charging scheme into discrete network design problem," European Journal of Operational Research, Elsevier, vol. 272(1), pages 176-187.
    19. Zhao, Ning & You, Fengqi, 2019. "Dairy waste-to-energy incentive policy design using Stackelberg-game-based modeling and optimization," Applied Energy, Elsevier, vol. 254(C).
    20. M. Hosein Zare & Oleg A. Prokopyev & Denis Sauré, 2020. "On Bilevel Optimization with Inexact Follower," Decision Analysis, INFORMS, vol. 17(1), pages 74-95, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:235:y:2015:i:1:p:543-558:10.1007/s10479-015-1878-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.