Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/30232
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorHuang, Kai-
dc.contributor.authorMoghtader, Omid-
dc.date.accessioned2024-09-25T13:50:01Z-
dc.date.available2024-09-25T13:50:01Z-
dc.date.issued2024-
dc.identifier.urihttp://hdl.handle.net/11375/30232-
dc.description.abstractThis thesis presents a comprehensive investigation into the performance and generalizability of optimization approaches for the single-echelon (r, Q) inventory management policy under stochastic demand, specifically focusing on demand characterized by a Poisson distribution. The research integrates both classical optimization techniques and advanced metaheuristic methods, with a particular emphasis on Genetic Programming (GP), to assess the effectiveness of various heuristics. The study systematically compares the performance of these approaches in terms of both accuracy and computational efficiency using two well-known datasets. To rigorously evaluate the generalizability of the heuristics, an extensive random dataset of 10,000 instances, drawn from a vast population of approximately 24 billion instances, was generated and employed in this study. Our findings reveal that the exact solution provided by the Federgruen-Zheng Algorithm consistently outperforms hybrid heuristics in terms of computational efficiency, confirming its reliability in smaller datasets where precise solutions are critical. Additionally, the extended Cooperative Coevolutionary Genetic Programming (eCCGP) heuristic proposed by Lopes et al. emerges as the most efficient in terms of runtime, achieving a remarkable balance between speed and accuracy, with an optimality error gap of only 1%. This performance makes the eCCGP heuristic particularly suitable for real-time inventory management systems, especially in scenarios involving large datasets where computational speed is paramount. The implications of this study are significant for both theoretical research and practical applications, suggesting that while exact solution, i.e., the Federgruen-Zheng Algorithm is ideal for smaller datasets, the eCCGP heuristic provides a scalable and efficient alternative for larger, more complex datasets without substantial sacrifices in accuracy. These insights contribute to the ongoing development of more effective inventory management strategies in environments characterized by stochastic demand.en_US
dc.language.isoen_USen_US
dc.subjectSingle-echelon (r, Q) Inventory Management Policyen_US
dc.subjectStochastic Demanden_US
dc.subjectOptimization Approachesen_US
dc.subjectMetaheuristic Methodsen_US
dc.subjectGenetic Programming (GP)en_US
dc.subjectHeuristics Performance and Generalizabilityen_US
dc.subjectRandom Dataset Evaluationen_US
dc.titleOptimization Approaches for the (r,Q) Inventory Policyen_US
dc.typeThesisen_US
dc.contributor.departmentComputational Engineering and Scienceen_US
dc.description.degreetypeThesisen_US
dc.description.degreeMaster of Science (MSc)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
Moghtader_Omid_2024September_MSc.pdf
Embargoed until: 2025-09-25
2.58 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue