IDEAS home Printed from https://ideas.repec.org/p/hhs/oruesi/2025_017.html

Iterative Demand Optimization Using the Discrete Functional Particle Method

Author

Listed:

Abstract

Modern companies face immense pressure to accelerate and refine decisions related to product assortment due to rapid changes and growing competition in the retail landscape. The volume, velocity, and volatility of business data make intuitive or situational approaches insufficient. Advances in optimization theory and forecasting models enable the design of robust, flexible decision-support systems that bridge the gap between business intuition and data-driven strategy. In retail, risk manifests primarily through operational inefficiencies, such as capital immobilized in unsold inventory and delayed responsiveness to demand changes. This demands a rethinking of risk modeling tailored specifically to the retail domain. At the same time, simplistic forecasting tools often prioritize short-term fluctuations at the expense of strategic seasonal trends, thereby undermining long-term planning. As a result, there is a critical need for integrated models that combine predictive accuracy with optimization under uncertainty. Such models must not only capture patterns in consumer demand but also align with operational constraints to ensure that solutions are implementable in practice. This work proposes a novel, multi-layered framework for assortment optimization that incorporates two key components: SARIMAX-based demand forecasting and the Discrete Functional Particle Method (DFPM) for iterative optimization. Additionally, we introduce a new operational risk measure Inventory Efficiency Ratio (IER) designed to quantify inefficiencies in the retail pipeline. By embedding these techniques into a unified system, we offer a practical solution for improving capital productivity, reducing inventory holding costs, and enhancing responsiveness in assortment planning. The methodology is validated through realworld data and demonstrates substantial performance improvements over standard planning strategies.

