Dynamic multi-period recycling collection routing with uncertain material quality

被引:0
|
作者
Cuellar-Usaquen, Daniel [1 ]
Ulmer, Marlin W. [2 ]
Antons, Oliver [3 ,4 ]
Arlinghaus, Julia C. [3 ,4 ]
机构
[1] Univ Andes, Ind Engn Dept, Cra 1 18A-12, Bogota 111711, Colombia
[2] Otto von Guericke Univ, Management Sci, Univ Pl 2, D-39106 Magdeburg, Germany
[3] Otto von Guericke Univ, Prod Syst & Automat, Univ Pl 2, D-39106 Magdeburg, Germany
[4] Fraunhofer Inst Factory Operat & Automat, Sandtorstr 22, D-39106 Magdeburg, Germany
关键词
Routing; Circular economy; Sequential decision process; Stochastic lookahead; LOOP SUPPLY CHAIN; NETWORK DESIGN; REVERSE LOGISTICS; INVENTORY; MANAGEMENT; ALGORITHM; POLICIES; DEMAND; YIELD;
D O I
10.1007/s00291-025-00808-z
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
We consider the problem of collecting and processing waste material. At a production facility, a known amount of inventory is required for production (e.g., paper) for every period. Instead of new material, the facility relies on collected and processed waste material (e.g., paper waste). This material is collected from regional waste collection locations. The amount of waste material per location is uncertain, as is the quality of the collected waste, i.e., the resulting inventory when processing the material. If the inventory is insufficient at the end of a period, costly new material must be bought. Each period, decisions are made about how much waste material to collect from which location and how to route the collection vehicles accordingly. Ideally, inventory is built to hedge against quality uncertainty and to ensure efficient routing operations in future periods. We propose a stochastic lookahead method that samples a set of scenarios and solves a simplified two-stage stochastic program in every period. We show the value of our method for two case studies, one based on real-world data from Sachsen-Anhalt, Germany, and one from the literature with data from the United Kingdom. We further conduct a detailed analysis of our method and the problem characteristics. The results show that our method effectively anticipates all sources of uncertainty, reducing cost significantly compared to benchmark policies. This superior performance is due to appropriate state-dependent supplier selection that considers the percentage of material loss, available material, and routing cost for current and future periods.
引用
收藏
页数:44
相关论文
共 50 条
  • [1] Dynamic multi-period vehicle routing with touting
    Keskin, Merve
    Branke, Juergen
    Deineko, Vladimir
    Strauss, Arne K.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 310 (01) : 168 - 184
  • [2] The dynamic multi-period vehicle routing problem
    Wen, Min
    Cordeau, Jean-Francois
    Laporte, Gilbert
    Larsen, Jesper
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (09) : 1615 - 1623
  • [3] Value function approximation for dynamic multi-period vehicle routing
    Ulmer, Marlin W.
    Soeffker, Ninja
    Mattfeld, Dirk C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 269 (03) : 883 - 899
  • [4] Multi-period traffic routing in satellite networks
    Gamvros, Ioannis
    Raghavan, S.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (03) : 738 - 750
  • [5] Modeling and optimizing a multi-period closed-loop supply chain for pricing, warranty period, and quality management
    Keshavarz-Ghorbani, Fatemeh
    Arshadi Khamseh, Alireza
    JOURNAL OF AMBIENT INTELLIGENCE AND HUMANIZED COMPUTING, 2022, 13 (04) : 2061 - 2089
  • [6] A multi-period model for reorganising urban household waste recycling networks
    Zaharudin, Zati Aqmar
    Brint, Andrew
    Genovese, Andrea
    SOCIO-ECONOMIC PLANNING SCIENCES, 2022, 84
  • [7] Adaptive stochastic lookahead policies for dynamic multi-period purchasing and inventory routing
    Cuellar-Usaquen, Daniel
    Ulmer, Marlin W.
    Gomez, Camilo
    Alvarez-Martinez, David
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 318 (03) : 1028 - 1041
  • [8] Dynamic Multi-period Freight Consolidation
    Rivera, Arturo Perez
    Mes, Martijn
    COMPUTATIONAL LOGISTICS (ICCL 2015), 2015, 9335 : 370 - 385
  • [9] Robust Optimization of the Multi-Objective Multi-Period Location-Routing Problem for Epidemic Logistics System With Uncertain Demand
    Long, Shengjie
    Zhang, Dezhi
    Liang, Yijing
    Li, Shuangyan
    Chen, Wanru
    IEEE ACCESS, 2021, 9 : 151912 - 151930
  • [10] Exact solution methods for the multi-period vehicle routing problem with due dates
    Larrain, Homero
    Coelho, Leandro C.
    Archetti, Claudia
    Speranza, M. Grazia
    COMPUTERS & OPERATIONS RESEARCH, 2019, 110 : 148 - 158