透過您的圖書館登入
IP:18.118.140.108
  • 期刊

路線貨運業內部營運規劃之研究

Line-Hual Operational Planning of Time-Definite Common Carriers

摘要


國內路線貨運業者公告費率,收攬零擔貨物,於時效內由托運者送達收貨者。業者內部營運計畫,在托運者時效性要求與業者內部營運作業限制下,規劃貨物路柱、均衡的貨櫃指派,以及班車路線與班表,以達到總營運成本的最小化。實務界以層級式分別規劃求解三個相互影響的子問題。在單一貨櫃型態條件下,本研究構建一營運規劃模式整合貨物排程與均衡貨櫃之班車排程排班問題。同時,提出一分解但逐步回饋之啟發式演算法,以「單一路柱限制之貨物排程模組」求解貨物排程子問題,再以「班車路線調整模組」求解貨櫃均衡之班車排程排班子問題,相互回饋擬定區域性最適營運計畫。最後,以國內第三大路線貨物業者的現行班車路線為起始解,進行實證測試。結果顯示逐步回饋啟發式較層級分解啟發式演算法,能獲取較小的班車車隊規模。同時,以司機「工作時間」為班車選擇策略,較「承載率」之策略,更具營運成本效益。

並列摘要


Time-definte common carriers announce tariff and provide time-guranteed delivery service for small shipment shippers. The line-haul operational planning determines freight routes, balanced trailer movements, and feeder routes and schedules. Even though they are mutually interactive, in practice, they are solved sequencially. In this research, we proposed an integrated model for the line-haul operational planning problem. It simultenously determines freight paths, balanced trailer network, and feeder routes and schedules while meeting the service commitment and operational restrictions, so that the total operating cost keeps to the minimum. We decomposed the problem into two sub-problems, freight routing and trailer-balanced feeder routing and scheduling, with a built-in iterative scheme to realize their mutual impacts. We used the third largest common carrier in Taiwan for numerical testing. The result shows that the integrated model results a small feeder fleet rather than solving two sub-problems sequentially. Furthermore, the on-duty strategy outperforms the load utilization strategy in the selection of feeder schedules.

參考文獻


Akyilmaz, M. O.(1994).An Algorithmic Framework for Routing LTL Shipments.Journal of the Operational Research Society.45(5)
Chestler, L.(1985).Overnight Air Express: Spatial Pattern, Competition and the Future in Small Package Delivery Services.Transportation Quarterly.39(1)
Eckstein, J.Sheffi, Y.(1987).Optimization of Group Line-haul Operations for Motor Carriers Using Twin Trailers.Transportation Research Record.1120
Leung, J. M.Magnanti, T. L.Singhal, V.(1990).Routing in Point-to-point Delivery System: Formulation and Solution Heuristic.Transportation Science.24(4)
Suter, M. J.Nuggehalli, R. S.Zaret, D. R.(1996).INFORMS National Conference.Atlanta, GA.:

被引用紀錄


馬綱廷(2008)。應用蟻群最佳化演算法求解無容量限制p轉運點中位問題〔碩士論文,元智大學〕。華藝線上圖書館。https://doi.org/10.6838/YZU.2008.00112
李冠紘(2015)。社會企業關鍵成功因素之研究-商業模式觀點〔碩士論文,長榮大學〕。華藝線上圖書館。https://doi.org/10.6833/CJCU.2015.00064
陳嘉良(2006)。海運承攬運送業載運規劃問題之探討〔碩士論文,長榮大學〕。華藝線上圖書館。https://doi.org/10.6833/CJCU.2006.00039

延伸閱讀