研究結論

放眼當今產業，供應鏈已邁向整合之趨勢發展，而傳統將上、下游分開 的供應鏈已不適用於現今產業之營運模式，因此必須有效率地重新規劃適合 現今產業營運之供應鏈整合模式。本研究著重於整合供應鏈中生產排程與物 流配送兩階段之最小總成本，利用基因演算法可快速尋優的特性，建構出一 套適合整合供應鏈中生產排程與物流配送兩階段模式，且此模式應用在模擬 之三種不同的案例上皆有相當不錯的成果。

根據本論文模式建立之過程，與其他整合供應鏈兩階段之研究相比較，

可歸納出本論文的貢獻如下：

1、 在求解方面：本研究針對整合供應鏈兩階段問題而設計之基因演算 法，無論在求解時間以及改善率上皆有非常顯著的效果，且不受所輸 入之資料不同而有所影響，有相當的穩定度，因此本研究所設計之演 算法非常適用在此類之問題上。

2、 在成本方面：有效控管成本是所有企業在從事生產活動最關切的議題 之一。供應鏈整合的擬定除了須滿足顧客需求，配合廠商本身資源外，

最重要的是能提升效率且降低訂單之完工成本，因此本研究考量總成 本之最小化，使企業能以最低之成本完成整合供應鏈之規劃。

3、 在學術方面：由於整合供應鏈之生產排程與物流配送兩階段並最小化 其總成本問題，是一個全新的研究領域，相關之中外文獻中尚未見到 使用演算法求解此問題，故本研究可供往後發展其他目標函數或整合 供應鏈中不同階段的相關研究之用。

4、 在實務方面：雖然本研究並非針對某特定企業，但由於現今產業競爭 日趨激烈，且消費者要求的服務水準逐漸提升，整合生產排程與物流

配送兩階段的型式已是現今產業界之經營模式，且此現象將持續增 加，故本研究結果可供企業參考。

5.2 建議及未來研究

本研究對後續研究有以下三點建議：

1、過去研究供應鏈之文獻，由於資料取得困難，因此大多使用電腦模擬之資 料以驗證所提方法之有效性。本研究未來可針對特定產業之真實資料加以 驗證，以提升本研究方法之真實性。

2、由於整合供應鏈是一個全新的研究領域，在建構模式時會有諸多的假設條 件，因此未來之研究可將部份之假設條件移除，如加入整備時間、卸貨時 間或時窗限制等條件。

3、在任何問題中，基因演算法中的參數如交配率或突變率之設定並非為一特 定值，大多皆只是可接受之適用值，故未來可探討基因演算法中參數之較 佳設定值，以增加求解之效率。

參考文獻

[1] 王生德，「以巨集啟發式方法求解時窗限制回程取貨車輛路線問題(VRPBTW)之 研究」，中華大學，科技管理研究所，碩士論文，民國93年。

[2] 陳正雄，「塔布搜尋法在塑化業排程之應用-以 BOPP FILM 為例」，元智大學，

工業工程與管理學院，碩士論文，民國 89 年。

[3] 陳宏源，「應用基因演算法於營建作業流程模擬-多目標資源最佳化之研究」，朝 陽科技大學，營建工程系，碩士論文，民國 91 年。

[4] 徐烈昭，「應用塔布搜尋法於非等效平行機台之研究－以 PCB 鑽孔作業為例」，

元智大學，工業工程與管理學院，碩士論文，民國 90 年。

[5] 蕭陳鴻，「基因演算法於非等效平行機台排程之應用」，元智大學，工業工程與 管理學院，碩士論文，民國 90 年。

[6]Anagnostopoulos, G. C. and Rabadi, G., “A Simulated Annealing Algorithm for the Unrelated Parallel Machine Scheduling Problem,” The Fifth Bi-annual World Automation Congress (WAC), the Eighth International Symposium on

Manufacturing and Applications 3, Florida, Orlando, June 9-13, 2002.

