臺灣人文及社會科學引文索引資料庫系統

:::

詳目顯示

回上一頁
第 1 筆 / 總合 1 筆   第一頁 上一頁 下一頁 最後一頁
/1頁
題名：汽車運送業拖車路線規劃問題之研究
作者：林志鴻 引用關係
作者(外文)：Lin, Chih-Hung
校院名稱：國立成功大學
系所名稱：交通管理學系
指導教授：陳春益
曹以明
學位類別：博士
出版日期：2001
主題關鍵詞：汽車運送業；拖車路線規劃問題；車輛排程問題；Auto-Carrier；Tractor Routing Problem；Vehicles Routing Problem
原始連結：連回原系統網址new window
相關次數：
  • 被引用次數被引用次數:期刊(1) 博士論文(1) 專書(0) 專書論文(0)
  • 排除自我引用排除自我引用:0
  • 共同引用共同引用:0
  • 點閱點閱:27
國內每年新車約銷售四十幾萬，如何將新車由集保場(或製造廠)直接配送到各經銷商交車中心或銷售據點為一重要課題。本研究僅針對國內專業汽車運送業之拖車路線規劃問題進行探討，期能藉由有效的進行拖車之路線規劃，進而協助國內汽車製造業或專業汽車運送業進行新車之配送作業。經深入探討此問題之特性知，此路線規劃問題主要考量排程、裝載、回頭車利用與相互支援四個因素，並依是否同時考量上述所提之四個因素，進而研擬六種求解拖車路線規劃問題之方式，而本研究僅以其中之一種求解方式進行拖車之路線規劃。就本研究所採用之求解方式而言，主要是依序考量排程、裝載、回頭車利用與相互支援四個因素，並分三階段處理此拖車路線規劃問題，即分別求解車次規劃子問題、新車裝載子問題、以及拖車途程子問題，且整合此三個子問題之求解結果，以利於拖車之路線規劃。由於此三個子問題可分別視為車輛排程問題、二次指派問題、以及不對稱性多場站車輛排程問題之變化問題，故本研究即先行探討此三個子問題之問題特性、並進行模式之構建與求解等，且整合此三個子問題，期能有效求解拖車之路線規劃問題。
就車次規劃子問題而言，主要依其問題特性直接構建一多元商品網路設計模式，但對較大型之車次規劃子問題，此模式較不易求解，故本研究再依先分區再排路線之啟發法，進而研提一區位基礎啟發模式，以利求解大型車次規劃子問題。就新車裝載子問題而言，本研究則先依二次指派問題之觀念構建一固定性模式求解新車之裝載規劃，但此模式與實務情況略有差異，故本研究再進一步構建一變動性模式，藉以改善固定性模式，較值得一提的是本研究所構建之固定性模式與變動性模式皆為非線性0-1整數規劃模式，就數學規劃之求解經驗而言，此類模式較難求解，而本研究則利用限制式規劃進行求解此類模式，可於極短的時間內求得真正最佳解，其求解成效頗佳，此亦為本研究重要發現之一。就拖車排程子問題而言，本研究則直接研提一拖車排程啟發法進行求解，並配合禁忌搜尋法加以改善。
此外，本研究依各子問題之特性，據以設計測試題目並進行求解分析，經求解結果顯示，本研究所研提求解方法之求解成效頗佳，故進一步進行實例研究，藉以整合此三個子問題以求解拖車路線規劃問題，並與現況之規劃結果進行比較分析，經求解實例之結果顯示，本研究之路線規劃結果將較現況路線之拖車總行車旅程節省約8.7~9.0 % 左右，故本研究成果應可作為後續研究之依循或相關業者之參考。
There are more then 400,000 new automobiles sold in Taiwan every year. Efficiently distribution new automobile from manufacturing centers to dealers is an important problem faced by managers. The study addresses the Tractor Routing Problem (TRP) in auto-carrier to delivery new automobiles such that the total operation cost can be minimized. In fact, the TRP involves four factors is the tractor routing, trailer loading, use the tractor with backhauls and tractor two-way support. Therefore, we plan six methods for solve the TRP from there factors, and we only adopt one of six methods to solve the TRP. The method adopted in the study have involves three steps, separately is routing first, loading second and consider use the tractor with backhauls and tractor two-way support in latest. The steps are called New Automobiles Routing Problem (NARP), New Automobiles Loading Problem (NALP) and Tractor Dispatch Problem (TDP) in sequence, and there problems are belongs to variant of Vehicles Routing Problem (VRP), Quadratic Assignment Problem (QAP) and Asymmetric Multiple Depot Vehicles Routing Problem (AMDVRP). Therefore, we will develop some models and heuristic algorithm to solve NARP, NALP and TDP, and integral their solutions to solve TRP.
First, we develop a multi-commodity network design model to solve NARP, but the model is difficult to solve large scare NARP, and so we develop a location base heuristic model for it, too, and to solve larger scare NARP. Second, we according to the QAP to develop two models, separately call fixation model and variation model, to solve NALP. The different of the two models is the fixation model had not considered new automobiles load place on trailer with reloading, but considered of the variation model. Since the two models is belongs to nonlinear 0-1 integer programming model, and it is more difficult to solve than other model in mathematic programming. But we can efficiently solve the models from Constrain Programming, and one of we important founds. Latest, we develop a new heuristic construction algorithm to solve the TDP followed by a Tabu Search to improve the solution. The computation results of test problems show that the models and the heuristic algorithm can efficiently solve the NARP, NALP and TDP.
Moreover, we select an auto-carrier company in Taiwan as the real world case for study, and the computation result of produced by we develop models and heuristic algorithm show that has saved 8.7~9.0% cost then real world result.
1.宋清貴，應用限制條件邏輯規劃演算法求解發電機組維修排程問題，國立成功大學電機工程研究所碩士論文，民國八十五年。
2.林志鴻、陳春益、曹以明，汽車運送業拖車排程問題之研究，第九屆校際運輸聯誼研討會，頁101-131，民國九十年。new window
3.林志鴻、陳春益、曹以明，汽車運送業拖車調度問題求解之研究，中華民國第五屆運輸網路研討會，頁205-215，民國八十九年。
4.林達民，建構於限制式邏輯程式設計方法之自動排班模型，國立台灣大學資訊工程學研究所碩士論文，民國八十二年。
5.胡志青，建構於限制式邏輯程式設計方法之人員排班系統，國立台灣大學資訊工程學研究所碩士論文，民國八十二年。
6.陳春益、余秀梅、李振源，多元動態網路應用在貨櫃曳引車排程問題之研究，82年電子計算機於土木水利工程應用論文集，頁1216-1225，民國八十二年。
7.陳春益、林志鴻、張蕙蘭，網路區位問題應用於車隊管理之探討，中華民國第四屆運輸網路研討會，頁115-125，民國八十八年。
8.陳春益、林志鴻、陳志偉，汽車運送業拖車路線規劃問題之探討，中華民國運輸學會第15屆學術研討會，頁649-658，民國八十九年。new window
9.陳春益、郭振峰，建立物流中心區位模式之研究，運輸計劃季刊，第23卷，第三期，頁305-326，民國八十三年。new window
10.陳柏榮、王國琛，限制規劃Constraint Programming之應用研究 - 以排課問題為例，國立交通大學運輸工程與管理學系畢業專題，民國八十九年。
11.黃木才，貨櫃運輸公司車輛排程問題之研究─模糊多目標遺傳演算法之應用，國立交通大學交通運輸研究所碩士論文，民國八十五年。
12.黃泰原，線性限制傳播演算法之探討及其在專案管理上的運用，國立成功大學工業管理科學研究所碩士論文，民國八十二年。
13.謝玉霜，限制式規劃應用於港區貨櫃場軌道型門式起重機移動路徑之研究，國立成功大學交通管理科學研究所碩士論文，民國九十年。
14.Agbegha, G., Ballou, R. and Mathur, K., “Optimizing Auto-Carrier Loading”, Transportation Science, Vol.32, No.2, pp.174-188, 1998.
15.Ahuja, R. K., Magnanti, T. L. and Orlin, J. B., Network Flows, Prentice-Hall International, Inc., 1993.
16.Bodin, L., Golden, B., Assad, A., and Ball, M., “Routing and Scheduling of Vehicle and Crews: The State of The Art”, Computers and Operations Research, Vol.10, pp.63-211, 1983.
17.Brailsford, S. C., Potts, C. N. and Smith, B. M., “Constraint Satisfaction Problem：Algorithm and Applications”, European Journal of Operational Research, Vol.119, pp.557-581, 1999.
18.Bramel, J. and Simchi-Levi, D., A Location Based Heuristic for General Routing Problem, Operation Research, Vol.43, pp.649-660, 1995.
19.Cela, E., The Quadratic Problem, Kluwer Academic Publishers, 1998.
20.Chao, I.M., Golden, B.L., and Wasil, E., “A New Heuristic for The Multi-Depot Vehicle Routing Problem that Improves Upon Best-Known Solution”, American Journal of Mathematical and Management Science, Vol.13, pp.371-406, 1993.
21.Fischetti, M., Toth, P., and Vigo, D., “A Branch and Bound Algorithm for The Capacity Vehicle Routing Problem on Directed Graphs”, Operations Research, Vol.42, pp.846-859, 1994.
22.Gillett, B.E., and Johnson, J.G., “Multi-Terminal Vehicle-Dispatch Algorithm”, Omega, Vol.4, No.6, pp.711-718, 1976.
23.Gillett, B.E., and Miller, L.E., “A Heuristic Algorithm for The Vehicle-Dispatch Problem”, Operations Research, Vol.22, pp.340-349, 1974.
24.Golden, B.L., Magnanti, T.L., and Nguyen, H.Q., “Implementing Vehicle Routing Algorithms”, Networks, Vol.7, pp.113-148, 1977.
25.Klincewicz, J. G. and Luss, H., Fleet Size Planning when Outside Carrier Available, Transportation Science, Vol.24, No.3, pp.169-182, 1990.
26.Laporte, G., Gendreau, M., Potvin, J.Y., and Semet, F., “Classical and Modern Heuristic for The Vehicle Routing Problem”, International Transactions in Operations Research, Vol.7, pp.285-300, 2000.
27.Laporte, G., Mercure, H., and Nobert, Y., “An Exact Algorithm for Asymmetrical Capacitated Vehicle Routing Problem”, Networks, Vol.16, pp.33-46, 1986.
28.Laporte, G., Nobert, Y., and Taillefer, S., “Solving A Family of Multi-Depot Vehicle Routing and Location-Routing Problems”, Transportation Science, Vol.22, pp.161-172, 1986.
29.Lustig, I., Michel, L. and Puget, J. F., ILOG OPL Optimization Programming Language Reference Manual, M.I.T., 1999.
30.Marriott, K., and Stuckey, P. J., Programming with Constraints：An Introduction, M.I.T., 1998.
31.Paessens, H., “The Savings Algorithm for The Vehicle Routing Problem”, European Journal of Operational Research, Vol.34, pp.336-344, 1988.
32.Pape, U., “Car Transportation by Truck”, in Vehicle Routing：Methods and Studies (B. Golden and A. Assad, eds.), North-Holland Inc., pp.425-437, 1988.
33.Raft, O.M., “A Modular Algorithm for An Extended Vehicle Scheduling Problem”, European Journal of Operational Research, Vol.11, pp.67-76, 1982.
34.Reeves, C. R., Modern Heuristic Techniques for Combinatorial Problem, John Wiley & Sons, Inc., 1993.
35.Renaud, J., Laporte, G., and Boctor, F.F., “A Tabu Search Heuristic for The Multi-Depot Vehicle Routing Problem”, Computers and Operations Research, Vol.23, No.3, pp.229-235, 1996.
36.Teodorovic, D., Transportation Network, Gordon and Breach Science Publishers, 1986.
37.Tillman, F.A., “The Multiple Terminal Delivery Problem with Probabilistic Demands”, Transportation Science, Vol.3, pp.192-204, 1969.
38.Tillman, F.A., and Cain, T.M., “An Upperbound Algorithm for The Single and Multiple Terminal Delivery Problem”, Management Science, Vol.18, No.11, pp.664-682, 1972.
39.Vigo, D., “A Heuristic Algorithm for The Asymmetric Capacitated Vehicle Routing Problem”, European Journal of Operational Research 89, pp.108-126, 1996.
40.Wren, A., and Holliday, A., “Computer Scheduling of Vehicles from One or More Depots to A Number of Delivery Points”, Operations Research Quaterly, Vol.23, pp.333-344, 1972.
 
 
 
 
第一頁 上一頁 下一頁 最後一頁 top
QR Code
QRCODE

臺灣人文及社會科學引文索引資料庫

目前上線人數：585（臺灣：578，外國：7） ／ 本年度總使用人次：1827278 ／ 訪客人次（自102年09月）：67631461
國家圖書館著作權聲明 Copyright © 2013 All rights reserved.
本館地址: 100201臺北市中山南路20號． 本館地圖及交通資訊．
總機：(02)23619132．最佳瀏覽解析度為1024x768以上