用机器学习优化物流资源调配,兼顾公平与效率。
A Fair OR-ML Framework for Resource Substitution in Large-Scale Networks
- 融合运筹学与机器学习,动态筛选最优资源组合。
- 模型规模减小80%,运行时间降低90%,保持最优解。
- 适合大规模物流调度中需平衡公平与效率的场景。
在大型物流网络中,确保资源在正确的时间和地点可用仍是重大挑战。需求分布不均导致资源流动不对称,引发节点持续失衡。多类型、可互换资源间的替代是缓解失衡的经济有效方式。本文提出一种结合运筹学(OR)与机器学习(ML)的公平资源替代框架。OR部分从公平性角度建模并求解资源替代问题;ML部分利用历史数据学习调度员偏好,引导决策空间智能探索,并通过动态选择每条边上的前κ个资源提升计算效率。该框架生成高质量解集,供调度员权衡选择。研究应用于全球最大的快递公司之一的网络,计算结果表明,相比现有方法,模型规模减少80%,执行时间降低90%,同时保持最优性。
原文摘要 · Abstract (English)
Ensuring that the right resource is available at the right location and time remains a major challenge for organizations operating large-scale logistics networks. The challenge comes from uneven demand patterns and the resulting asymmetric flow of resources across the arcs, which create persistent imbalances at the network nodes. Resource substitution among multiple, potentially composite and interchangeable, resource types is a cost-effective way to mitigate these imbalances. This leads to the resource substitution problem, which aims at determining the minimum number of resource substitutions from an initial assignment to minimize the overall network imbalance. In decentralized settings, achieving globally coordinated solutions becomes even more difficult. When substitution entails costs, effective prescriptions must also incorporate fairness and account for the individual preferences of schedulers. This paper presents a generic framework that combines operations research (OR) and machine learning (ML) to enable fair resource substitution in large networks. The OR component models and solves the resource substitution problem under a fairness lens. The ML component leverages historical data to learn schedulers' preferences, guide intelligent exploration of the decision space, and enhance computational efficiency by dynamically selecting the top-$κ$ resources for each arc in the network. The framework produces a portfolio of high-quality solutions from which schedulers can select satisfactory trade-offs. The proposed framework is applied to the network of one of the largest package delivery companies in the world, which serves as the primary motivation for this research. Computational results demonstrate substantial improvements over state-of-the-art methods, including an 80% reduction in model size and a 90% decrease in execution time while preserving optimality.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。