IDEAS home Printed from https://ideas.repec.org/a/spr/comgts/v6y2009i2p251-267.html
   My bibliography  Save this article

Stochastic optimization models for a single-sink transportation problem

Author

Listed:
  • Francesca Maggioni
  • Michal Kaut
  • Luca Bertazzi

Abstract

No abstract is available for this item.

Suggested Citation

  • Francesca Maggioni & Michal Kaut & Luca Bertazzi, 2009. "Stochastic optimization models for a single-sink transportation problem," Computational Management Science, Springer, vol. 6(2), pages 251-267, May.
    • Handle: RePEc:spr:comgts:v:6:y:2009:i:2:p:251-267
    DOI: 10.1007/s10287-008-0086-z
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10287-008-0086-z
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10287-008-0086-z?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. Y. T. Herer & M. J. Rosenblatt & I. Hefter, 1996. "Fast Algorithms for Single-Sink Fixed Charge Transportation Problems with Applications to Manufacturing and Transportation," Transportation Science, INFORMS, vol. 30(4), pages 276-290, November.
    2. Udatta S. Palekar & Mark H. Karwan & Stanley Zionts, 1990. "A Branch-and-Bound Method for the Fixed Charge Transportation Problem," Management Science, INFORMS, vol. 36(9), pages 1092-1105, September.
    3. Jitka Dupačová & Giorgio Consigli & Stein Wallace, 2000. "Scenarios for Multistage Stochastic Programs," Annals of Operations Research, Springer, vol. 100(1), pages 25-53, December.
    4. Bahram Alidaee & Gary A. Kochenberger, 2005. "A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem," Transportation Science, INFORMS, vol. 39(1), pages 140-143, February.
    5. Bruce W. Lamar & Chris A. Wallace, 1997. "Revised-Modified Penalties for Fixed Charge Transportation Problems," Management Science, INFORMS, vol. 43(10), pages 1431-1436, October.
    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. Bertazzi, Luca & Maggioni, Francesca, 2018. "A stochastic multi-stage fixed charge transportation problem: Worst-case analysis of the rolling horizon approach," European Journal of Operational Research, Elsevier, vol. 267(2), pages 555-569.
    2. M. E. Bruni & P. Beraldi & D. Conforti, 2017. "Water distribution networks design under uncertainty," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 25(1), pages 111-126, April.
    3. Francesca Maggioni & Stein Wallace, 2012. "Analyzing the quality of the expected value solution in stochastic programming," Annals of Operations Research, Springer, vol. 200(1), pages 37-54, November.
    4. Gambella, Claudio & Maggioni, Francesca & Vigo, Daniele, 2019. "A stochastic programming model for a tactical solid waste management problem," European Journal of Operational Research, Elsevier, vol. 273(2), pages 684-694.
    5. Francesca Maggioni & Elisabetta Allevi & Marida Bertocchi, 2014. "Bounds in Multistage Linear Stochastic Programming," Journal of Optimization Theory and Applications, Springer, vol. 163(1), pages 200-229, October.
    6. Ching-Hui Tang, 2018. "Two-stage stochastic modeling of transportation outsourcing plans for transshipment centers," 4OR, Springer, vol. 16(1), pages 67-94, March.
    7. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
    8. Cavagnini, Rossana & Bertazzi, Luca & Maggioni, Francesca, 2022. "A rolling horizon approach for a multi-stage stochastic fixed-charge transportation problem with transshipment," European Journal of Operational Research, Elsevier, vol. 301(3), pages 912-922.
    9. 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.
    10. Francesca Maggioni & Florian A. Potra & Marida Bertocchi, 2017. "A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches," Computational Management Science, Springer, vol. 14(1), pages 5-44, January.

    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. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    2. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    3. Tue R. L. Christensen & Kim Allan Andersen & Andreas Klose, 2013. "Solving the Single-Sink, Fixed-Charge, Multiple-Choice Transportation Problem by Dynamic Programming," Transportation Science, INFORMS, vol. 47(3), pages 428-438, August.
    4. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    5. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    6. Gavin J. Bell & Bruce W. Lamar & Chris A. Wallace, 1999. "Capacity improvement, penalties, and the fixed charge transportation problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 341-355, June.
    7. Yogesh Agarwal & Yash Aneja, 2012. "Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron," Operations Research, INFORMS, vol. 60(3), pages 638-654, June.
    8. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    9. Jesús Sáez Aguado, 2009. "Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems," Annals of Operations Research, Springer, vol. 172(1), pages 45-69, November.
    10. Dimitri J. Papageorgiou & Alejandro Toriello & George L. Nemhauser & Martin W. P. Savelsbergh, 2012. "Fixed-Charge Transportation with Product Blending," Transportation Science, INFORMS, vol. 46(2), pages 281-295, May.
    11. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.
    12. Francesca Maggioni & Florian A. Potra & Marida Bertocchi, 2017. "A scenario-based framework for supply planning under uncertainty: stochastic programming versus robust optimization approaches," Computational Management Science, Springer, vol. 14(1), pages 5-44, January.
    13. Sun, Minghe, 2002. "The transportation problem with exclusionary side constraints and two branch-and-bound algorithms," European Journal of Operational Research, Elsevier, vol. 140(3), pages 629-647, August.
    14. Liu, Pei-chen Barry & Hansen, Mark & Mukherjee, Avijit, 2008. "Scenario-based air traffic flow management: From theory to practice," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 685-702, August.
    15. Gulpinar, Nalan & Rustem, Berc & Settergren, Reuben, 2004. "Simulation and optimization approaches to scenario tree generation," Journal of Economic Dynamics and Control, Elsevier, vol. 28(7), pages 1291-1315, April.
    16. Aardal, Karen & van den Berg, Pieter L. & Gijswijt, Dion & Li, Shanfei, 2015. "Approximation algorithms for hard capacitated k-facility location problems," European Journal of Operational Research, Elsevier, vol. 242(2), pages 358-368.
    17. Faezeh Akhavizadegan & Lizhi Wang & James McCalley, 2020. "Scenario Selection for Iterative Stochastic Transmission Expansion Planning," Energies, MDPI, vol. 13(5), pages 1-18, March.
    18. Castro, Jordi & Escudero, Laureano F. & Monge, Juan F., 2023. "On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach," European Journal of Operational Research, Elsevier, vol. 310(1), pages 268-285.
    19. Murat Köksalan & Ceren Tuncer Şakar, 2016. "An interactive approach to stochastic programming-based portfolio optimization," Annals of Operations Research, Springer, vol. 245(1), pages 47-66, October.
    20. Kostrova, Alisa & Britz, Wolfgang & Djanibekov, Utkur & Finger, Robert, 2016. "Monte-Carlo Simulation and Stochastic Programming in Real Options Valuation: the Case of Perennial Energy Crop Cultivation," Discussion Papers 250253, University of Bonn, Institute for Food and Resource Economics.

    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:comgts:v:6:y:2009:i:2:p:251-267. 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.