用机器学习加速物流网络规划,应对时间不确定和货车不足的挑战。
Adaptive decision-making for stochastic service network design
- 结合模拟与自适应代理模型,用元启发式算法优化运输决策。
- 相比全仿真评估,计算速度提升20倍,目标函数仅差5%。
- 适合需快速响应复杂物流变化的平台或企业使用。
本文研究物流服务商在多式联运货运网络中面临的随机服务网络设计(SND)问题,考虑旅行时间不确定性和卡车资源有限的情况。提出一种两阶段优化方法,融合元启发式、仿真与机器学习技术,将战术决策(如运输请求接受、班列容量预订)与运营决策(如动态卡车分配、路径规划及中断后重规划)一体化求解。采用模拟退火(SA)算法解决战术问题,其性能由基于离散事件仿真的自适应代理模型支持,该模型捕捉了运营复杂性及旅行时间不确定性带来的级联效应。在基准实例上验证:首先在确定性版本中测试SA,结果优于现有最优方法,且计算时间显著降低;随后应用于更复杂的随机问题,相较于需对每组解进行完整仿真的基准算法,该学习型SA生成高质量解,计算效率提升达20倍,目标函数值差距仅5%。实验表明该算法在求解复杂SND问题上表现优异,凸显多种建模与优化技术融合的有效性,为货运调度难题提供高效解决方案。
原文摘要 · Abstract (English)
This paper addresses the Service Network Design (SND) problem for a logistics service provider (LSP) operating in a multimodal freight transport network, considering uncertain travel times and limited truck fleet availability. A two-stage optimization approach is proposed, which combines metaheuristics, simulation and machine learning components. This solution framework integrates tactical decisions, such as transport request acceptance and capacity booking for scheduled services, with operational decisions, including dynamic truck allocation, routing, and re-planning in response to disruptions. A simulated annealing (SA) metaheuristic is employed to solve the tactical problem, supported by an adaptive surrogate model trained using a discrete-event simulation model that captures operational complexities and cascading effects of uncertain travel times. The performance of the proposed method is evaluated using benchmark instances. First, the SA is tested on a deterministic version of the problem and compared to state-of-the-art results, demonstrating it can improve the solution quality and significantly reduce the computational time. Then, the proposed SA is applied to the more complex stochastic problem. Compared to a benchmark algorithm that executes a full simulation for each solution evaluation, the learning-based SA generates high quality solutions while significantly reducing computational effort, achieving only a 5% difference in objective function value while cutting computation time by up to 20 times. These results demonstrate the strong performance of the proposed algorithm in solving complex versions of the SND. Moreover, they highlight the effectiveness of integrating diverse modeling and optimization techniques, and the potential of such approaches to efficiently address freight transport planning challenges.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。