汽車運送新車配送路線規劃問題之研究

Routing for New Automobiles Distributing in Auto-Carrier

陳春益(Chuen-Yih Chen) ； 林志鸿(Chih-Hung Lin)

《運輸計劃季刊》 32卷1期 (2003/03) Pp. 75-101

https://doi.org/10.6402/TPJ.200303.0075

摘要

国内每年新車约销售四十幾萬輛，如何將新車由集保場（或製造廠）直接地配送到各經銷商交車中心或銷售據點為一重要課題。本研究僅針對負責拖運新車之專業汽車運送業加以探討，經初步了解，汽車運送業者多以拖車及專用板架進行新車之配送作業，並分別依新車配送路線規劃、新車裝載規劃、以及拖車路線規劃三階段進行新車之配送規劃，而本研究僅針對新車配送路線規劃階段之新車配送路線規劃問題加以探討。經初步了解，進行新車之配送路線規劃時，除需考量途程因素外，尚需考量迄點不定與分割載運因素，故此問題實較一般車輛路線問題複雜，而本研究則先依問題特性直接構建一數學模式（稱多元商品網路設計模式），據以求解此問題，並依先分區再排路線之啓發法，研提一啓發模式（稱區位基礎啓發模式），以利於求解大型新車配送路線規劃問題。經求解分析及實例運算結果顯示，此兩個模式之運算績效頗佳，應可提供後續研究之依循或相關業者之參考。

關鍵字

汽車運送業 ； 新車配送路線規劃問題 ； 區位基礎啓發法

並列摘要

More than 400,000 new automobiles are sold in Taiwan every year. Efficiently distributing new automobiles from manufacturing centers to dealers is an important problem faced by managers. The paper addresses the New Automobiles Distribution Routing Problem (NADRP) in auto-carriers' delivery of new automobiles to dealers. In fact, the NADRP is a variant of the Vehicles Routing Problem (VRP) which belongs to a variant of NP-hard. In the paper, a mathematical programming model is built and we develop a location-based heuristic model to solve the NADRP. The computational results of case study have shown that the models can efficiently solve the NADRP.

並列關鍵字

Auto-carrier ； New automobiles distribution routing problem ； Location based heuristic

參考文獻

Bodin, L.Golden, B.Assad, A.Ball, M.(1983).Routing and Scheduling of Vehicle and Crews: The State of the Art.Computers and Operations Research.10

Laporte, G.Gendreau, M.Potvin, J. Y.Semet, F.(2000).Classical and Modern Heuristic for the Vehicle Routing Problem.International Transactions in Operations Research.7

Ahuja, R. K.Magnanti, T. L.Orlin, J. B.(1993).Network Flows.Prentice-Hall International, Inc..

Bramel, J.Simchi-Levi, D.(1995).A Location Based Heuristic for General Routing Problem.Operation Research.43

Teodorovic, D.(1986).Transportation Network.Gordon and Breach Science Publishers.