[7]Aziziglu, M. and Kirca, O., ”Trandness Minimization on Parallel Machines,”

International Journal of Production Economics.55, 163-168, 1998.

[8]Barbarosoglu, G. and Ozgur, D., “A Tabu Search Algorithm for Vehicle Routing Problem ,” Computer and Operation Research 26:2, 25-71, 1999.

[9]Barrie, M. and Ayechew, M. A., “A Genetic Algorithm for the Vehicle Routing Problem,” Computers &Operation Research 30: 787-800, 2003.

[10]Badeau, P., Guertin, F., Gendreau, M., Potvin, J. Y. and Taillard, E.,“A Parallel Tabu Serach Heuristic for the Vehicle Routing Problem with Time Windows,”

Transportation Research 5:2, 109-122, 1997.

[11]Blanton, J. L. and Wainwright, R. L., “ Multiple Vehicle Routing with and Capacity Constraints using Genetic Algorithms,”Proceeding of the Fifth International Conference on Genetic Algorithms, 452-459, Los Altas , CA, 1993.

[12]Brandao, J. and Mercer, A., “A Tabu Search Algorithm for the Multi-Trip Vehicle Routing and Scheduling Problem,” European Journal of Operational Research 100, 180-191, 1997.

Considerations,” Journal of Scheduling 4, 3-24, 2001.

[14] Duhamel, C., Potvin, J. V. and Rousseau, J. M., “A Tabu Search Heuristic for the Vehicle Routing Problem with Backhauls and Time Windows,”Transportation Science 31:1, 49-59, 1997.

[15] Figielska, E.,” Preemptive Scheduling with Changeovers: Using Column Generation Technique and Genetic Algorithm,” Computers & Industrial Engineering Volume:

37, Issue: 1-2, October, pp. 81-84, 1999.

[16] Garcia, J. M. and Lozano, S., “Production and Delivery Scheduling Problem with Time Windows,”Computers & Industrial Engineering 48 :733-742, 2005.

[17] Glass, C., Potts, C. and Shade, P., ”Unrelated Parallel Machine Scheduling Using Local Search,” Mathematical and Computational Modelling, 20(2):41-52, 1994.

[18] Gendreau, M., Hertz, A. and Laporte, G., “A Tabu Search Heuristic for the Vehicle Routing Problem,” Manegement Science 40: 12 76-90, 1994.

[19] Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Reading, MA：Addison-Wesley, 1989.

[20]Goldberg, D. and R. Alleles, “Loci and the Traveling Salesman Problem,”

Proceedings of the International Conference on Genetic Algorithms and Their Applications, Pittsburgh, Pennsylvania, 154-159, 1985.

[21] Hall, L. A. and Shmoys, D. B., “Jackson’s Rule for Single-Machine Scheduling : Making A Good Heuristic Better,” Mathematics of Operations Research, 17:22-35, 1992.

[22]Hall, N.G. and Potts, C.N., “Supply Chain Scheduling : Batching and Delivery,”

Operation Research,.51:4, 566-584, 2003.

[23] Holland, J. H., “Adaptation in Natural and Artificial Systems,” Ann Arbor, MI： The University of Michigan Press, 1975.

[24] Holland, J. H., “Genetic Algorithms,” Scientific American.267, 66-72, July, 1992.

[25] Hwang, Heung-Suk., ”An Integrated Distribution Routing Model in

Multi-Supply Center System,” International Journal of Production Economics 98, pp.136–142, 2005.

[26] John J. G., ” Optimization of Control Parameters for Genetic Algorithms.” IEEE Transactions on Systems, Man and Cybernetics, SMC--16(1):122--128, 1986.

[27] Johnson, S. M., “Optimal Two-and Three-Stage Production Schedules with Setup Times Include,” Naval Research Logistics Quarterly, 1:61-68, 1954.

