臺灣博碩士論文加值系統

摘要
在物流配銷系統中，實務上大多只考量運輸路徑成本卻忽略顧客的相關存貨因素，而實際上必須同時考量路徑規劃與相關物流成本，例如存貨成本，才能有效降低總體物流成本。學術研究上，以實務為研究對象的途程規劃結合存貨問題之研究並不多，因而實務規劃與理論研究的結合尚有進步的空間。
因此，本研究針對國內某物流業者的現況，提出存貨途程問題的數學模式，並以節省法配合啟發式解法求出起始解，再以禁忌搜尋演算法改善起始解，求出顧客點的最佳服務水準、經濟訂購量、再訂購點、最適路線的規劃與存貨路徑總成本。本模式所求結果與業者現行路線、將節省法、啟發式解法與所得路線做路線距離成本的綜合比較時，皆顯示本研究之求解結果較好。其中文中所求數據項目可做為業者在規劃運輸路徑時的重要參考依據。

ABSTRACT

Most distribution centers in the real world develop their logistics distribution systems only considering transportation cost, but ignoring other related costs such as inventory carrying cost, shortage cost etc.. In this research, inventory control and vehicle routing problem will be combined together to minimize the total logistics cost. Most literatures of Inventory- Routing problem verified solutions by simulation, but few solved the real case problem of logistics companies. This research will apply some specific real logistics company’s data to study the Inventory- Routing problem.
We first develop a mathematical model for this Inventory-Routing problem, then apply Savings method and heuristic approaches to obtain the initial feasible solution, finally implement Tabu Search algorithm to find the optimal solution. The numerical examples are illustrated to acquire the optimal delivery route, and related economic order quantity, optimal service level and reorder point of the customers located in this proposed route. The results show this model can be successfully applied in Inventory-Routing problem in a very efficient way. Finally, the performance of this proposed model are compared with Saving method, heuristic approach, and current routing planning implemented by this specific logistics company. The outcomes are very promising in many aspects and should be helpful to this logistics company for their future planning.

目錄
摘要……………………………………………………………………………Ⅰ
ABSTRACT………………………………………………………………………Ⅱ
誌謝……………………………………………………………………………Ⅲ
目錄……………………………………………………………………………Ⅳ
圖目錄…………………………………………………………………………Ⅶ
表目錄…………………………………………………………………………Ⅷ
附錄……………………………………………………………………………89
第一章 緒論……………………………………………………………………1
1.1研究背景與動機………………………………………………………1
1.2研究目的………………………………………………………………4
1.3研究流程………………………………………………………………5
第二章 文獻探討………………………………………………………………8
2.1國內物流業現況與發展趨勢…………………………………………8
2.2車輛路徑問題.………………………………………………………11
2.3區位途程問題.………………………………………………………15
2.4存貨路徑問題.………………………………………………………17
2.5區位途程存貨問題.…………………………………………………19
2.6巨集型啟發式演算法………………………………………………21
2.7小結…………………………………………………………………24
第三章 模型之建構.…………………………………………………………27
3.1研究問題.……………………………………………………………27
3.2研究問題與假設.……………………………………………………27
3.3符號說明與定義……………………………………………………28
3.3.1 已知變數與輔助變數……………………………………… 28
3.3.2 決策變數…………………………………………………… 29
3.4建構數學模式.………………………………………………………30
3.4.1限制式之說明…………………………………………………31
3.4.2目標函數成本使用之項目……………………………………32
3.5小結………………………………………………………………… 35
第四章 相關理論與演算工具介紹.…………………………………………36
4.1節省法求解說明………………………………………………………36
4.1.1節省法的特性…………………………………………………37
4.1.2節省法的流程與步驟…………………………………………37
4.2節點插入與交換改善解法……………………………………………41
4.3 禁忌搜尋演算法…………………………………………………… 42
4.3.1禁忌搜尋法的組成因素………………………………………42
4.3.2 禁忌搜尋法的演算步驟…………………………………… 45
4.4本研究模型求解步驟…………………………………………………46
4.4.1 主模式的演算與流程………………………………………47
4.4.2 起始解的演算步驟…………………………………………49
4.4.3改善起始解的演算步驟.……………………………………51
4.5 演算法效果之驗證…………………………………………………53
第五章 範例驗證與分析……………………………………………………57
5.1 研究案例之背景描述………………………………………………57
5.2 參數設定與範例說明………………………………………………58
5.3 各項演算法之路徑結果分析………………………………………60
5.3.1節 現行作業路線分析……………………………………61
5.3.2 存貨路徑成本結果分析…………………………………64
5.3.3 三種路徑的综合比較……………………………………68
5.4 小結…………………………………………………………………70
第六章 結論與未來研究方向………………………………………………72
6.1 研究結論……………………………………………………………72
6.2 未來研究建議………………………………………………………74

