近年來配銷業者紛紛導入配銷需求規劃(DRP)來對存貨及訂購系統進行控制及管理。對於配銷中心而言，車輛途程規劃(VRP)是在蒐集各需求點之需求量等資料後，統籌設計車輛分派及行走路線之計畫。由於DRP及VRP分別規劃時往往造成各自成本最小，無法達成配銷總成本最小化之決策目標，因此本研究首先建構DRP之數學模式，再依配銷問題之特性，提出一不同於傳統之VRP數學模式，最後再將兩者結合為一，提出一整合DRP及VRP之數學模式，以達成總成本最小化之目標。但由於整合模式之複雜度太高，因此本研究藉著演算數個自行產生之演算例，進一步分析整合規劃與分別規劃兩者演算結果之差異。結果發現DRP、VRP分別規劃法在16個演算例中之平均誤差率為3.263%。若權衡取捨DRP、VRP整合規劃法之耗時甚久，甚至無法於可接受時間內得出最佳解，則分別規劃法尚可算是一種不錯之近似解法╱啟發式解法。

　　　　　It is well known that the implementation of distribution requirements planning (DRP) has solved actual multi-echelon inventory control problems. The trade-off between inventory holding and transportation costs has been a major concern for researchers to develop integrated model to consider the total cost consist of the ordering, inventory, and transportation cost. Upon the optimal inventory level for each stocking unit on each planning period has been determined, vehicle routing problem (VRP) arises for the decision maker to find the minimal-cost routing plan. Optimal DRP and/or VRP decision alone may not result in the least total logistics cost. This paper proposes a mathematical model integrating both problems into one. From the computational results, the integrated model results in less cost than the summation of costs of DRP and VRP.