[28] Jong , D., “Analysis of Behavior of A Class of A Genetic Adaptive Systems,” Ph. D.

Dissertation, The University of Michigan Press, 1975.

[29] Kise, H., ” An Automated Two-Machine Flowshop Scheduling Problem with Infinite Buffer,” Journal of the Operations Research Society of Japan, 34:354-361, 1991.

[30] Lee, Y. H. and Pinedo, M., ” Scheduling Jobs on Parallel Machines with

Sequence-Dependent Setup Times,” European Journal of Operational Research.100, 464-474, 1997.

[31] Malmborg, C. J., “A Genetic Algorithm for Service Level Based Vehicle Routing Scheduling,” European Journal of Operation Research, 93, 121-134, 1996.

[32] Maggu, P. L. and Das, G., “ 2 x n Sequencing Problem with Transportation Times of Jobs,”Pure and Applied Mathematika Sciences 12:1-6, 1980.

[33]Maggu, P. L., Das, G. and Kumar, R., “Equivalent Job-for-Job Block in 2 x n Sequencing Problem with Transportation Times,” Journal of the OP Society of Japan, 24:136-146, 1981.

[34] Osman, I. H., “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem ,”Operations Research 41, 421-51, 1993.

[35] Park, Y. et al.,” Scheduling Jobs on Parallel Machines Applying Neural Network and Heuristic Rules,”Computers and Industrial Engineering38,189-202, 2000.

[36] Potts, C. N., ”Analysis of a Linear Programming Heuristic for Scheduling Unrelated Parallel Machines,”Discrete Applied Mathematics, 155-164, 1985.

[37] Potts, C. N., ”Analysis of a Heuristics for One Machine Sequencing with Release Dates and Delivery times,” Operations Research 28:1436-1441, 1980.

[38] Potvin, J. Y., Duhamel, C. and Guertin, F., ”A Genetic Algorithm for Vehicle Routing with Backhauling,” Applied Intelligence,6:345-55, 1996.

[39] Potvin, J. Y., Dube, D. and Robillard, C., “A Hybrid Approach to Vehicle Routing using Neural Network and Genetic Algorithms,” Applied Intelligence

6:2 ,41-52,1996.

[40] Piersam, N. and Dijk, W. V., ”A Local Search Heuristic for Unrelated Parallel Machines scheduling with Efficient Neighborhood Search.,” Mathematical and

[41 ] Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice Hall International Series in Industrial and Systems Engineering, New Jersey, 1995.

[42] Rego C, Roucairol C. A parallel Tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman I, Kelly J, editors. Meta-heuristics: theory and applications. Boston: Kluwer, 1996.

[43] Richard, M. K., ” Reducibility Among Combinatorial Problems,” In Complexity of Computer Computations, 85--103. Plenum Press, 1972.

[44] Rochat, Y. and Tailard, E., “Probabilistic Diversification and Intensification in Local Search for the Vehicle Routing ,”Journal of Operations Research, 41:42-51, 1995.

[45] Ruiz, R. A. and Maroto, C. A., ”A Genetic Algorithm for Hybrid Flowshops with Sequence Dependent Setup Times and Machine Eligibility,”. European Journal of Operational Research 169, 781-800, 2006.

[46] Russell, R. A., ”Hybrid Heuristics for the Vehicle Routing Problem with Time Windows,” Transportation Science, 29(2), 156-166, 1995.

[47] Salhi, S., Thangiah, S. R. and Rahnan, F., “A Genetic Clustering Method for Multi-depot Vehicle Routing Problem,” IN: Smith GD, Steel NC, Albrecht RF, editor. ICANNGA’97, Vienna. New York: Springer, p.234-7, 1998.

[48] Schaffer, J.D. Rich, C.,Larry J. E. and Rajarshi D.,

"A Study of Control Parameters Affecting Online Performance of Genetic Algorithms for Function Optimization" in J.D. Schaffer (Ed.), Proceedings of the Third,

