arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.02656math.OC
收藏

面向按单再制造系统的近似动态规划

Approximate Dynamic Programming for a Remanufacture-to-Order System

Amirreza Pashapour, Fatemeh Zare Bidaki

AI总结:

本文针对按单再制造系统提出近似动态规划算法,以求解更大规模实例,验证了有核心即满足需求并优先高质量核心的最优策略,展示了ADP在再制造领域的应用潜力。

摘要:

再制造在向更可持续经济转型中至关重要。尽管行业证据凸显了其巨大的市场潜力以及经济和环境效益,再制造在理论研究中仍未得到充分探索。本研究重新审视了一个最先进的按单再制造(RtO)系统,并通过开发一种近似动态规划(ADP)算法来求解更大规模的 RtO 实例,从而提出了一种替代方法。所提出的方法得出的结果与现有的状态依赖、非拥挤策略一致。关键发现包括:只要可再制造的核心可用,满足需求即为最优;并且优先处理最高质量等级的核心。本工作凸显了 ADP 在解决再制造领域问题中的潜力。

英文摘要:

Remanufacturing is pivotal in transitioning to more sustainable economies. While industry evidence highlights its vast market potential and economic and environmental benefits, remanufacturing remains underexplored in theoretical research. This study revisits a state-of-the-art remanufacture-to-order (RtO) system and develops an alternative approach by developing an approximate dynamic programming (ADP) algorithm to solve larger RtO instances. The proposed methodology yields results consistent with existing state-dependent, non-congestive policies. Key findings include the optimality of fulfilling demand whenever remanufacturable cores are available and prioritizing cores of the highest quality level. This work highlights the potential of ADP in addressing problems in remanufacturing domains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