合并(业务)
网络规划与设计
流量网络
运输工程
运筹学
灵活性(工程)
解算器
计算机科学
服务(商务)
运输理论
工程类
业务
计算机网络
数学优化
经济
营销
管理
程序设计语言
会计
数学
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:2022-07-01
卷期号:56 (4): 1000-1021
被引量:12
标识
DOI:10.1287/trsc.2021.1114
摘要
The scheduled service network design problem (SSNDP) can support planning the transportation operations of consolidation carriers given shipment-level service commitments regarding available and due times. These available and due times impact transportation costs by constraining potential consolidation opportunities. However, such available and due times may be changed, either because of negotiations with customers or redesigned internal operations to increase shipment consolidation and reduce transportation costs. As changing these times can lead to customer service and operational issues, we presume a carrier seeks to do so for a limited number of shipments. We propose a new variant of the SSNDP, the flexible scheduled service network design problem, that identifies the shipments for which these times should be changed to minimize total transportation and handling costs. We present a solution approach for this problem that outperforms a commercial optimization solver on instances derived from the operations of a U.S. less-than-truckload freight transportation carrier. With an extensive computational study, we study the savings potential of leveraging flexibility and the operational settings that are fertile ground for doing so.
科研通智能强力驱动
Strongly Powered by AbleSci AI