傳統上物流中心在進行配送和回收服務時，於車輛途程規畫上多將配送和回收作業分開考量，以致造成空車之無效率問題。對於在回收時間上較不具急迫性，且每期之回收需求量變動相當大的產品或產業，物流中心若能以多期為規畫單位，進行每期配送、回收計畫及車輛途程的安排，將能更有效的利用同時收送貨作業，以降低物流中心的營運成本。由此可見，一個有效率之可同時收送貨物網路下車輛巡行與收送計畫的多期排程求解方法，對物流中心在整體營運成本的降低上，將有極大助益。 研究首先針對影響可同時收送貨物網路下車輛巡行與收送計畫多期排程問題的成本與作業因素做一探討與確認，接著定義相關決策變數並界定模式限制，以方便數學模式的建構。由於車輛途程問題已被證實是一個NP-Hard的問題，而車輛途程問題僅為本研究的一個子問題。因此，本研究以禁忌搜尋法進行求解，先快速求得一個較佳起始解，進而改善最終的近似最佳解。演算法的參數設定、效果╱效率檢定接著依次進行。最後並以參數分析方法，探討模式參數值變動對解的影響，並分析其實務意義，以供未來相關研究或業界之參考。 ; Traditionally, delivery and pickup plans are considered separately by a distribution center (DC) when such services are under design. However, inefficiencies are thus encountered. For products or industries which do not have time-sensitive requirements or whose returns volumes vary significantly, a DC will benefit a lot at cost reduction by conducting such plans with multi-period planning-horizon viewpoint and by fully utilizing simultaneous delivery and pick capability. The research focuses on joint scheduling of simultaneous delivery-and-pickup operation and vehicle routing. First, operational and cost factors for such scheduling problem will be identified. Next, decision variables and constraints of the problem will be defined. The mathematical model is then established for problem solving. Since vehicle routing problem (VRP) is proved to be an NP-Hard problem and VRP is just a sub-problem of the research topic, a tabu-search-based heuristics approach will be proposed for solution methodology. Parameter setting, effectiveness testing, and efficiency comparison of the heuristics will be conducted. The impacts of changes in operational and cost factors on total operating cost will be examined. Their physical meaning will also be discussed.