配銷業?近來紛紛道入配銷需求規劃（DRP）來對存貨及訂購系統進行控制及管理，並統籌設計各配銷中心車輛分派及行走路線之計畫（VRP）。過去文獻曾提出一整合DRP及VRP之數學模式並證明DRP及VRP分別規劃時將造成各自成本最小，無法達成配銷總成本最小化之決策目標。但由於整合之數學模式複雜度太高，往往無法於可接受時間內得出最佳解，因此僅能退而求其次，採用分別規劃法來當作整合規劃法之近似解法/啟發式解法。本研究特針對此目題發展啟發式求解法，而其中之車輛途程部分更使用模擬退火演算法（simulated annealing；SA）之架構。最後並以過去文獻例題及數個自行產生之大型例題來測試此演算法。結果顯示相較於整合規劃數學模式，此演算法可在極短之時間內獲致最佳解或近似最佳解，成功地提升了整合規劃模式之實際應用價值。

　　　　　Conclusion from the literature indicates that minimum total logistic cost would not be resulted when distribution requirements planning (DRP) and vehicle routing decisions (VRP) were not considered simultaneously. The highly complex problem structure of the mathematical program incorporating both DRP and VRP makes it impossible to solve the integration problem. This paper proposes a meta-heuristic based approach, the simulated annealing algorithm, to obtain the optimal or near-optimal solutions. Computational results of the test problems from the literature and generated by this paper confirm the effectiveness and efficiency of the proposed algorithm.