新車裝載問題之研究

AUTO-CARRIER LOADING PROBLEM

國內每年新車約銷售四十幾萬輛，如何將新車由集保場（或製造場）直接地配送到各經銷商交車中心或銷售據點為一重要課題。經實地訪查了解，國內之新車配送作業，或由汽車製造商、進口商自組車隊加以經營（稱自行經營），或由專業汽車運送業者承接新車配送業務（稱委外經營），且多以拖車及專用板架配送新車。就拖車之路線規劃而言，實務上多依新車配送路線規劃與新車裝載規劃二階段進行（自行經營）、或再配合拖車路線規劃，而分三階段進行（委外經營），而本研究僅針對對應新車裝載規劃階段之新車裝載問題加以探討。經初步了解，此新車裝載問題可視為二次指派問題之變化問題本研究則分別構建二個數學模式（固定性模式與變動性模式），並利用限制，式規劃 (constraint programming, CP)進行求解，經測試結果顯示，其求解成效頗佳，應可提供後續研究之依循或相關業者之參考。

More than 400,000 new automobiles are sold in Taiwan every year. To distribute these new automobiles from manufacturing centers to dealers efficiently is an important issue managers need to deal with. Generally speaking, manufacturers can either distribute the new automobiles themselves, using tractors and trailers, or outsource the process to an outside company. For the former, managers might need to consider routing and loading, the two most common yet crucial factors. In practice, these two problems share a sequential relationship, the former being the pre-requisite of the latter. This paper focused on the loading factor for Auto-carriers, a problem known as Auto-carrier loading problem (ACLP). Attempts were made to minimize the total reloading costs. A nonlinear zero-one integer programming model which belongs to NP-hard is constructed, and is then solved using constraint programming (CP). Computational results indicated that CP could effectively solve ACLP.