IDEAS home Printed from https://ideas.repec.org/a/eee/oprepe/v6y2019ics2214716018300873.html
   My bibliography  Save this article

Benders decomposition with special purpose method for the sub problem in lot sizing problem under uncertain demand

Author

Listed:
  • Witthayapraphakorn, Aphisak
  • Charnsethikul, Peerayuth

Abstract

We propose herein the application of Benders decomposition with stochastic linear programming instead of the mix integer linear programming (MILP) approach to solve a lot sizing problem under uncertain demand, particularly in the case of a large-scale problem involving a large number of simulated scenarios. In addition, a special purpose method is introduced to solve the sub problem of Benders decomposition and reduce the processing time. Our experiments show that Benders decomposition combined with the special purpose method (BCS) requires shorter processing times compared to the simple MILP approach in the case of large-scale problems. Furthermore, our BCS approach shows a linear relationship between the processing time and the number of scenarios, whereas the MILP approach shows a quadratic relationship between those variables, indicating that our approach is suitable in solving such problems.

Suggested Citation

  • Witthayapraphakorn, Aphisak & Charnsethikul, Peerayuth, 2019. "Benders decomposition with special purpose method for the sub problem in lot sizing problem under uncertain demand," Operations Research Perspectives, Elsevier, vol. 6(C).
    • Handle: RePEc:eee:oprepe:v:6:y:2019:i:c:s2214716018300873
    DOI: 10.1016/j.orp.2018.100096
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S2214716018300873
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.orp.2018.100096?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. Dimitris Bertsimas & Aurélie Thiele, 2006. "A Robust Optimization Approach to Inventory Theory," Operations Research, INFORMS, vol. 54(1), pages 150-168, February.
    2. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    3. Vargas, Vicente, 2009. "An optimal solution for the stochastic version of the Wagner-Whitin dynamic lot-size model," European Journal of Operational Research, Elsevier, vol. 198(2), pages 447-451, October.
    4. Agra, Agostinho & Poss, Michael & Santos, Micael, 2018. "Optimizing make-to-stock policies through a robust lot-sizing model," International Journal of Production Economics, Elsevier, vol. 200(C), pages 302-310.
    5. Poojari, C.A. & Beasley, J.E., 2009. "Improving benders decomposition using a genetic algorithm," European Journal of Operational Research, Elsevier, vol. 199(1), pages 89-97, November.
    6. Kergosien, Y. & Gendreau, M. & Billaut, J.-C., 2017. "A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints," European Journal of Operational Research, Elsevier, vol. 262(1), pages 287-298.
    7. George B. Dantzig, 1955. "Linear Programming under Uncertainty," Management Science, INFORMS, vol. 1(3-4), pages 197-206, 04-07.
    8. Khatami, Maryam & Mahootchi, Masoud & Farahani, Reza Zanjirani, 2015. "Benders’ decomposition for concurrent redesign of forward and closed-loop supply chain network with demand and return uncertainties," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 79(C), pages 1-21.
    9. Wheatley, David & Gzara, Fatma & Jewkes, Elizabeth, 2015. "Logic-based Benders decomposition for an inventory-location problem with service constraints," Omega, Elsevier, vol. 55(C), pages 10-23.
    10. Hemmati, S. & Ghaderi, S.F. & Ghazizadeh, M.S., 2018. "Sustainable energy hub design under uncertainty using Benders decomposition method," Energy, Elsevier, vol. 143(C), pages 1029-1047.
    11. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    12. Sadeghian, H.R. & Ardehali, M.M., 2016. "A novel approach for optimal economic dispatch scheduling of integrated combined heat and power systems for maximum economic profit and minimum environmental emissions based on Benders decomposition," Energy, Elsevier, vol. 102(C), pages 10-23.
    13. Tempelmeier, Horst, 2011. "A column generation heuristic for dynamic capacitated lot sizing with random demand under a fill rate constraint," Omega, Elsevier, vol. 39(6), pages 627-633, December.
    14. Pishvaee, M.S. & Razmi, J. & Torabi, S.A., 2014. "An accelerated Benders decomposition algorithm for sustainable supply chain network design under uncertainty: A case study of medical needle and syringe supply chain," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 67(C), pages 14-38.
    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. Wilco van den Heuvel & Semra Ağralı & Z. Caner Taşkın, 2023. "A Decomposition Algorithm for Single and Multiobjective Integrated Market Selection and Production Planning," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1439-1453, November.
    2. Yu, Wuyang, 2023. "A robust model for emergency supplies prepositioning and transportation considering road disruptions," Operations Research Perspectives, Elsevier, vol. 10(C).

    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. Teodor Gabriel Crainic & Mike Hewitt & Francesca Maggioni & Walter Rei, 2021. "Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design," Transportation Science, INFORMS, vol. 55(2), pages 414-435, March.
    2. Rahmaniani, Ragheb & Crainic, Teodor Gabriel & Gendreau, Michel & Rei, Walter, 2017. "The Benders decomposition algorithm: A literature review," European Journal of Operational Research, Elsevier, vol. 259(3), pages 801-817.
    3. Brahimi, Nadjib & Absi, Nabil & Dauzère-Pérès, Stéphane & Nordli, Atle, 2017. "Single-item dynamic lot-sizing problems: An updated survey," European Journal of Operational Research, Elsevier, vol. 263(3), pages 838-863.
    4. Özen, Ulaş & Doğru, Mustafa K. & Armagan Tarim, S., 2012. "Static-dynamic uncertainty strategy for a single-item stochastic inventory control problem," Omega, Elsevier, vol. 40(3), pages 348-357.
    5. Azad, Nader & Hassini, Elkafi, 2019. "Recovery strategies from major supply disruptions in single and multiple sourcing networks," European Journal of Operational Research, Elsevier, vol. 275(2), pages 481-501.
    6. Aliakbari Sani, Sajad & Bahn, Olivier & Delage, Erick, 2022. "Affine decision rule approximation to address demand response uncertainty in smart Grids’ capacity planning," European Journal of Operational Research, Elsevier, vol. 303(1), pages 438-455.
    7. Sereshti, Narges & Adulyasak, Yossiri & Jans, Raf, 2021. "The value of aggregate service levels in stochastic lot sizing problems," Omega, Elsevier, vol. 102(C).
    8. Céline Gicquel & Jianqiang Cheng, 2018. "A joint chance-constrained programming approach for the single-item capacitated lot-sizing problem with stochastic demand," Annals of Operations Research, Springer, vol. 264(1), pages 123-155, May.
    9. Fei, Xin & Gülpınar, Nalân & Branke, Jürgen, 2019. "Efficient solution selection for two-stage stochastic programs," European Journal of Operational Research, Elsevier, vol. 277(3), pages 918-929.
    10. Viktoryia Buhayenko & Dick den Hertog, 2017. "Adjustable Robust Optimisation approach to optimise discounts for multi-period supply chain coordination under demand uncertainty," International Journal of Production Research, Taylor & Francis Journals, vol. 55(22), pages 6801-6823, November.
    11. Camilo Ortiz-Astorquiza & Ivan Contreras & Gilbert Laporte, 2019. "An Exact Algorithm for Multilevel Uncapacitated Facility Location," Transportation Science, INFORMS, vol. 53(4), pages 1085-1106, July.
    12. Thevenin, Simon & Ben-Ammar, Oussama & Brahimi, Nadjib, 2022. "Robust optimization approaches for purchase planning with supplier selection under lead time uncertainty," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1199-1215.
    13. Zhu, Xuedong & Son, Junbo & Zhang, Xi & Wu, Jianguo, 2023. "Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problem," Omega, Elsevier, vol. 117(C).
    14. Chávez, Marcela María Morales & Sarache, William & Costa, Yasel, 2018. "Towards a comprehensive model of a biofuel supply chain optimization from coffee crop residues," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 136-162.
    15. Hassan Zohali & Bahman Naderi & Vahid Roshanaei, 2022. "Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 315-332, January.
    16. Reddy, K. Nageswara & Kumar, Akhilesh & Choudhary, Alok & Cheng, T. C. Edwin, 2022. "Multi-period green reverse logistics network design: An improved Benders-decomposition-based heuristic approach," European Journal of Operational Research, Elsevier, vol. 303(2), pages 735-752.
    17. Gruson, Matthieu & Cordeau, Jean-François & Jans, Raf, 2021. "Benders decomposition for a stochastic three-level lot sizing and replenishment problem with a distribution structure," European Journal of Operational Research, Elsevier, vol. 291(1), pages 206-217.
    18. Taş, Duygu & Gendreau, Michel & Jabali, Ola & Jans, Raf, 2019. "A capacitated lot sizing problem with stochastic setup times and overtime," European Journal of Operational Research, Elsevier, vol. 273(1), pages 146-159.
    19. Liu, Kanglin & Zhang, Zhi-Hai, 2018. "Capacitated disassembly scheduling under stochastic yield and demand," European Journal of Operational Research, Elsevier, vol. 269(1), pages 244-257.
    20. Neamatian Monemi, Rahimeh & Gelareh, Shahin & Nagih, Anass & Maculan, Nelson & Danach, Kassem, 2021. "Multi-period hub location problem with serial demands: A case study of humanitarian aids distribution in Lebanon," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).

    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:oprepe:v:6:y:2019:i:c:s2214716018300873. 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.journals.elsevier.com/operations-research-perspectives .

    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.