Suggested Citation

  • Drin, Svitlana & Avdieienko, Ivan & Chornei, Ruslan, 2025. "Iterative Demand Optimization Using the Discrete Functional Particle Method," Working Papers 2025:17, Örebro University, School of Business.
  • Handle: RePEc:hhs:oruesi:2025_017
    as

    Download full text from publisher

    File URL: https://www.oru.se/globalassets/oru-sv/institutioner/hh/workingpapers/workingpapers2025/wp-17-2025.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Mårten Gulliksson & Stepan Mazur, 2020. "An Iterative Approach to Ill-Conditioned Optimal Portfolio Selection," Computational Economics, Springer;Society for Computational Economics, vol. 56(4), pages 773-794, December.
    2. Denis Sauré & Assaf Zeevi, 2013. "Optimal Dynamic Assortment Planning with Demand Learning," Manufacturing & Service Operations Management, INFORMS, vol. 15(3), pages 387-404, July.
    3. A. Gürhan Kök & Marshall L. Fisher & Ramnath Vaidyanathan, 2015. "Assortment Planning: Review of Literature and Industry Practice," International Series in Operations Research & Management Science, in: Narendra Agrawal & Stephen A. Smith (ed.), Retail Supply Chain Management, edition 2, chapter 0, pages 175-236, Springer.
    Full references (including those not matched with items on IDEAS)

    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. Mou, Shandong & Robb, David J. & DeHoratius, Nicole, 2018. "Retail store operations: Literature review and research directions," European Journal of Operational Research, Elsevier, vol. 265(2), pages 399-422.
    2. Arhami, Omid & Aslani, Shirin & Talebian, Masoud, 2024. "Dynamic assortment planning and capacity allocation with logit substitution," Journal of Retailing and Consumer Services, Elsevier, vol. 76(C).
    3. Hense, Jonas & Hübner, Alexander, 2022. "Assortment optimization in omni-channel retailing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 124-140.
    4. Francetich, Alejandro & Kreps, David, 2020. "Choosing a good toolkit, II: Bayes-rule based heuristics," Journal of Economic Dynamics and Control, Elsevier, vol. 111(C).
    5. Jalali, Hamed & Carmen, Raïsa & Van Nieuwenhuyse, Inneke & Boute, Robert, 2019. "Quality and pricing decisions in production/inventory systems," European Journal of Operational Research, Elsevier, vol. 272(1), pages 195-206.
    6. Rhodes, Andrew & Watanabe, Makoto & Zhou, Jidong, 2017. "Multiproduct Intermediaries and Optimal Product Range," MPRA Paper 82136, University Library of Munich, Germany.
    7. Bianchi-Aguiar, Teresa & Hübner, Alexander & Carravilla, Maria Antónia & Oliveira, José Fernando, 2021. "Retail shelf space planning problems: A comprehensive review and classification framework," European Journal of Operational Research, Elsevier, vol. 289(1), pages 1-16.
    8. Agrawal, Priyank & Tulabandhula, Theja & Avadhanula, Vashist, 2023. "A tractable online learning algorithm for the multinomial logit contextual bandit," European Journal of Operational Research, Elsevier, vol. 310(2), pages 737-750.
    9. Abdelaziz, Fouad Ben & Maddah, Bacel & Flamand, Tülay & Azar, Jimmy, 2024. "Store-Wide space planning balancing impulse and convenience," European Journal of Operational Research, Elsevier, vol. 312(1), pages 211-226.
    10. Ostermeier, Manuel & Düsterhöft, Tobias & Hübner, Alexander, 2021. "A model and solution approach for store-wide shelf space allocation," Omega, Elsevier, vol. 102(C).
    11. Düsterhöft, Tobias & Hübner, Alexander & Schaal, Kai, 2020. "A practical approach to the shelf-space allocation and replenishment problem with heterogeneously sized shelves," European Journal of Operational Research, Elsevier, vol. 282(1), pages 252-266.
    12. Yu Tian & Sebastian Lautz & Alisdiar O. G. Wallis & Renaud Lambiotte, 2021. "Extracting Complements and Substitutes from Sales Data: A Network Perspective," Papers 2103.02042, arXiv.org, revised Aug 2021.
    13. Gel, Esma S. & Salman, F. Sibel, 2022. "Dynamic ordering decisions with approximate learning of supply yield uncertainty," International Journal of Production Economics, Elsevier, vol. 243(C).
    14. Felix Prause & Kai Hoppmann-Baum & Boris Defourny & Thorsten Koch, 2021. "The maximum diversity assortment selection problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(3), pages 521-554, June.
    15. Dipankar Das, 2023. "A Model of Competitive Assortment Planning Algorithm," Papers 2307.09479, arXiv.org.
    16. Taras Bodnar & Stepan Mazur & Hoang Nguyen, 2024. "Estimation of Optimal Portfolio Compositions for Small Sample and Singular Covariance Matrix," Springer Books, in: Sven Knoth & Yarema Okhrin & Philipp Otto (ed.), Advanced Statistical Methods in Process Monitoring, Finance, and Environmental Science, pages 259-278, Springer.
    17. Transchel, Sandra, 2017. "Inventory management under price-based and stockout-based substitution," European Journal of Operational Research, Elsevier, vol. 262(3), pages 996-1008.
    18. Debjit Roy & Eirini Spiliotopoulou & Jelle de Vries, 2022. "Restaurant analytics: Emerging practice and research opportunities," Production and Operations Management, Production and Operations Management Society, vol. 31(10), pages 3687-3709, October.
    19. Lacroix, Rachel & Seifert, Ralf W. & Timonina-Farkas, Anna, 2021. "Benefiting from additive manufacturing for mass customization across the product life cycle," Operations Research Perspectives, Elsevier, vol. 8(C).
    20. KabirMamdouh, Alireza & Kök, A. Gürhan, 2025. "A personalized content-based method to predict customers’ preferences in an online apparel retailer," International Journal of Production Economics, Elsevier, vol. 280(C).

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    JEL classification:

    • C61 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Optimization Techniques; Programming Models; Dynamic Analysis

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hhs:oruesi:2025_017. 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: the person in charge (email available below). General contact details of provider: https://edirc.repec.org/data/ieoruse.html .

    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.