臺灣博碩士論文加值系統

國內汽車路線貨運業的服務範圍廣大，為使營運更有效率，通常將其整體載運路網分為(1)外部服務路網，主要於白天透過小型集配車輛與顧客點或代收點進行收送貨的服務，與(2)內部服務路網，利用夜間時段來進行長途的配送。以往的內部服務路網採用直接運輸，但此營運模式的運具負載率低，運輸成本高。本研究認為業者可以參考軸輻式路網的方式，將各區營業所的貨物先集中到各地區的轉運中心，再從各轉運中心選擇一處作為軸心場站以進行越庫作業(Cross docking)；如此將可使運輸更有效率、成本較為降低。
本研究之目的主要針對上述的轉運方式，在考慮實務問題與營運現況的同時，業者在各區的轉運中心擁有月台數量限制，載貨車輛要在同一時間帶(Time Slots)到達軸心場站進行越庫作業，就形成一時間窗的問題。因此 本研究提出一個適合汽車路線貨運業內部營運路網車輛排程之模式，稱之為「多時間帶軸輻式路線問題(Hub-and-Spoke Routing Problem with Multiple Time Slots ,HASRP-MTS)」；並針對HASRP-MTS問題特性設計啟發式解法。該解法主要包含四個步驟：(1) 從所有轉運中心中選擇一處作為軸心場站；(2) 安排轉運中心指派車輛依序進入軸心場站的時間帶；(3) 各轉運中心指派車輛裝載貨物且分批運往軸心場站進行越庫作業；(4) 從軸心場站指派車輛將貨物分送到各轉運中心的路線進行建構。
為了驗證HASRP-MTS之可行性與適用性，本研究依據轉運中心的散佈位置、轉運中心數量、貨物需求量，設計了18種情境，然後每一種情境各產生10個測試例題，總共有180題。本研究以C# 2010語言撰寫啟發式解法的電腦程式，進行測試例題的求解，並進行解題績效分析。結果顯示本研究所設計之啟發式求解方法可有效產生可行的起始解，驗證本研究所提出的HASPR-MTS模式適合應用於汽車路線貨運業的內部路網路線規劃。

To improve the efficiency, the fixed-route trucking carriers build up the operational framework consisting of intra-network and extra-network. Previous operations using the direct network, but this business model shipped with carrier multiplication rate, high transportation costs. Therefore, this study considers that the hub-and-spoke intra-network, i.e. to select one from the distribution centers (DCs) as the hub DC for cross docking, will make transport more efficient, reduce costs more.
Considering of practical situation, the hub DC has a limitation in the number of platforms that will influence the arrangement of vehicles under a time window constraint. Therefore, the purpose of this study is to propose a problem, named as Hub-and-Spoke Routing Problem with Multiple Time Slots (HASRP-MTS) to deal with the route design of intra-network for the fixed route carriers. This study also proposes a heuristic method for solving the HASRP-MTS that includes four-phased steps: (1) to select a station as the hub from all DCs; (2) to dispatch DCs vehicles sequentially into hub at the assigned time slot; (3) to arrange routes of vehicles from DCs to hub for cross docking operations; Finally, (4) to arrange routes of vehicles from hub to DCs from which the vehicle originally leave.
In order to identify the feasibility of HASRP-MTS, this study generate a set of 180 HASRP-MTS instances and codes the computer program of the proposed heuristics in Visual C# 2010 to conduct the computational tests. Experiment results indicated that the proposed heuristics is an efficient and effective method to solve the HASRP-MTS. Furthermore, the HASRP-MTS model is full of potential to the practical application on the intra-network of fixed-route trucking carriers.

