IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v74y2019i3d10.1007_s10898-019-00773-2.html
   My bibliography  Save this article

Variable neighborhood search for stochastic linear programming problem with quantile criterion

Author

Listed:
  • Sergey V. Ivanov

    (Moscow Aviation Institute (National Research University))

  • Andrey I. Kibzun

    (Moscow Aviation Institute (National Research University))

  • Nenad Mladenović

    (Emirates College of Technologies
    Ural Federal University)

  • Dragan Urošević

    (Serbian Academy of Sciences and Arts)

Abstract

We consider the stochastic linear programming problem with quantile criterion and continuous distribution of random parameters. Using the sample approximation, we obtain a stochastic programming problem with discrete distribution of random parameters. It is known that the solution to this problem provides an approximate solution to the problem with continuous random parameters if the size of the sample is large enough. Applying the confidence method, we reduce the problem to a mixed integer programming problem, which is linear with respect to continuous variables. Integer variables determine confidence sets, and we describe the structure of the optimal confidence set. This property allows us to take into account only confidence sets that may be optimal. To find an approximate solution to the problem, we suggest a modification of the variable neighborhood search and determine structures of neighborhoods used in the search. Also, we discuss a method to find a good initial solution and give results of numerical experiments. We apply the developed algorithm to solve a problem of optimization of a hospital budget.

Suggested Citation

  • Sergey V. Ivanov & Andrey I. Kibzun & Nenad Mladenović & Dragan Urošević, 2019. "Variable neighborhood search for stochastic linear programming problem with quantile criterion," Journal of Global Optimization, Springer, vol. 74(3), pages 549-564, July.
    • Handle: RePEc:spr:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-019-00773-2
    DOI: 10.1007/s10898-019-00773-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-019-00773-2
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-019-00773-2?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. Peter Kall & János Mayer, 2011. "Stochastic Linear Programming," International Series in Operations Research and Management Science, Springer, edition 2, number 978-1-4419-7729-8, March.
    2. Edward P. C. Kao & Maurice Queyranne, 1985. "Budgeting Costs of Nursing in a Hospital," Management Science, INFORMS, vol. 31(5), pages 608-621, May.
    3. Pierre Hansen & Nenad Mladenović & José Moreno Pérez, 2010. "Variable neighbourhood search: methods and applications," Annals of Operations Research, Springer, vol. 175(1), pages 367-407, March.
    4. B. K. Pagnoncelli & S. Ahmed & A. Shapiro, 2009. "Sample Average Approximation Method for Chance Constrained Programming: Theory and Applications," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 399-416, August.
    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. Vesna Radonjić Ɖogatović & Marko Ɖogatović & Milorad Stanojević & Nenad Mladenović, 2020. "Revenue maximization of Internet of things provider using variable neighbourhood search," Journal of Global Optimization, Springer, vol. 78(2), pages 375-396, October.

    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. Cai, Yutong & Ong, Ghim Ping & Meng, Qiang, 2022. "Dynamic bicycle relocation problem with broken bicycles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    2. Gilberto F. Sousa Filho & Teobaldo L. Bulhões Júnior & Lucidio A. F. Cabral & Luiz Satoru Ochi & Fábio Protti, 2017. "New heuristics for the Bicluster Editing Problem," Annals of Operations Research, Springer, vol. 258(2), pages 781-814, November.
    3. Erfan Mohagheghi & Mansour Alramlawi & Aouss Gabash & Pu Li, 2018. "A Survey of Real-Time Optimal Power Flow," Energies, MDPI, vol. 11(11), pages 1-20, November.
    4. Zhuqi Miao & Balabhaskar Balasundaram & Eduardo L. Pasiliao, 2014. "An exact algorithm for the maximum probabilistic clique problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 105-120, July.
    5. Lamas, Patricio & Goycoolea, Marcos & Pagnoncelli, Bernardo & Newman, Alexandra, 2024. "A target-time-windows technique for project scheduling under uncertainty," European Journal of Operational Research, Elsevier, vol. 314(2), pages 792-806.
    6. Martín Barragán, Belén, 2016. "A Partial parametric path algorithm for multiclass classification," DES - Working Papers. Statistics and Econometrics. WS 22390, Universidad Carlos III de Madrid. Departamento de Estadística.
    7. Emelogu, Adindu & Chowdhury, Sudipta & Marufuzzaman, Mohammad & Bian, Linkan & Eksioglu, Burak, 2016. "An enhanced sample average approximation method for stochastic optimization," International Journal of Production Economics, Elsevier, vol. 182(C), pages 230-252.
    8. Venkatesh Pandiri & Alok Singh, 2020. "Two multi-start heuristics for the k-traveling salesman problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1164-1204, December.
    9. G. Pantuso & L. M. Hvattum, 2021. "Maximizing performance with an eye on the finances: a chance-constrained model for football transfer market decisions," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(2), pages 583-611, July.
    10. Jianqiang Cheng & Richard Li-Yang Chen & Habib N. Najm & Ali Pinar & Cosmin Safta & Jean-Paul Watson, 2018. "Chance-constrained economic dispatch with renewable energy and storage," Computational Optimization and Applications, Springer, vol. 70(2), pages 479-502, June.
    11. H. Asefi & S. Lim & M. Maghrebi & S. Shahparvari, 2019. "Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management," Annals of Operations Research, Springer, vol. 273(1), pages 75-110, February.
    12. Zhang, Lele & Ding, Pengyuan & Thompson, Russell G., 2023. "A stochastic formulation of the two-echelon vehicle routing and loading bay reservation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    13. Hadi Karimi & Sandra D. Ekşioğlu & Michael Carbajales-Dale, 2021. "A biobjective chance constrained optimization model to evaluate the economic and environmental impacts of biopower supply chains," Annals of Operations Research, Springer, vol. 296(1), pages 95-130, January.
    14. Jiang, Jie & Peng, Shen, 2024. "Mathematical programs with distributionally robust chance constraints: Statistical robustness, discretization and reformulation," European Journal of Operational Research, Elsevier, vol. 313(2), pages 616-627.
    15. Chen, Zhen & Archibald, Thomas W., 2024. "Maximizing the survival probability in a cash flow inventory problem with a joint service level constraint," International Journal of Production Economics, Elsevier, vol. 270(C).
    16. Zhaowei Miao & Feng Yang & Ke Fu & Dongsheng Xu, 2012. "Transshipment service through crossdocks with both soft and hard time windows," Annals of Operations Research, Springer, vol. 192(1), pages 21-47, January.
    17. Hu, Shaolong & Dong, Zhijie Sasha & Dai, Rui, 2024. "A machine learning based sample average approximation for supplier selection with option contract in humanitarian relief," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 186(C).
    18. H-Y Lin & C-J Liao & C-T Tseng, 2011. "An application of variable neighbourhood search to hospital call scheduling of infant formula promotion," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(6), pages 949-959, June.
    19. Astorino, Annabella & Avolio, Matteo & Fuduli, Antonio, 2022. "A maximum-margin multisphere approach for binary Multiple Instance Learning," European Journal of Operational Research, Elsevier, vol. 299(2), pages 642-652.
    20. Chandra Ade Irawan & Said Salhi & Zvi Drezner, 2016. "Hybrid meta-heuristics with VNS and exact methods: application to large unconditional and conditional vertex $$p$$ p -centre problems," Journal of Heuristics, Springer, vol. 22(4), pages 507-537, August.

    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:jglopt:v:74:y:2019:i:3:d:10.1007_s10898-019-00773-2. 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.