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

Stochastic set packing problem

Author

Listed:
  • Escudero, Laureano F.
  • Landete, Mercedes
  • Rodríguez-Chía, Antonio M.

Abstract

In this paper a stochastic version of the set packing problem (SPP), is studied via scenario analysis. We consider a one-stage recourse approach to deal with the uncertainty in the coefficients. It consists of maximizing in the stochastic SPP a composite function of the expected value minus the weighted risk of obtaining a scenario whose objective function value is worse than a given threshold. The splitting variable representation is decomposed by dualizing the nonanticipativity constraints that link the deterministic SPP with a 0-1 knapsack problem for each scenario under consideration. As a result a (structured) larger pure 0-1 model is created. We present several procedures for obtaining good feasible solutions, as well as a preprocessing approach for fixing variables. The Lagrange multipliers updating is performed by using the Volume Algorithm. Computational experience is reported for a broad variety of instances, which shows that the new approach usually outperforms a state-of-the-art optimization engine, producing a comparable optimality gap with smaller (several orders of magnitude) computing time.

Suggested Citation

  • Escudero, Laureano F. & Landete, Mercedes & Rodríguez-Chía, Antonio M., 2011. "Stochastic set packing problem," European Journal of Operational Research, Elsevier, vol. 211(2), pages 232-240, June.
    • Handle: RePEc:eee:ejores:v:211:y:2011:i:2:p:232-240
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(10)00800-3
    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. Beraldi, Patrizia & Ruszczynski, Andrzej, 2005. "Beam search heuristic to solve stochastic integer problems under probabilistic constraints," European Journal of Operational Research, Elsevier, vol. 167(1), pages 35-47, November.
    2. Monique Guignard, 2003. "Lagrangean relaxation," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 11(2), pages 151-200, December.
    3. Laureano Escudero, 2009. "On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(1), pages 5-29, July.
    4. Rafael Andrade & Abdel Lisser & Nelson Maculan & Gérard Plateau, 2006. "Enhancing a Branch-and-Bound Algorithm for Two-Stage Stochastic Integer Network Design-Based Models," Management Science, INFORMS, vol. 52(9), pages 1450-1455, September.
    5. Ogryczak, Wlodzimierz & Ruszczynski, Andrzej, 1999. "From stochastic dominance to mean-risk models: Semideviations as risk measures," European Journal of Operational Research, Elsevier, vol. 116(1), pages 33-50, July.
    6. Sven de Vries & Rakesh V. Vohra, 2003. "Combinatorial Auctions: A Survey," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 284-309, August.
    7. Laureano Escudero, 2009. "Rejoinder on: On a mixture of the fix-and-relax coordination and Lagrangean substitution schemes for multistage stochastic mixed integer programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(1), pages 40-43, July.
    8. Laureano Escudero & Araceli Garín & María Merino & Gloria Pérez, 2009. "On multistage Stochastic Integer Programming for incorporating logical constraints in asset and liability management under uncertainty," Computational Management Science, Springer, vol. 6(3), pages 307-327, August.
    9. Laureano Escudero & Araceli Garín & María Merino & Gloria Pérez, 2009. "BFC-MSMIP: an exact branch-and-fix coordination approach for solving multistage stochastic mixed 0–1 problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(1), pages 96-122, July.
    10. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Teresa Ortuno, M., 2003. "BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0-1 programs," European Journal of Operational Research, Elsevier, vol. 151(3), pages 503-519, December.
    11. Samer Takriti & John R. Birge, 2000. "Lagrangian Solution Techniques and Bounds for Loosely Coupled Mixed-Integer Stochastic Programs," Operations Research, INFORMS, vol. 48(1), pages 91-98, February.
    12. Mari'n, Alfredo & Canovas, Lazaro & Landete, Mercedes, 2006. "New formulations for the uncapacitated multiple allocation hub location problem," European Journal of Operational Research, Elsevier, vol. 172(1), pages 274-292, July.
    13. Santoso, Tjendera & Ahmed, Shabbir & Goetschalckx, Marc & Shapiro, Alexander, 2005. "A stochastic programming approach for supply chain network design under uncertainty," European Journal of Operational Research, Elsevier, vol. 167(1), pages 96-115, November.
    14. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    15. Lulli, Guglielmo & Sen, Suvrajeet, 2006. "A heuristic procedure for stochastic integer programs with complete recourse," European Journal of Operational Research, Elsevier, vol. 171(3), pages 879-890, June.
    16. Silvano Martello & David Pisinger & Paolo Toth, 1999. "Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem," Management Science, INFORMS, vol. 45(3), pages 414-424, March.
    17. L. Escudero & A. Garín & M. Merino & G. Pérez, 2007. "A two-stage stochastic integer programming approach as a mixture of Branch-and-Fix Coordination and Benders Decomposition schemes," Annals of Operations Research, Springer, vol. 152(1), pages 395-420, July.
    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. Liu, Weimiao & Deng, Tianhu & Li, Jianbin, 2019. "Product packing and stacking under uncertainty: A robust approach," European Journal of Operational Research, Elsevier, vol. 277(3), pages 903-917.

    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. Laureano Escudero, 2009. "On a mixture of the fix-and-relax coordination and Lagrangian substitution schemes for multistage stochastic mixed integer programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 17(1), pages 5-29, July.
    2. Aldasoro, Unai & Escudero, Laureano F. & Merino, María & Pérez, Gloria, 2017. "A parallel Branch-and-Fix Coordination based matheuristic algorithm for solving large sized multistage stochastic mixed 0–1 problems," European Journal of Operational Research, Elsevier, vol. 258(2), pages 590-606.
    3. Escudero, L.F. & Garín, M.A. & Merino, M. & Pérez, G., 2010. "An exact algorithm for solving large-scale two-stage stochastic mixed-integer problems: Some theoretical and experimental aspects," European Journal of Operational Research, Elsevier, vol. 204(1), pages 105-116, July.
    4. Pagès-Bernaus, Adela & Pérez-Valdés, Gerardo & Tomasgard, Asgeir, 2015. "A parallelised distributed implementation of a Branch and Fix Coordination algorithm," European Journal of Operational Research, Elsevier, vol. 244(1), pages 77-85.
    5. Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Pérez Sainz de Rozas, Gloria & Unzueta Inchaurbe, Aitziber, 2010. "Lagrangean decomposition for large-scale two-stage stochastic mixed 0-1 problems," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    6. Beltran-Royo, C., 2017. "Two-stage stochastic mixed-integer linear programming: The conditional scenario approach," Omega, Elsevier, vol. 70(C), pages 31-42.
    7. Eguía Ribero, María Isabel & Garín Martín, María Araceli & Unzueta Inchaurbe, Aitziber, 2018. "Generating cluster submodels from two-stage stochastic mixed integer optimization models," BILTOKI 31248, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
    8. Alonso-Ayuso, Antonio & Carvallo, Felipe & Escudero, Laureano F. & Guignard, Monique & Pi, Jiaxing & Puranmalka, Raghav & Weintraub, Andrés, 2014. "Medium range optimization of copper extraction planning under uncertainty in future copper prices," European Journal of Operational Research, Elsevier, vol. 233(3), pages 711-726.
    9. Quddus, Md Abdul & Shahvari, Omid & Marufuzzaman, Mohammad & Ekşioğlu, Sandra D. & Castillo-Villar, Krystel K., 2021. "Designing a reliable electric vehicle charging station expansion under uncertainty," International Journal of Production Economics, Elsevier, vol. 236(C).
    10. Víctor Blanco & Elena Fernández & Yolanda Hinojosa, 2023. "Hub Location with Protection Under Interhub Link Failures," INFORMS Journal on Computing, INFORMS, vol. 35(5), pages 966-985, September.
    11. Alonso-Ayuso, Antonio & Escudero, Laureano F. & Guignard, Monique & Weintraub, Andres, 2018. "Risk management for forestry planning under uncertainty in demand and prices," European Journal of Operational Research, Elsevier, vol. 267(3), pages 1051-1074.
    12. Basciftci, Beste & Ahmed, Shabbir & Shen, Siqian, 2021. "Distributionally robust facility location problem under decision-dependent stochastic demand," European Journal of Operational Research, Elsevier, vol. 292(2), pages 548-561.
    13. 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.
    14. Zarrinpoor, Naeme & Fallahnezhad, Mohammad Saber & Pishvaee, Mir Saman, 2018. "The design of a reliable and robust hierarchical health service network using an accelerated Benders decomposition algorithm," European Journal of Operational Research, Elsevier, vol. 265(3), pages 1013-1032.
    15. Zhang, Ying & Qi, Mingyao & Lin, Wei-Hua & Miao, Lixin, 2015. "A metaheuristic approach to the reliable location routing problem under disruptions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 83(C), pages 90-110.
    16. Ivanov, Dmitry & Pavlov, Alexander & Sokolov, Boris, 2014. "Optimal distribution (re)planning in a centralized multi-stage supply network under conditions of the ripple effect and structure dynamics," European Journal of Operational Research, Elsevier, vol. 237(2), pages 758-770.
    17. Contreras, Ivan & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Stochastic uncapacitated hub location," European Journal of Operational Research, Elsevier, vol. 212(3), pages 518-528, August.
    18. Schwarz, Hannes & Bertsch, Valentin & Fichtner, Wolf, 2015. "Two-stage stochastic, large-scale optimization of a decentralized energy system - a residential quarter as case study," Working Paper Series in Production and Energy 10, Karlsruhe Institute of Technology (KIT), Institute for Industrial Production (IIP).
    19. José L. Sainz-Pardo & Javier Alcaraz & Mercedes Landete & Juan F. Monge, 2017. "On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem," Journal of Global Optimization, Springer, vol. 67(4), pages 787-804, April.

    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:211:y:2011:i:2:p:232-240. 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.