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

Beam search heuristic to solve stochastic integer problems under probabilistic constraints

Author

Listed:
  • Beraldi, Patrizia
  • Ruszczynski, Andrzej

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:167:y:2005:i:1:p:35-47
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00277-2
    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. Gendreau, Michel & Laporte, Gilbert & Seguin, Rene, 1996. "Stochastic vehicle routing," European Journal of Operational Research, Elsevier, vol. 88(1), pages 3-12, January.
    2. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    3. A. Charnes & W. W. Cooper & G. H. Symonds, 1958. "Cost Horizons and Certainty Equivalents: An Approach to Stochastic Programming of Heating Oil," Management Science, INFORMS, vol. 4(3), pages 235-263, April.
    4. Owen, Susan Hesse & Daskin, Mark S., 1998. "Strategic facility location: A review," European Journal of Operational Research, Elsevier, vol. 111(3), pages 423-447, December.
    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. Beraldi, Patrizia & Bruni, Maria Elena & Laganà, Demetrio & Musmanno, Roberto, 2015. "The mixed capacitated general routing problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 240(2), pages 382-392.
    2. Sabuncuoglu, Ihsan & Gocgun, Yasin & Erel, Erdal, 2008. "Backtracking and exchange of information: Methods to enhance a beam search algorithm for assembly line scheduling," European Journal of Operational Research, Elsevier, vol. 186(3), pages 915-930, May.
    3. Patrizia Beraldi & Antonio Violi & Maria Elena Bruni & Gianluca Carrozzino, 2017. "A Probabilistically Constrained Approach for the Energy Procurement Problem," Energies, MDPI, vol. 10(12), pages 1-17, December.
    4. Patrizia Beraldi & Maria Elena Bruni, 2022. "Enhanced indexation via chance constraints," Operational Research, Springer, vol. 22(2), pages 1553-1573, April.
    5. 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.

    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. Ansari, Sina & Başdere, Mehmet & Li, Xiaopeng & Ouyang, Yanfeng & Smilowitz, Karen, 2018. "Advancements in continuous approximation models for logistics and transportation systems: 1996–2016," Transportation Research Part B: Methodological, Elsevier, vol. 107(C), pages 229-252.
    2. Dongya Li & Wei Wang & De Zhao, 2022. "A Practical and Sustainable Approach to Determining the Deployment Priorities of Automatic Vehicle Identification Sensors," Sustainability, MDPI, vol. 14(15), pages 1-22, August.
    3. Shahparvari, Shahrooz & Abbasi, Babak & Chhetri, Prem, 2017. "Possibilistic scheduling routing for short-notice bushfire emergency evacuation under uncertainties: An Australian case study," Omega, Elsevier, vol. 72(C), pages 96-117.
    4. Fu, Chenyi & Zhu, Ning & Ma, Shoufeng, 2017. "A stochastic program approach for path reconstruction oriented sensor location model," Transportation Research Part B: Methodological, Elsevier, vol. 102(C), pages 210-237.
    5. Patrizia Beraldi & Maria Bruni, 2010. "An exact approach for solving integer problems under probabilistic constraints with random technology matrix," Annals of Operations Research, Springer, vol. 177(1), pages 127-137, June.
    6. Beraldi, P. & Bruni, M.E., 2009. "A probabilistic model applied to emergency service vehicle location," European Journal of Operational Research, Elsevier, vol. 196(1), pages 323-331, July.
    7. Wenqing Chen & Melvyn Sim & Jie Sun & Chung-Piaw Teo, 2010. "From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization," Operations Research, INFORMS, vol. 58(2), pages 470-485, April.
    8. Alfandari, Laurent, 2004. "Choice Rules with Size Constraints for Multiple Criteria Decision Making," ESSEC Working Papers DR 04002, ESSEC Research Center, ESSEC Business School.
    9. Sarhadi, Hassan & Naoum-Sawaya, Joe & Verma, Manish, 2020. "A robust optimization approach to locating and stockpiling marine oil-spill response facilities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 141(C).
    10. Marcos Singer & Patricio Donoso & Natalia Jadue, 2004. "Evaluacion De Las Oportunidades De Mejoramiento De La Logistica Directa De Emergencia," Abante, Escuela de Administracion. Pontificia Universidad Católica de Chile., vol. 7(2), pages 179-209.
    11. Hang Li & Zhe Zhang & Xianggen Yin & Buhan Zhang, 2020. "Preventive Security-Constrained Optimal Power Flow with Probabilistic Guarantees," Energies, MDPI, vol. 13(9), pages 1-13, May.
    12. Almeder, Christian & Hartl, Richard F., 2013. "A metaheuristic optimization approach for a real-world stochastic flexible flow shop problem with limited buffer," International Journal of Production Economics, Elsevier, vol. 145(1), pages 88-95.
    13. Sauvey, Christophe & Melo, Teresa & Correia, Isabel, 2019. "Two-phase heuristics for a multi-period capacitated facility location problem with service-differentiated customers," Technical Reports on Logistics of the Saarland Business School 16, Saarland University of Applied Sciences (htw saar), Saarland Business School.
    14. Novoa, Clara & Storer, Robert, 2009. "An approximate dynamic programming approach for the vehicle routing problem with stochastic demands," European Journal of Operational Research, Elsevier, vol. 196(2), pages 509-515, July.
    15. García Cáceres, Rafael Guillermo & Aráoz Durand, Julián Arturo & Gómez, Fernando Palacios, 2009. "Integral analysis method - IAM," European Journal of Operational Research, Elsevier, vol. 192(3), pages 891-903, February.
    16. Glover, Fred & Sueyoshi, Toshiyuki, 2009. "Contributions of Professor William W. Cooper in Operations Research and Management Science," European Journal of Operational Research, Elsevier, vol. 197(1), pages 1-16, August.
    17. Srinivas, Sharan & Ramachandiran, Surya & Rajendran, Suchithra, 2022. "Autonomous robot-driven deliveries: A review of recent developments and future directions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    18. Ann Melissa Campbell & Martin W. P. Savelsbergh, 2005. "Decision Support for Consumer Direct Grocery Initiatives," Transportation Science, INFORMS, vol. 39(3), pages 313-327, August.
    19. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    20. Stephanie A. Snyder & Robert G. Haight, 2016. "Application of the Maximal Covering Location Problem to Habitat Reserve Site Selection," International Regional Science Review, , vol. 39(1), pages 28-47, January.

    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:167:y:2005:i:1:p:35-47. 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.