宅配物流中心在商品流通的服務過程中,為滿足消費者的配送需求與追求運輸成本最小化的期望下,希望能迅速地做出最佳的配送路徑決策。此決策不但能增進獲利來達到企業營運所追求的目標,也能提升其本身的服務品質,藉此滿足消費者多變需求下的滿意度。因此,本研究將針對消費者對於產品種類的多樣化需求下,採用先以節省法為基礎,求得一組優良的初始解,再輔以禁忌搜法 (STS) 進行宅配物流中心移步交換與路徑規劃中的車輛途程間之改善,來滿足總配送成本最小化的目標。而在本研究之隨機模擬的測試例題中,所提出之 STS 演算法與最佳化軟體 (LINGO) 的相互比較下,可以發現到本研究所提之STS法可以有效率地求出一組優良的解。然而當問題規模較大時,STS 與 LINGO 的運算時間之差異程度更為顯著,而在求解的效果上,不會有太大的差異。
For the home delivery service industry, the company has to find the shortest delivery path in order to satisfy the consumer’s needs with the minimum of transportation cost. Besides, it increases not only the profits of company but also raises the service qualities of this company to fit the customers’ various demands. In this research, we propose a heuristic method which was based on savings algorithm and tabu search (STS) with move methods and vehicle routing decisions to satisfy the objective of minimum transportation cost. In comparison with the solutions by STS and optimum solutions by LINGO with the simulation test problems, we found that STS had better performance in these test problems. When the problem size becomes larger, the between STS and LINGO solution time becomes significantly different. However, the solutions of the STS approach have no significant difference with that of the LINGO in all test problems.