考量板架具相同裝載限制之新車配送路線規劃問題

New Auto Distribution Routing Problem with Same Trailer Loading Constraints

國內每年新車約銷售四十幾萬輛，如何將新車由集保場（或製造廠）直接地配送到各經銷商交車中心或銷售據點為一重要課題。經實地訪查了解，國內之專業汽車運送業多是利用拖車與專用板架將新車由集保場運送到交車中心，並分新車配送路線規劃、新車裝載規劃、以及拖車路線規劃等三階段進行新車運送作業，由於業者進行第一階段之新車配送路線規劃時，並未同時考量新車與板架間之裝載限制，可能使其路線規劃完成後，新車無法全部裝載於板架上，進而增加配送成本，為改善此現象，本研究則同時考量新車裝載限制條件進行新車配送路線規劃，且假設所有板架裝載限制均相同，並稱此問題為考量板架具相同裝載限制之新車配送路線規劃問題。本研究除依其問題特性直接構建數學模式規劃新車之配送路線外，亦進一步研提啟發法，以便於求解較大規模之新車配送路線規劃問題，據求解結果顯示，數學模式與啟發法之求解結果均能符合問題特性，故其研究成果，實可供後續研究或相關業者之參考。

In Taiwan, more than 400,000 new autos are sold every year. Thus distributing these new autos from manufacturing centers to dealers in an efficient manner is an important issue. In real world, the auto carrier uses tractors and trailers to distribute new autos to dealers. The distribution planning process includes three stages: first, planning on the new auto distribution route; next, planning on the loading of new autos into trailers; finally, planning on the tractors' route. If the new autos are unable to be completely loaded into the trailer based on route planning of the first stage, the auto carrier will need to reroute to improve the loading of autos. The process of rerouting will increase the operation time and cost. Therefore, this paper integrates the loading factors into the route planning process and this problem is called the new auto distribution routing problem with same trailer loading constraints. An integer programming model was constructed for solving this problem. Besides, since using the proposed model to solve large-scale problems can be difficult, a heuristic algorithm was developed. The results by applying the model and heuristic algorithm to solve the test problems are conforming to all problem factors. Therefore, the result of this paper can be referenced for future research and by autocarriers.