新車運送裝載與路線規劃問題：兩階段啟發式演算法

Auto-carrier Transportation Problem: A Two-stage Heuristic Algorithm

本研究探討需考量重裝載成本之新車運送裝載與路線規劃問題，並將其建構為非線性整數規劃模型。本研究研提兩階段的啟發式演算法求解這個新車配送物流問題。第一階段使用最小成本插入法將預定配送至已知目的地之新車指派至配送卡車，直到全部或絕大部分之新車都獲得指派為止；第二階段則改善每一輛配送卡車的初步裝載指派結果，以進一步降低重裝載成本。個案研究顯示所研提的兩階段啟發式演算法之求解績效良好，具有極高的實務應用潛力。

A nonlinear integer programming model is formulated for the auto-carrier transportation problem with consideration of reloading costs. An associated two-stage heuristic algorithm is then proposed for this auto transport logistics problem. In the first stage, the chosen delivery-ready vehicles with known destinations are assigned to the available auto-carriers (ACs), which are routed based on the minimum cost insertion method to fulfill as much as possible the demands of all destinations. In the second stage, the primitive loading assignment made for each AC is improved to further reduce reloading costs. Computational experiments indicate that our two-stage heuristic algorithm performs well, and hence has great potential to be applied in the real situations.