圖目錄
圖1-1研究流程圖…………………………………………………………… 7
圖4-1節省法之節省量圖……………………………………………………38
圖4-2節省法運送過程改進方式圖…………………………………………40
圖4-3 2-opt節點交換法示意圖…………………………………………… 41
圖4-4 禁忌名單結構示意圖…………………………………………………43
圖4-5 候選名單結構示意圖…………………………………………………44
圖 4-6 主模式的演算流程圖……………………………………………… 48
圖 4-7 LINGO平均求解時間圖……………………………………………55

表目錄
表2-1產業退貨比率表………………………………………………………10
表2-2 禁忌搜尋法文獻列表…………………………………………………23
表4-1：演算法與LINGO比較表………………………………………………53
表4-2：LINGO 7.0版求解時間測試表………………………………………54
表5-1：相關使用項目名稱表…………………………………………………61
表5-2：各項路徑比較分析表(1)……………………………………………62
表5-3：各項路徑比較分析表(2)……………………………………………63
表5-4：現行路線與演算法成本分析…………………………………………64
表5-5：演算法成本分析表(1)………………………………………………66
表5-6：演算法成本分析表(2)………………………………………………66
表5-7：各門市點的最佳經濟訂購量、再訂購點與服務水準表……………57
表5-8：不同路徑成本的綜合比較表…………………………………………58

附錄
圖一：節省法求解流程圖……………………………………………………90
圖二：禁忌搜尋法流程圖……………………………………………………91
圖三：存貨路徑起始解流程圖………………………………………………92
圖四：存貨路徑改善解流程圖(插入移步階段) …………………………93
圖五：存貨路徑改善解流程圖(交換移步階段) …………………………94
表一：節省法與LINGO求解分析表………………………………………95
表二：啟發式解法與LINGO求解分析表…………………………………96
表三：禁忌搜尋法與LINGO求解分析表…………………………………97
表四：門市點的需求量與需求量標準差列表………………………………98
表五：現行作業路線順序表………………………………………………104
表六：禁忌搜尋法路徑順序表(最短距離模式) …………………………105
表七：各門市點的最佳經濟訂購量、再訂購點與服務水準………………107
表八：禁忌演算法路徑順序(存貨路徑模式) ……………………………113

參考文獻

