網路購物的興起，物流配銷儼然成為供應鏈領域中熱門的研究議題，從龐大的需求中可以發現排程及車輛尋徑的重要性，本研究以平行機器排程問題為基礎，發展出兩階段工作排程問題並同時考量其車輛尋徑之收送貨問題，該問題可因應各種工廠之問題，從中探討要如何花費最少成本與最短工作時間來滿足消費者並達成獲利，必須考量收送貨程序且配合進出工廠之工作序列，兩者同步作業才會更貼近實務操作與需求。因此，本研究提出收送貨間工作排程問題，使用超經驗法則演算法與菁英式螞蟻演算法搭配經驗法則來解決，最終以共演化策略滿足所有需求並在有效的工作時間內達到最大效益。經實驗結果可以發現尋徑與排程的最佳組合調配並不是獨立部份解優化即可達成，而是要兩部份的工作搭配，才能成就最佳化目標。

Logistic strategy is a prevalent issue in the supply chain management (SCM) research due to the large demand of on-line purchase, revealing the importance of task scheduling and vehicle routing. Based on the process of parallel machine scheduling, this research developed a two-phase vehicle-routing and task-scheduling model which fits many scenarios of manufacturing. In particular, the aim is to minimize the transportation cost and the makespan by considering the two phases simultaneously. This research also proposed a co-evolution framework combining a hyper-heuristic and an elite ant colony algorithm. The experimental result showed that the optimal solution cannot be obtained simply by concatenating the optimal solution for each separate phase, supporting our claim that the two-phase process is best dealt with by a co-evolution method which compromises between the goals of each phase.

目　次
誌　謝 I
摘　要 II
Abstract III
圖　次 VII
表　次 VIII
第一章　緒論 1
1.1 研究背景與動機 1
1.2 研究目的 2
1.3 論文架構 3
第二章　文獻探討 4
2.1 收送貨問題 4
2.2 排程(Scheduling) 6
2.3 平行機器排程 9
2.4 最佳化演算法 10
2.5 超經驗法則演算法(Hyper-heuristic Algorithm) 11
2.6 螞蟻演算法(Ant Colony Optimization, ACO) 11
第三章　研究方法 13
3.1 問題定義 13
3.2 超經驗法則演算法 19
3.3 螞蟻演算法與Heuristic-A 21
3.4 共演化策略 22
第四章　實驗結果 25
4.1 實例情境說明 25
4.2 實例資料測試 28
4.3 收斂分析 32
4.4 最差例分析 35
4.5 敏感度分析 38
第五章　結論 41
參考文獻 42
圖　次
圖1 單機機器排程示意圖 7
圖2 平行機器排程示意圖 7
圖3 流程式工廠排程示意圖 7
圖4 零工式工廠排程示意圖 8
圖5 開放式工廠排程示意圖 8
圖6 排程整體架構圖 9
圖7 尋徑解 之示意圖 21
圖8 解收送貨間工作排程問題之超經驗法則演算法架構 21
圖9 Heuristic-A詳細步驟 22
圖10 排程解示意圖 22
圖11 共演化策略流程圖 24
圖12 VRPSP範例 27
圖13 Momo藥妝收斂分析圖 33
圖14 康是美藥妝收斂分析圖 34
圖15 Momo藥妝九十五度信賴區間圖 34
圖16 康是美藥妝九十五度信賴區間圖 35
圖17 Momo藥妝最差例分析示意圖 36
圖18 Momo藥妝最差例分析統計直方圖 36
圖19 康是美藥妝最差例分析示意圖 37
圖20 康是美藥妝最差例分析統計直方圖 38
圖21 螞蟻母體數分析 39
圖22 共演化策略次數分析 39
圖23 降低門檻參數 40
表　次
表1 收送貨間工作排程問題模式的變數定義 13
表2 產生實例問題集之實例參數設定 28
表3 30Run二種問題之WCM解 29
表4 Momo藥妝30Run最佳解詳細資訊 30
表5 康是美藥妝30Run最佳解詳細資訊 31

參考文獻
台灣蘋果日報，2013，國際新聞，光棍節網購 日刷2千億，網址：http://www.appledaily.com.tw/appledaily/article/international/20131112/35431315/，上網日期：2013-11-12。
尹邦嚴、莊雅嵐(2013)，一個有效的人工蜜蜂演算法改善燃油效率的接駁式轉運車輛尋徑，第廿四屆國際資訊管理學術研討會(ICIM 2013), 台北, 真理大學, May 25-26, 2013。
Baker, K. R. "Introduction to sequencing and scheduling," John Wiley & Sons, New York, (1974).
Cowling, P., Kendall, G., & Soubeiga, E., "A hyper heuristic approach to scheduling a sales summit," E. Burke and W. Erben, (Eds): PATA2000, LNCS2079, pp. 176-190, (2001).
Dorigo, M., Maniezzo, V. and Colorni, A., “The ant system: An autocatalytic optimizing process”, Technical Report no. 91-016 Revised, Politecnico di Milano, Italy, (1991).
Du, J. O. and Leung Y-T, "Minimizing mean flow time in two-machine open shops and flow shops," Journal of Algorithms, Vol.14, pp. 24-44, (1993).
Dorigo, M., and Gambardella, L. M. "Ant colony system: a cooperative learning approach to the traveling salesman problem," IEEE Transactions on Evolutionary Computation (1:1), pp 190-206, (1997)
Gonzalez, T., and Sahni, S., "Open shop scheduling to minimize finish time," Journal of The Association for Computing Machinery, 23(4), 665-679, (1976).
Glover, F. "Tabu search-part I," ORSA Journal of Computing (1), pp 190-206, (1989).
Holland, J. H. "Adaptation in natural and artificial systems," University of Michigan Press, (1975).
Kennedy, J., and Eberhart, R. "Particle swarm optimization," IEEE International Conference (4), pp 1942-1948, (1995).
Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G. and Shmoys, D. B., "Sequencing and scheduling: Algorithms and complexity," volume 4 of Handbook in Operations Research and Management Science. North-Holland, Amsterdam, (1993).
Pinedo, M., "Scheduling: Theory, Algorithms, and Systems." Prentice-Hall, Englewoog Cliffs, NJ(1995)
Parragh, S. N., Doerner, K. F., and Hartl, R. F. "A survey on pickup and delivery problems : part 2: transportation between pickup and delivery locations," Journal für Betriebswirtschaft (58:2), pp 81-117. (2008a).
Parragh, S. N., Doerner, K. F., and Hartl, R. F. "A survey on pickup and delivery problems: Part I: Transportation between customers and depot," Journal für Betriebswirtschaft (58:1), pp 21-51, (2008b).
Rinnooy Kan, A.H.G. and Zipkin P. "Logistics of Production and Inventory," North-Holland, Amsterdam, pp. 445-522, (1993).
Van Belle J., Valckenaers P., and Cattrysse D. "Cross-docking: state of the art," Omega, vol. 40, no. 6, pp. 827–846, (2012).