IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v88y1996i3p563-571.html
   My bibliography  Save this article

A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem

Author

Listed:
  • Wen, U. P.
  • Huang, A. D.

Abstract

No abstract is available for this item.

Suggested Citation

  • Wen, U. P. & Huang, A. D., 1996. "A simple Tabu Search method to solve the mixed-integer linear bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 563-571, February.
    • Handle: RePEc:eee:ejores:v:88:y:1996:i:3:p:563-571
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(94)00215-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Wayne F. Bialas & Mark H. Karwan, 1984. "Two-Level Linear Programming," Management Science, INFORMS, vol. 30(8), pages 1004-1020, August.
    2. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    3. Widmer, Marino & Hertz, Alain, 1989. "A new heuristic method for the flow shop sequencing problem," European Journal of Operational Research, Elsevier, vol. 41(2), pages 186-193, July.
    4. James T. Moore & Jonathan F. Bard, 1990. "The Mixed Integer Linear Bilevel Programming Problem," Operations Research, INFORMS, vol. 38(5), pages 911-921, October.
    5. Jonathan F. Bard, 1983. "An Algorithm for Solving the General Bilevel Programming Problem," Mathematics of Operations Research, INFORMS, vol. 8(2), pages 260-272, May.
    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. G. Hibino & M. Kainuma & Y. Matsuoka & T. Morita, 1996. "Two-level Mathematical Programming for Analyzing Subsidy Options to Reduce Greenhouse-Gas Emissions," Working Papers wp96129, International Institute for Applied Systems Analysis.
    2. Fu Lin & Sven Leyffer & Todd Munson, 2016. "A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings," Computational Optimization and Applications, Springer, vol. 65(1), pages 1-46, September.
    3. F. Parvaresh & S. Hashemi Golpayegany & S. Moattar Husseini & B. Karimi, 2013. "Solving the p-hub Median Problem Under Intentional Disruptions Using Simulated Annealing," Networks and Spatial Economics, Springer, vol. 13(4), pages 445-470, December.
    4. Lüer-Villagra, Armin & Marianov, Vladimir & Eiselt, H.A. & Méndez-Vogel, Gonzalo, 2022. "The leader multipurpose shopping location problem," European Journal of Operational Research, Elsevier, vol. 302(2), pages 470-481.
    5. Cao, Dong & Chen, Mingyuan, 2006. "Capacitated plant selection in a decentralized manufacturing environment: A bilevel optimization approach," European Journal of Operational Research, Elsevier, vol. 169(1), pages 97-110, February.
    6. 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.
    7. Vyacheslav Kalashnikov & Gerardo Pérez & Nataliya Kalashnykova, 2010. "A linearization approach to solve the natural gas cash-out bilevel problem," Annals of Operations Research, Springer, vol. 181(1), pages 423-442, December.
    8. Gabriel, Steven A. & Leuthold, Florian U., 2010. "Solving discretely-constrained MPEC problems with applications in electric power markets," Energy Economics, Elsevier, vol. 32(1), pages 3-14, January.
    9. Richard Oberdieck & Nikolaos A. Diangelakis & Styliani Avraamidou & Efstratios N. Pistikopoulos, 2017. "On unbounded and binary parameters in multi-parametric programming: applications to mixed-integer bilevel optimization and duality theory," Journal of Global Optimization, Springer, vol. 69(3), pages 587-606, November.
    10. Deniz Aksen & Nuray Piyade & Necati Aras, 2010. "The budget constrained r-interdiction median problem with capacity expansion," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 18(3), pages 269-291, September.
    11. Steven Gabriel & Sauleh Siddiqui & Antonio Conejo & Carlos Ruiz, 2013. "Solving Discretely-Constrained Nash–Cournot Games with an Application to Power Markets," Networks and Spatial Economics, Springer, vol. 13(3), pages 307-326, September.
    12. Lukac, Zrinka & Soric, Kristina & Rosenzweig, Visnja Vojvodic, 2008. "Production planning problem with sequence dependent setups as a bilevel programming problem," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1504-1512, June.
    13. Budnitzki, Alina, 2014. "Computation of the optimal tolls on the traffic network," European Journal of Operational Research, Elsevier, vol. 235(1), pages 247-251.
    14. S A Gabriel & Y Shim & A J Conejo & S de la Torre & R García-Bertrand, 2010. "A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1404-1419, September.
    15. Kuo, R.J. & Lee, Y.H. & Zulvia, Ferani E. & Tien, F.C., 2015. "Solving bi-level linear programming problem through hybrid of immune genetic algorithm and particle swarm optimization algorithm," Applied Mathematics and Computation, Elsevier, vol. 266(C), pages 1013-1026.
    16. Fischetti, Matteo & Monaci, Michele & Sinnl, Markus, 2018. "A dynamic reformulation heuristic for Generalized Interdiction Problems," European Journal of Operational Research, Elsevier, vol. 267(1), pages 40-51.
    17. O'Hanley, Jesse R. & Church, Richard L., 2011. "Designing robust coverage networks to hedge against worst-case facility losses," European Journal of Operational Research, Elsevier, vol. 209(1), pages 23-36, February.
    18. Chu, James C. & Chen, Yin-Jay, 2012. "Optimal threshold-based network-level transportation infrastructure life-cycle management with heterogeneous maintenance actions," Transportation Research Part B: Methodological, Elsevier, vol. 46(9), pages 1123-1143.

    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. 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.
    2. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    3. Liu, Shaonan & Kong, Nan & Parikh, Pratik & Wang, Mingzheng, 2023. "Optimal trauma care network redesign with government subsidy: A bilevel integer programming approach," Omega, Elsevier, vol. 119(C).
    4. Blom, Danny & Smeulders, Bart & Spieksma, Frits, 2024. "Rejection-proof mechanisms for multi-agent kidney exchange," Games and Economic Behavior, Elsevier, vol. 143(C), pages 25-50.
    5. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    6. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    7. Alexander Mitsos, 2010. "Global solution of nonlinear mixed-integer bilevel programs," Journal of Global Optimization, Springer, vol. 47(4), pages 557-582, August.
    8. Zhang, Ying & Snyder, Lawrence V. & Ralphs, Ted K. & Xue, Zhaojie, 2016. "The competitive facility location problem under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 453-473.
    9. Blazewicz, Jacek & Domschke, Wolfgang & Pesch, Erwin, 1996. "The job shop scheduling problem: Conventional and new solution techniques," European Journal of Operational Research, Elsevier, vol. 93(1), pages 1-33, August.
    10. Liu, Yi-Hsin & Spencer, Thomas H., 1995. "Solving a bilevel linear program when the inner decision maker controls few variables," European Journal of Operational Research, Elsevier, vol. 81(3), pages 644-651, March.
    11. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    12. S A Gabriel & Y Shim & A J Conejo & S de la Torre & R García-Bertrand, 2010. "A Benders decomposition method for discretely-constrained mathematical programs with equilibrium constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1404-1419, September.
    13. Gabriel, Steven A. & Leuthold, Florian U., 2010. "Solving discretely-constrained MPEC problems with applications in electric power markets," Energy Economics, Elsevier, vol. 32(1), pages 3-14, January.
    14. G. Z. Ruan & S. Y. Wang & Y. Yamamoto & S. S. Zhu, 2004. "Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions," Journal of Optimization Theory and Applications, Springer, vol. 123(2), pages 409-429, November.
    15. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, June.
    16. Grabowski, Jozef & Pempera, Jaroslaw, 2000. "Sequencing of jobs in some production system," European Journal of Operational Research, Elsevier, vol. 125(3), pages 535-550, September.
    17. Mathur, Kanchan & Puri, M. C., 1995. "A bilevel bottleneck programming problem," European Journal of Operational Research, Elsevier, vol. 86(2), pages 337-344, October.
    18. Junlong Zhang & Osman Y. Özaltın, 2021. "Bilevel Integer Programs with Stochastic Right-Hand Sides," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1644-1660, October.
    19. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    20. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:88:y:1996:i:3:p:563-571. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.