一、中文部份
王耿彬（2001），「應用遺傳演算法於低溫冷凍物流中心之車輛配送排程規 劃」，朝陽科技大學工業工程與管理系碩士論文，未出版，台中縣。
王璟瑩(1998)，「應用禁忌搜尋法於物流中心區位選擇之研究」，國立雲林 科技大學工業工程與管理研究所碩士論文，未出版，雲林縣。
李洪鑫（2000），「含時間窗車輛途程問題各演算法適用範圍之探討」，東海大學工業工程學系碩士論文，未出版，台中縣。
李順斌(2002)，「物流配銷系統下整合區位途程與存貨問題之研究」，國立屏東科枝大學資訊管理研究所碩士論文，未出版，屏東縣。
李義祥(2005)，「多階層供應鏈配銷批量和車輛途程模式之研究」，國立台灣科技大學工業管理系博士論文，未出版，台北市。
吳參賢(2004)，「建構知識管理架構下存貨決策支援系統—以百貨零售型物流業為例」，私立中原大學資訊管理系碩士論文，未出版，中壢市。
林清河(1995)，物料管理，修訂版，華泰書局，台北市。
林俊志(2002)，「整合區位途程與存貨問題探索解模式之研究」，國立屏東科技大學碩士論文，未出版，屏東縣。
林益洲(2001)，「物流作業流程之模組化應用與研究」，大葉大學資訊管理學系碩士論文，未出版， 彰化縣。
陳昱文(2002)，「物流業決定物流中心區位因素影響之實證研究—以東源物流等廠商為例」，私立中國文化大學商學院國際企業管理研究所碩士論文，未出版，台北市。
陳契伸（2001），「硬軟性時窗限制之車輛途程問題研究」，中原大學工業工程學系碩士論文，未出版，中壢市。
陳勝男(1996)，「禁忌搜尋法應用於車輛路線問題之研究」，大葉大學工業工程研究所碩士論文，未出版，彰化縣。
陳杰煌(2004)，「階層式雙重界限串列:一個可以處理大量電路模組之多層板面規劃表示式」，中華大學資訊工程學系碩士論文，未出版，新竹市。
莊志諒(1988)，「配銷網路之設計研究」，國立交通大學運輸研究所碩士論文，未出版，新竹市。
黃玉真(2004)，「探討多期配送系統設計問題之研究-以預算與服務水準條件限制之角度」，國立高雄第一科技大學運輸與倉儲營運系碩士論文，未出版，高雄市。
黃詩彥(2000)，「企業逆物流之探索與研究」，東吳大學企業管理學系碩士論文，未出版，台北市。
張容瑄（2002），「模擬退火法在校車路線問題上的應用」，國立中正大學數學研究所碩士論文，未出版，嘉義縣。
楊雅惠(2004)，「供應鏈網路下整合存貨管理與車輛途程設計之研究」，國立東華大學企業管理研究所碩士論文，未出版，花蓮縣。
鄭新強(2003)，「供應鏈運輸暨存貨成本的策略研究」，中原大學工業工程研究所碩士論文，未出版，中壢市。
鄭偉平(2004)，「華文圖書出版的供應鏈管理---探討逆物流」，國立高雄第一科技大學運輸與倉儲營運系碩士論文，未出版，高雄市。
顏憶茹、張淳智(2001)，「物流管理：原理、方法與實例」三版，前程企業管理有限公司，三重縣。
簡世釗(2001)，「時窗與容量限制下車輛途程問題之研究」，國立成功大學工業管理學系碩士論文，台南市。
羅中育，「田口品質工程應用於模擬退火法參數組合之研究---以旅行推銷員問題(TSP)為例」，國立雲林科技大學工業工程與管理研究所碩士論文，未出版，雲林縣。
蘇雄義(2003)，「物流管理彙論」，華泰文化，台北市。
蘇雄義(2005)，「物流與運籌管理：觀念、機能、整合」第二版，華泰文化，台北市。
二、英文部分
Ann Melissa Campbell and Martin W.P. Savelsbergh (2004), A decomposition Approach for the Inventory – Routing problem. Transportation Science, Vol.38, No.4, pp. 488-502.
Ballou R. (2001), Unresolved issues in supply chain design. Information Systems Frontiers, Vol. 3/4 pp.417-26.
Baker B. M. and Ayechew M. A.(2003), Genetic Algorithm for The Vehicle Routing Problem. Computers and Operations Research, Vol.30, pp. 787-800.
Barrie M. Baker, M.A. Ayechew (2003), A genetic algorithm for the vehicle routing problem. Computer & Operations Research ,30 ,pp. 787-800.
Berger, J., and Barkaoui, M. (2004), A parallel Hybird Genetic Algorithm for the Vehicle Routing Problem with Time Windows. Computer and Operations Research, Vol. 31, pp. 2037-2053.
Beltrami F. and L. Bodin (1974), Networks and Vehicle routing for municipal waste collection. Networks, 4, pp. 65-94.
Bodin and Golden (1981), Classification in vehicle routing and scheduling. Networks, Vol. 11, pp. 97-108.
Bramel J. and Simchi-Levi (1997), The Logic of Logistics. Springer, New Nork.
Brandao J.(2004), A Tabu Search Algorithm for The Open Vehicle Routing Problem. European Journal of Operational Research 157 , pp.552-564.
Bertazzi L., Paletta, G. and Sperana, M.G. ( 2002), Deterministic Order-Up-To- Level Policies in an Inventory Routing Problem. Transportation Science, 36(1), pp. 119-132.
Breedam V. (1995), Improvement Heuristics for the Vehicle Routing Problem. European Journal of Operational Research, Vol. 86, pp. 480-490.
Bonimi, E. and J. Lutton (1984), The N-city Traveling Salesman Problem：Statistical Mechanics Algorithm and Metropolis Algorithm. SALM Review, Vol.26, No.4, pp.551-568.
Bodin, L., Golden, B.L., Assad, A., and Ball, M.(1983), Routing and Scheduling of Vehicle and Crew：The State of Art. Computer and Operations Research, Vol. 10, pp. 63-211.
Bowerman, R.L., P.H. Calamai and G.B. Hall (1994), The Spacefilling curve with optimal partitioning heuristic for the vehicle routing problem. European Journal of Operational Research, 76, pp. 128-142.
Campbell, A. and M. Savelsbergh( 2004), A Decomposition Approach for the Inventory Routing Problem. Transportation Science, Vol. 38, No. 4, pp.488-502.
Christofides, N. and J. Beasley (1984), The period routing problem. Networks, 14, pp. 237-256.
Chen, T.K., Hay, L.L., and Ke, O. (2001), Hybrid Genetic Algorithm in Solving Vehicle Routing Problem with Time Window Constraints. Asia-Pacific Journal of Operational Research, Vol. 18, pp. 121-130.
Choi, I.C., Kim, S.I., and Kim, H.S. (2003), A Genetic Algorithm with a mixed Region Search for the Asymmetric Traveling Salesman Problem. Computers and Operations Research, Vol. 30, pp. 773-786.
Carlos F. Daganzo, Lawrence D. Burns, Randolph W. Hall and Dennis E. Blumenfeld (1985), Distribution Strategies that Minimize Transportation and inventory costs. Operations Research , Vol. 33, No.3. pp. 469-490.
Charles J. Malmborg (1996), A genetic algorithm for service level based vehicle scheduling. European Journal of Operational Research, 93, pp. 121-134.
Cedric Davies and Pawan Lingras (2003), Genetic algorithm for routing shortest paths in dynamic and stochastic networks. European Journal of Operational Research, 144, pp. 27-38.
C. Archetti, M. G. Speranza and A. Hertz (2006), A tabu search Algorithm for the spilt Delivery Vehicle Routing Problem. Transportation science , Vol. 40 , No.1, pp. 64-73.
Christofides N. , A. Mingozzi, P. Toth, and C.sandi (1979), Combinatorial Optimization. John Wiley & Sons, pp. 318-338.
Cesar Rego(1998), A subpath Ejection Method for the vehicle routing problem. Management Science Vol. 44, No.10 . pp.*****
Cardoso M.F., R.L. Salcedo, and S.F. de Azevedo(1994), Non equilibrium simulated annealing：A faster approach to combinatorial minimization. Industrial Eng’g Chemical Research, Vol. 33, pp.1908-1918.
Dilek Tuzun and Laura I. Burke (1999), A two-phase tabu search approach to the location routing problem. European Journal of Operational Research, 116, pp. 87-99.
D.K. GUPTA (2002), A new Algorithm to solve vehicle routing problems (VRPs). Intern. J. Computer Math., Vol. 80(3), pp. 267-274.
D.K. GUPTA (2003), Tabu search for vehicle routing problems (VPRs). Intern. J. Computer Math. Vol.79 (6), pp. 693-701.
Daskin M. and S. Mark (1995), Network and Discrete Location. JOHN WILEY & SON, INC.
Danting, G.B. and J.H. Ramser (1959), The Truck Dispatching Problem. Management Science, Vol. 6, pp. 80-91.
Davis, R. A., Markland, R. E. and Vickery, E. K. (1998), Operation Management. 2nd, Ohi0：South-Western College Publishing.
Dror, M. and Ball, M. (1987), Inventory/Routing：Reduction from an Annual to a Short-Period Problem. Naval Research Logistics, 34, pp. 891-905.
El-Houssaine Aghezzaf, Birger Raa and Hendrik Van Landeghem (2005), Modeling inventory routing problems in supply chains of high consumption products. European Journal of Operational Research, 169, pp.1048-1063.
Frederic Semet and Eric Taillard (1993), Solving real-life vehicle routing problems efficiently using tabu search. Annals of operations Research, pp. 41469-488.
Federgruen, A. and Zipkin, P. (1984), A Combined Vehicle Routing and Inventory Allocation Problem. Operation Research, 32(5), pp. 1019-1036.
Frank Schultmann, Moritz umkeller and Otto Rentz (2006), Modeling reverse logistics tasks within closed-loop supply chains：A example from the automotive industry. European Journal of Operational Research, Vol.171, pp. 1033-1050.
Frank Schultmann ,Moritz Zumkeller and Otto Rentz (2006), Modeling Reverse Logistic Tasks Within Closed-Loop ：An example from the automotive industry. European Journal of Operational Research 171 , pp.1033-1050.
Forgarty et al.(1991), Production and Inventory Management. South-Western.
Gillete, B.E. and L.R. Miller (1974), A Heuristic algorithm for the vehicle dispatch problem, Operation Research. Vol. 22, pp. 340-349.
Glover B. (1977), A Statistic approach to the TSP. Networks, Vol. 7, pp. 205-229.
Gallego, G. and Simchi-Levi, D. (1990), On the Effectiveness of Direct Shipping Strategy for the One-Warehouse Multi-Retailer R-System. Management Science, Vol.36, No. 2, pp. 240-243.
G. Clarke and J. W. Wright(1964), Scheduling of vehicles from a Central Depot to a Number of delivery points. Operations Research Vol. 12, No.4, pp. 568-581.
Gregory A. DeCroix and Paul H. Zipkin (2005), Inventory Management for an assembly system with product or component returns. Management Science, Vol. 51, No.8, pp. 1250-1265.
Glover F.(1989), Tabu Search-Part Ⅰ, ORSA Journal on Computing Vol.13,No.3, pp.190-206.
Glover F. (1990), Tabu Search-Part Ⅱ, ORSA Journal on Computing Vol.2,No.1, pp.4-32.
Glover F. (1990), Tabu Search：A Tutoorial. Interfaces, Vol.20, pp. 74-94
Golden B., Assad and Dahl, R. (1984), Analysis of a Large Scale Vehicle Routing Problem with an Inventory Component. Large Scale System, Vol.7 pp. 181-190.
Gaudioso M. and G. Paletta (1992), A heuristic for the periodic vehicle routing problem. Transportation Science, 26, pp. 86-92.
Glover F., and Laguna, M. (1997), Tabu Search. Kluwer Academic Publishers.
Glauber, R.J.(1963), Time dependent statistics of the Ising model. J. Mathematical Physics, vol. 4, pp. 294.
Harris, F. W. (1913), How Many Parts to Make at Once, Factory. The Magazine of Management, Vol. 10, pp. 135-136, 152.
Heskett James L. (1966), A Missing Link in Physical Distribution Design. Journal of Marketing, Vol.30, No.4, pp. 37-41.
Ho, W.K., Ang, J.C., and Lim, A. (2001), A Hybrid Search Algorithm for the Vehicle Routing Problem with Time Windows. International Journal on Artificial Intelligence Tools, Vol. 10, No. 3, pp. 431-449.
Ibrahim Hassan Osman (1993), Metastrategy simulated annealing and tabu search algorithm for the vehicle routing problem. Annals of Operations Research, 41, pp. 421-451.
José Brandão (2004), A tabu search algorithm for the open vehicle routing problem. European Journal of Operational Research. 157, pp. 552-564.
John Holland, (1975), Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
Keely L. Croxton and Walter Zinn (2005), Inventory Considerations in Networks Design. Journal of Business Logistics. Vol. 26, No.1, pp.149-168.
Krolak et al. ( 1971), A computational modification to the savings method of vehicle scheduling. Operational Research Quarterly, Vol. 31, pp. 147-184.
Kemal Altinkemer and Bezalel Gavish (1991), Parallel savings based heuristics for the delivery problem. Operations Research Vol. 39, No.3.
Kirkpatric, S. and Gelatt, C.D. (1983) Optimization by simulated annealing. Science, Vol. 220, pp. 671-680.
Kirkpatrick, S. Gelatt, C. D. Jr. and M. P. Vecchi (1983), Optimization by Simulated Annealing. Science, 220, pp. 671-680.
Larson R. C. and A. R. Odoni (1981), Urban Operation Research. Prentice-Hall, New Jersey.
Lin S. (1981), Computer solution of the traveling salesman problem. Bell System Technical Journal, Vol. 44, pp.2245-2269.
Lei Lei, Shugauang Liu, Andrzej Ruszczynski and Sunju Park (2006), On the integrated production, inventory, and distribution routing problem. IIE Transportation,38, pp. 955-970.
M. M. Solomon, Baker, E.K, and Schaffer, J.R. (1988), Vehicle Routing and Scheduling Problems with Time Window Constraints: Efficient Implementations of Solution Improvement Procedures ,Vehicle Routing: Methods and Studies. Elsevier Science Publishers, Amsterdam. pp. 85-105.
Metz, P. J.(1998), Computer Solution of the Traveling Salesman Problem. Bell System Technology Journal, Vol. 44, pp.2245-2269.
Michel Gendreau, Alain Hertz and Gilbert Laporte (1994), A tabu Search Heuristic for the vehicle routing problem. Management Science Vol. 40, No.10.
Marshall L. Fisher and Ramchandran Jaikuma (1981), A Generalized assignment Heuristic for Vehicle Routing. Networks Vol. 11 pp. 109-124.
Michel Gendreau, Alain Hertz and Gilbert Laporte (1994), A Tabu Search Heuristic for the Vehicle Routing Problem. Management Science, Vol. 40, No.10, pp. 1276-1290.
Nirmal Kumar Mandal and Tapan Kumar Roy (2005), A Fuzzy Inventory Problem with Stock Dependent Inventory Costs via Geometric Programming Approach. Tamsui Oxford Journal of Management Science, Vol.21, No.1, pp. 89-98.
Paolo Toth and Daniele Vigo(2003), The Granular Tabu Search and Its application to the Vehicle-Routing Problem. Informs Journal on Computing, Vol. 15, No.4, pp. 333-346.
Patrick Jaillet , Jonathan F. Bard , Liu Huang and Moshe Dror(2002), Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon
Framework, Transportation Science, Vol.36 No.3, pp.292-300.
Perl. J. (1983), A unified warehouse location-routing analysis. UMI, Dissertation Information Service, USA.
Potvin, J.Y., Kervahut, T., Garcia, B.L., and Rousseau, J.M. (1996), The Vehicle Routing Problem with Time Windows Part I：Tabu Search. Informs Journal on Computing, Vol.8, No. 2, pp. 158-164.
Rutenbar, R.A. (1989), Simulated annealing：An overview. IEEE Circuits and Devices Magazine, January, pp. 19-26.
Russell Bent and Pascal Van Hentenryck (2004), A two-Stage hybrid local search for the vehicle routing problem with time windows, Transportation science, Vol. 38, No.4, pp. 515-530.
R. Tavakkoli-Moghaddam, N. Safaei and Y. Gholipour (2006), A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length. Applied Mathematics and Computation, 176 pp. 445-454.
Ruud H. Teunter, Erwin van der Laan and Karl Inderfurth (2000), How to set the holding cost rates in average cost inventory models with reverse logistics. Omega International Journal of Management Science, 28, pp. 409-415.
Ronald H. Ballou (2001), Unresolved Issues in Supply chain Networks Design. Information System Frontiers, Vol. 3, No.4, pp. 417-426.
Ronald H. Ballou (2004), Business Logistics/Supply Chain Management：Planning, Organizing, and Controlling the Supply Chain; Fifth Edition. Pearson Education, Inc., Upper Saddle River, New Jersey, 07458.
Ravi V., Murty B., and Reddy P.(1997), Nonequilibrium simulated-annealing algorithm applied reliability optimization of compels systems. IEEE Trans. Reliability, Vol. 46, pp.233-239.
S. Anily and A. Federgruen (1990), One warehouse multiple retailer systems with vehicle routing costs. Management science, Vol.36, No.1, January.
S.C. Liu and S.B. Lee (2003), A two-Phase heuristic method for the multi-depot location routing problem taking inventory control decisions into consideration. Int. J. Adv Manuf. Technol., 22, pp. 941-950.
S. C. Liu and C. C. Lin (2005), A heuristic method for the combined location routing and inventory problem. Int. J. Adv Manuf. Technol. Vol. 26, pp. 372-381.
Susana Baptista, Rui Carvalho Oliveira and Eduardo Zuquete (2002), A period vehicle routing case study. European Journal of Operational Research. 139, pp. 220-229.
Srivastava R. (1993), Alternate solution procedures for the location-routing problem. Omega International Journal of Management Science, Vol. 21，pp. 497-506.
Simchi-Levi, D., P. Kaminsky and E. Simchi-Levi (2000), Designing and Managing the Supply Chain：Concepts, Strategies, and Case Studies. The Mcgraw-Hil Company, USA.
Thomas D. J. and P. M. Griffin (1996), Coordinated supply chain management. European Journal of Operational Research, Vol. 94, pp. 1-15.
Thompson, P.M. and Psaraftis, H. (1993), Cycle Transfer Algorithm for Muli-Vehicle Routing and Scheduling Problem. Operations Research, Vol. 41, pp. 935-946.
Webb, H. M. J.,(1968), Cost functions in the location of depot for multiple-delivery journeys. Operation Research Quarterly, Vol.19, pp. 311-328.
Wolfe, P. and W. J. Baumol (1958), Warehouse Location. Operations Research, Vol.6 pp. 252-263.
Zhiqiang Lu and Nathalie Bostel (2007), A facility model for logistics systems including reverse flows：The case of remanufacturing activities. Computer & Operations Research ,34 ,pp. 299-323.