Chen, Shurui (2024) A Multi-period supply planning problem for managing stochastic demand. Masters thesis, Concordia University.
Preview |
Text (application/pdf)
703kBShurui Chen_MSCM_F2024.pdf - Accepted Version Available under License Spectrum Terms of Access. |
Abstract
In this thesis, we address the critical issue of drug shortages that has persisted during and after the Covid-19 pandemic. We develop a two-stage stochastic model aimed at understanding how a compounding pharmaceutical company can balance supplier selection, drug production, back orders, and inventory management when faced with uncertain demand.
To explore and resolve the application of two models under varying conditions, we introduce the Sample Average Approximation (SAA) and Lagrangean Decomposition methods. Additionally, to better simulate the uncertainties present in real-world scenarios, we employ Monte Carlo simulations to generate diverse cases, enabling the model to produce more reliable results.
| Divisions: | Concordia University > John Molson School of Business > Supply Chain and Business Technology Management |
|---|---|
| Item Type: | Thesis (Masters) |
| Authors: | Chen, Shurui |
| Institution: | Concordia University |
| Degree Name: | M.S.C.M. |
| Program: | Supply Chain Management |
| Date: | 10 August 2024 |
| Thesis Supervisor(s): | Chauhan, Satyaveer S |
| Keywords: | Covid-19 Pandemic Drug Shortage, Two-stage stochastic model, Sample Average Approximation (SAA), Lagrangean Decomposition, Monte Carlo simulations |
| ID Code: | 994440 |
| Deposited By: | Shurui Chen |
| Deposited On: | 24 Oct 2024 18:37 |
| Last Modified: | 24 Oct 2024 18:37 |
| Related URLs: |
References:
Abdelmaguid, T. F., Dessouky, M. M., & Ordóñez, F. (2009). Heuristic approaches for the inventory-routing problem with backlogging. Computers & Industrial Engineering, 56(4), 1519–1534.Adelman, D. (2004). A price-directed approach to stochastic inventory/routing. Operations Research, 52(4), 499–514.
Ahmed, S. (2013). A scenario decomposition algorithm for 0–1 stochastic programs. Operations Research Letters, 41(6), 565–569.
Ahmed, S., Shapiro, A., & Shapiro, E. (2002). The sample average approximation method for stochastic programs with integer recourse. Submitted for publication, 1–24.
Alinaghian, M., & Zamani, M. (2019). A bi-objective fleet size and mix green inventory routing problem, model and solution method. Soft Computing, 23, 1375–1391.
Aptel, O., & Pourjalali, H. (2001). Improving activities and decreasing costs of logistics in hospitals: a comparison of US and French hospitals. The International Journal of Accounting, 36(1), 65–90.
Avella, P., Boccia, M., & Wolsey, L. A. (2018). Single-period cutting planes for inventory routing problems. Transportation Science, 52(3), 497–508.
Azadeh, A., Elahi, S., Farahani, M. H., & Nasirian, B. (2017). A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Computers & Industrial Engineering, 104, 124–133.
Balkhi, B., Alshahrani, A., & Khan, A. (2022). Just-in-time approach in healthcare inventory management: Does it really work? Saudi Pharmaceutical Journal, 30(12), 1830–1835.
Baum, N. (2006). Just in time’ means more dimes in your pocket: Stocking only what your practice needs takes careful planning, but offers big savings. Urology Times, 34(1), 28.
Campbell, A. M., & Savelsbergh, M. W. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488–502.
Carøe, C. C., & Schultz, R. (1999). Dual decomposition in stochastic integer programming. Operations Research Letters, 24(1-2), 37–45.
Charnes, A., & Cooper, W. W. (1963). Deterministic equivalents for optimizing and satisficing under chance constraints. Operations Research, 11(1), 18–39.
Coelho, L. C., Cordeau, J.-F., & Laporte, G. (2012). The inventory-routing problem with transshipment. Computers & Operations Research, 39(11), 2537–2548.
Contreras, I., Cordeau, J.-F., & Laporte, G. (2011a). Benders decomposition for large-scale uncapacitated hub location. Operations Research, 59(6), 1477–1490.
Contreras, I., Cordeau, J.-F., & Laporte, G. (2011b). Stochastic uncapacitated hub location. European Journal of Operational Research, 212(3), 518–528.
Crainic, T. G., Fu, X., Gendreau, M., Rei, W., & Wallace, S. W. (2011). Progressive hedging-based metaheuristics for stochastic network design. Networks, 58(2), 114–124.
Dantzig, G. B. (1955). Linear programming under uncertainty. Management Science, 1(3-4), 197–206.
Gianturco, S. L., Yoon, S., Yuen, M. V., & Mattingly, A. N. (2021). Outsourcing facilities and their place in the US drug supply chain. Journal of the American Pharmacists Association, 61(1), e99–e102.
Guignard, M. (2003). Lagrangean relaxation. Top, 11, 151–200.
Guignard, M., & Kim, S. (1987). Lagrangean decomposition for integer programming: theory and applications. RAIRO-Operations Research, 21(4), 307–323.
Held, M., Wolfe, P., & Crowder, H. P. (1974). Validation of subgradient optimization. Mathematical Programming, 6, 62–88.
Jaillet, P., Bard, J. F., Huang, L., & Dror, M. (2002). Delivery cost approximations for inventory routing problems in a rolling horizon framework. Transportation Science, 36(3), 292–300.
Kelley, J. E., Jr. (1960). The cutting-plane method for solving convex programs. Journal of the Society for Industrial and Applied Mathematics, 8(4), 703–712.
Kleywegt, A. J., Shapiro, A., & Homem-de Mello, T. (2002). The sample average approximation method for stochastic discrete optimization. SIAM Journal on Optimization, 12(2), 479–502.
Li, Z., Zhang, Y., & Zhang, G. (2020). Two-stage stochastic programming for the refined oil secondary distribution with uncertain demand and limited inventory capacity. IEEE Access, 8, 119487–119500.
Linhares Rodrigues, A. (2019). Approximation algorithms for distributionally robust stochastic optimization.
Magableh, G. M. (2021). Supply chains and the COVID-19 pandemic: A comprehensive framework. European Management Review, 18(3), 363–382.
Mirzapour Al-e Hashem, S., & Rekik, Y. (2014). Multi-product multi-period inventory routing problem with a transshipment option: A green approach. International Journal of Production Economics, 157, 80–88.
Moin, N. H. (2011). Optimization of multi periods inventory routing problem model with time varying demand. In 2011 IEEE International Conference on Industrial Engineering and Engineering Management (pp. 190–194).
Nikzad, E., Bashiri, M., & Oliveira, F. (2019). Two-stage stochastic programming approach for the medical drug inventory routing problem under uncertainty. Computers & Industrial Engineering, 128, 358–370.
Norkin, V. I., Pflug, G. C., & Ruszczyński, A. (1998). A branch and bound method for stochastic global optimization. Mathematical Programming, 83, 425–450.
Oliveira, F. C. P. (2021). Petroleum supply chain management under uncertainty: Models and algorithms (PhD thesis, Pontifícia Universidade Católica do Rio de Janeiro - PUC-Rio). Retrieved from https://www.maxwell.vrac.puc-rio.br/colecao.php?strSecao=resultado&nrSeq=55799@2 (Advisor: Silvio Hamacher)
Ramadhan, F., Imran, A., & Rizana, A. F. (2018). A record-to-record travel algorithm for multiproduct and multi-period inventory routing problem. In 2018 5th International Conference on Industrial Engineering and Applications (ICIEA) (pp. 274–278).
Solyalı, O., & Süral, H. (2017). A multi-phase heuristic for the production routing problem. Computers & Operations Research, 87, 114–124.
Yu, Y., Chu, C., Chen, H., & Chu, F. (2012). Large scale stochastic inventory routing problems with split delivery and service level constraints. Annals of Operations Research, 197, 135–158.
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.
Repository Staff Only: item control page
Download Statistics
Download Statistics