摘 要 ..................................i
Abstract .........................ii
目 次 ................................iii
表 次 .................................iv
圖 次 ..................................v
第一章 緒論 ..........................1
1.1 研究背景與動機 ..........................1
1.2 研究目的 ..........................2
1.3 研究範圍與內容 ..........................3
第二章 文獻回顧 ..........................5
2.1 軸輻式路網相關文獻 ..................5
2.2 越庫作業（CROSS-DOCKING）相關文獻 ..6
2.3 汽車貨運業相關文獻 ..................7
2.4 傳統啟發式方法 ..........................9
2.5 小結 .................................11
第三章 研究架構與方法 .................12
3.1 HASRP-MTS問題界定 .................12
3.2 整體解題架構 .........................14
3.3 起始解建構模組 .........................16
第四章 實驗設計與測試結果分析 .........25
4.1 測試例題產生 .........................25
4.2 實驗設計 .........................28
4.3 實驗測試 .........................28
第五章 結論與建議 .................31
5.1 結論 .................................31
5.2 建議 .................................31
參考文獻 .................................33
附錄 A 例題測試實驗之結果彙整表 .........35
附錄 B 部分測試例題求解結果彙整 .........41

1.卓裕仁(2001)。以巨集啟發式方法求解多車種與週期性車輛路線問題之研究。國立交通大學運輸工程與管理學系所，新竹市。
2.韓復華、卓裕仁(2001)。運輸網路分析。台北市：五南圖書出版公司。
3.陳祥禹(2004)。具時效性沿途載運與支線層級軸輻式運輸網路設計。未出版之碩士論文，國立高雄第一科技大學運籌管理系，高雄市。
4.黃紹維(2006)。運用遺傳演算法求解接駁式轉運系統最佳車輛排程之研究。未出版之碩士論文，私立東海大學工業工程與經營資訊研究所，台中市。
5.吳嘉峻(2008)。汽車路線貨運業之混合式軸輻路網設計研究。未出版之碩士論文，私立中華大學運輸科技與物流管理學系碩士班，新竹市。
6.張紹俞(2010)。汽車路線貨運業轉運中心間多車種配送路線規劃之研究。未出版之碩士論文，私立中華大學大學運輸科技與物流管理學系碩士班，新竹市。
7.Bodin, L., Golden, B. L., Assad, A. & Ball, M. (1983). Routing and schedule of vehicle and crew: the state of art. Computers and Operations Research, 10(2), 63-211.
8.Jiyin Liu, Chung Lun Li, Chun Yan Chan (2003). Mixed truck delivery systems with both hub-and-spoke and direct shipment. Transportation Research Part E, 39(2003), 325–339.
9.Andrew Lim, Zhaowei Miao, Brian Rodrigues, and Zhou Xu(2005). Transshipment through Crossdocks with Inventory and Time Windows, Naval Research Logistics. Vol.52, p.724-733.
10.Andrew Lim, Hong Ma, and Zhaowei Miao(2006). Truck Duck Assignment Problem with Time Windows and capacity Constraint in Transshipment Network Through Crossdocks. Lecture Notes in Computer Science. Vol.3982 LNCS, p.688-697.
11.Young Hae Lee, Jung Woo Jung, Kyong Min Lee (2006). Vehicle routing scheduling for cross-docking in the supply chain. Computers & Industrial Engineering, 51(2006), 247–256.
12.Iris F.A. Vis a, Kees Jan Roodbergen (2008). Positioning of goods in a cross-docking environment. Computers & Industrial Engineering, 54(2008), 677–689.
13.Dwi Agustina, C.K.M.Lee and Rajesh Piplani(2010). A Review: Mathematical models for cross docking planning. International Journal of Engineering Business Management,2(2): p.47-54.
14.B. Vahdani, M. Zandieh (2010). Scheduling trucks in cross-docking systems: Robust meta-heuristics. Computers & Industrial Engineering, 58(2010), 12–24.
15.Ching Jong Liao, Yaoming Lin, Stephen C. Shih (2010). Vehicle routing with cross-docking in the supply chain. Expert Systems with Applications, 37(2010), 6868–6873.
16.Rami Musa, Jean Paul Arnaout, Hosang Jung (2010). Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Computers & Industrial Engineering, 59(2010), 85–92.
17.Nils Boysen (2010). Truck scheduling at zero-inventory cross docking terminals. Computers & Operations Research, 37(2010), 32–41.