International Conference on Genetic Algorithms, CA: Morgan Kaufmann, pp: 51-60, 1989.

[49] Suresh, V. and Dipak, C., “Minimizing Maxmum Tardiness for Unrelated Parallel Machines,”Production Economics 34, 223-229, 1994.

[50] Tailard, E., “Parallel Iterative Search Method for the Vehicle Routing Problems”, Networks 23:661-73, 1993.

[51] Thangiah, S. R., Potvin, J. Y., and Sun, T., ” Heuristic Approaches to Vehicle

Routing with Backhauls and Windows,” Computers & Operations Research, 23(11), 1043-1057, 1996.

[52] http://neo.lcc.uma.es/radi-aeb/WebVRP/

附錄一 顧客距離座標

34 5610 1913 224 5009 1375

70 5306 1748 260 5176 1468

106 5296 1718 296 5423 1505

142 5435 1666 332 5566 1469

178 5490 1636 368 5556 1809 179 5473 1626 369 5418 1818 180 5467 1621 370 5345 1825 181 5466 1593 371 5348 1686 182 5488 1608 372 5357 1558 183 5492 1619 373 5588 1786 184 5473 1582 374 5153 1468 185 5498 1585 375 5708 1347 186 5498 1598 376 5303 1653 187 5184 1614 377 5347 1820 188 5300 1647 378 5487 1547 189 5515 1581 379 5167 1495 190 5504 1632 380 5096 1521

381 5460 1688

382 5675 1187

383 5784 1331

384 5695 1979

385 5059 1597

附錄二 產品加工時間

30 94 89 47 136 71 73 143 74

67 74 72 110 45 48 38 58 105

104 88 71 63 89 56 107 61 109

141 67 75 86 104 105 39 83 52

9 430 415 452 419 425 474 407 428

45 244 267 245 203 183 197 248 239

81 507 449 461 492 462 483 508 446

117 426 411 482 445 483 471 405 404

153 491 407 430 416 480 483 410 467

24 978 950 947 1011 944 1013 1006 1022

61 840 871 847 873 795 857 826 815

98 868 818 833 894 882 898 888 904

135 880 912 918 951 932 891 945 860 136 955 951 901 908 950 911 887 907 137 878 894 911 823 907 844 845 856 138 880 949 954 903 893 939 905 888 139 851 823 908 820 842 859 901 832 140 890 868 914 851 937 864 856 866 141 892 907 850 846 824 895 848 886 142 868 887 869 890 873 909 921 915 143 947 930 918 916 965 959 904 958 144 843 855 832 803 878 881 826 798 145 972 1002 994 996 1003 973 962 990 146 878 899 910 877 886 829 827 846 147 885 877 837 844 853 896 820 838 148 903 862 951 907 923 893 928 908 149 858 894 802 863 871 849 837 805 150 854 855 854 831 796 877 789 786 151 852 826 796 779 855 789 862 844 152 859 831 777 771 796 783 850 786 153 871 930 942 903 901 884 969 939 154 981 942 1004 931 989 912 962 964 155 881 858 869 885 808 859 853 834 156 938 939 882 930 939 923 859 930 157 923 961 897 903 910 893 905 891 158 841 849 868 901 834 846 883 894 159 957 1009 952 1008 1000 1008 953 954 160 791 865 878 806 852 800 822 837

附錄三 各訂單之權重

訂單編號 129 130 131 132 133 134 135 136 權重 0.47 2.56 2.58 6.32 4.3 5.29 7.26 5

訂單編號 137 138 139 140 141 142 143 144

權重 3.25 8.19 1.05 5.27 8.85 1.01 6.98 0.12

訂單編號 145 146 147 148 149 150 151 152

權重 4.68 9.87 6.59 7.18 2.38 7.69 2.54 3.68

訂單編號 153 154 155 156 157 158 159 160

權重 5.96 8.06 3.32 4.61 1.57 0.39 9.71 6.12