散裝飼料車電腦化派車系統之建置

本文以台灣飼料產業為例，探討如何建置一套符合公司政策規範，同時滿足客戶需求、司機運送意願以及硬體環境限制，且降低整體運送成本的電腦化派車與路線規劃系統。運用系統分析與設計的方法及工具，本研究從下列構面著手進行系統規劃與設計：（1）公司政策的檢討與擬定：配合新規劃技術與理念的引進，對公司原有的政策進行有系統的檢討與重擬；（2）資料的搜集：為滿足司機意願與客戶需求兩項系統規劃的重要目標，本研究透過個別訪談與問卷調查擷取司機意願與客戶需求；（3）運輸網路資料的建置：有別於傳統以距離為考量，本研究採用行車時間進行規劃，運用電子地圖、衛星定位與迴歸分析等工具及技術建置運輸網路資料；（4）核心問題的求解：本研究運用初始派車的概念，搭配一個新的先分群再定路線啟發式解法與隨機搜尋機制，求解核心的多桶格車輛途程問題；（5）系統的連結與測試：設計本系統與公司內相關系統的連結介面，並進行測試分析。

關鍵字

運輸規劃；運輸網路；系統分析與設計；多桶格車輛途程問題；啟發式解法

並列摘要

Taking Taiwanese animal feed industry as an example, this paper explores how to construct a computerized vehicle routes planning system that conforms to the company's policy, meets customer needs, driver's willingness to transport, and hardware environment restrictions, and reduces the overall transportation cost. Using the methods and tools of systems analysis and design, this study starts with the following dimensions to carry out systematic planning and design: (1) the review and formulation of company policy: with the introduction of new planning technologies and concepts, a systematic review and re-engineering of the company's policies is carried out; (2) data collection: to meet the driver's willingness and the customer needs, this study obtains the driver's willing and customer needs through individual interviews and questionnaires; (3) construction of the transportation network data: the tools and technology of electronic maps, global positioning system and statistical regression analysis are used in constructing the transportation network data; and instead of the traditional use of distance, the transportation time is used; (4) solution of the core problem: with the concept of initialized dispatching, a new cluster-first route-second heuristic combined with random search mechanism is proposed to solve the core problem of multi-compartment vehicle routing; (5) linkage and testing of the system: design the interfaces between the system and the relevant systems within the company, and then perform the system testing.

並列關鍵字

Transportation planning ； Transportation network ； Systems analysis and design ； Multi-compartment vehicle routing ； Heuristic algorithms

參考文獻

林高正、曾文宏、陳建甫、蔡巧卿 (2018)，以混合基因演算法求解多桶格車輛途程問題，管理資訊計算 7 (S1)，126-136。 doi: 10.6285/MIC.201808_7(S1).0013

林高正、曾文宏、陳建甫、蔡巧卿 (2017)，以先集群再定路線法求解多桶格車輛途程問題，管理資訊計算 6 (S1)，149-160。 doi: 10.6285/MIC.6(S1).13

Laporte, G. (1992), The vehicle routing problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59 (3), 345-358. doi: 10.1016/0377-2217(92)90192-C

Prim, R.C. (1957), Shortest connection networks and some generalizations, Bell System Technical Journal 36, 1389-1401. doi: 10.1002/j.1538-7305.1957.tb01515.x

Toth, P. and Vigo, D. (2002a), Models, relaxations and exact approaches for the capacitated vehicle routing problem, Discrete Applied Mathematics 123, 487-512. doi: 10.1016/S0166-218X(01)00351-1

國際替代計量

散裝飼料車電腦化派車系統之建置

全文下載

主題瀏覽