混凝土是現今營建工程中，使用最普遍也是最多的施工材料之一，在目前講求專業分工的時代，營建工地視其自身情況需要可隨時叫料(貨)施工，不需自行拌和。混凝土在營建原物料中管理的需求程度高，預拌混凝土品質更直接關係到營建工程品質，品質優良的預拌混凝土，除了需要正確合宜的配比設計外，更重要的是拌和、輸送及澆置等作業的相互配合。再者，預拌混凝土之使用具有相當高的時效性，過早或延誤太久到達營建工地之預拌混凝土，皆對營建工程施工品質與施工進度有相當大的影響。因此預拌廠要同時考量運送的即時性與彈性才能建構出有效的預拌車派送排程，以平衡預拌廠與工地間的作業。
近年來隨著整體經濟環境的改變及科技的發展，企業間的競爭非常激烈，因此各企業紛紛致力於建立合適的物流通路，並藉由配送網路系統的建構，降低總營運成本及提升市場競爭力。而在預拌混凝土業聯合所屬的預拌廠亦成為營運的主要策略之一，然而現今以整合形式經營之預拌企業乃未充分利用整合後之優勢，進行系統化的配送，因此整體競爭力並未有效提升。
本研究建構數學方程式與CYCLONE模擬兩種模式，並從簡單的單廠多工地到複雜的多廠多工地模式，配合問題空間大小，分別採用簡單基因演算法及適合於求解排列組合數眾多的快速混雜基因演算法，最後建構一個結合CYCLONE模擬方法、最短路徑法、GPS系統、及快速混雜基因演算法的多廠多工地預拌車最佳派送排程模式，尋求能滿足各工地之需求並且使預拌車在各工地之總等待時間為最少之最佳派送排程；並開發一視覺化操作界面的預拌車配送通用程式－RMCDiSO III，用以輔助調度人員進行預拌車派送排程作業。

RMC (Ready Mixed Concrete) was first introduced into the construction industry in the early twentieth century and has been ever since widely employed. Unlike other types of materials that can be manufactured in advance and stored in the construction site, RMC can only be produced at the time that the job site manager calls for delivering because of the quick solidification of the cement.
Along with the development of the supply chain for the construction industry, as one of the key operations within the supply chain, an efficient RMC delivering process becomes important to both of the RMC batch plant and the construction sites. However, it is troublesome for the RMC batch plant manger to develop the efficient and balanced schedule of dispatching RMC trucks when various construction sites call for delivering in the same short period of time.
This research develops a systematic model based on dispatching center which adopts the CYCLONE (CYCLic Operation Network) simulation technique, shortest path algorithms, GPS (global positioning system), and the fmGA (fast messy genetic algorithms) are incorporated to find the optimal dispatching schedule which minimizes the total waiting duration of RMC trucks at construction sites and satisfies the needs of RMC deliveries from different construction sites. In addition, a user-friendly computer program named “RMC Dispatching Schedule Optimizer III” (RMCDiSO III) is developed to help the dispatching ceneter manager quickly generate an efficiency dispatching schedule.

中文部分
01、 江靜芳，(2000)，「精簡營建於預拌混凝土供應鏈應用之研究」，碩士論文，國立中央大學土木工程研究所。
02、 吳孟璵，(2002)，「GPS環境下公車車輛排班調度專家系統之研究」，碩士論文，國立台灣大學土木工程學研究所。
03、 吳泰熙，陳偉星，張欽智，(1997)，「推銷員旅行問題啟發式解法之發展：禁忌搜尋演算法」，中國工業工程學會八十六年度年會論文集，第93-98頁。
04、 吳獻堂，(2000)，「應用模糊理論與電腦模擬分析營建操作生產力－COST電腦模擬程式之介紹」，碩士論文，朝陽科技大學營建工程系。
05、 吳獻堂、馮重偉，(2003)，「快速混雜基因演算法在預拌混凝土廠派車作業之應用」92年電子計算機於土木水利工程應用研討會與論壇，佳作論文獎，第5頁。
06、 李咸亨，鄭明淵，(1996)，「營建廢土自動管理及決策支援系統(I)」，內政部營建署委託計畫研究報告。
07、 李湘駒，(2002)，「國內預拌混凝土產業關鍵成功因素之研究」，碩士論文，國立中正大學企業管理研究所。
08、 周振源，(2005)，「以供應鏈理論探討營建業作業績效---以預拌廠物料配送為例」，碩士論文，國立台灣科技大學營建工程系。
09、 易德華，(1998)，「軟時窗車輛巡迴問題之研究」，碩士論文，國立中央大學土木工程研究所。
10、 林宏澤、林清泉，(1991)，「系統模擬」，高立圖書有限公司。
11、 林建志，(2000)，「應用全球衛星定位系統於多機具施工作業路徑即時管控之研究－以2D空間之多點管控為例」，碩士論文，國立台灣大學土木工程學研究所。
12、 林恩仕，(2003)，「以派遣中心為基礎之預拌混凝土廠派車模式」，碩士論文，國立成功大學土木工程研究所。
13、 洪轟嘉，(2001)，「結合限制理論與SmartLink電腦模擬之開發以輔助預拌混凝土供應鏈之規劃」，碩士論文，國立中興大學土木工程學系。
14、 張俊彥，(2003)，「GSM及GPS應用於老人監控之研究」，碩士論文，大葉大學，電機工程學系碩士班。
15、 張惠汶，(2001)，「利用公車GPS定位資料推估路段行車速率之研究」，碩士論文，國立交通大學，運輸科技與管理學系。
16、 張學孔，劉育儒，陳信雄，(2001)，「先進公車系統自動車輛定位與通訊技術之評估研究」，運輸計劃季刊，第30卷，第1期，第203-236頁。
17、 張福榮，(2002)，「物流業經營管理」，五南圖書出版公司。
18、 敖君瑋，(1999)，「禁制搜尋法於軟性時窗限制之車輛途程問題研究」，碩士論文，元智大學工業工程研究所。
19、 陳百傑，(2002)，「以啟發式演算法求解時窗限制車輛途程問題」，碩士論文，中原大學工業工程學系。
20、 陳坤賓，胡黃德，(1998)，「模擬退火演算法應用於車輛途程問題之研究」，中國工業工程學會八十七年度年會論文集，第494-499頁。
21、 陳國輝，(2003)，「變頻式預拌混凝土供應鏈之研究-以建築工程為例」，碩士論文，國立中興大學土木工程學系。
22、 陳惠民，(1995)，「工程土方資源管理與指派載運監控系統-GIS/GPS之應用」，碩士論文，國立台灣科技大學營建工程技術學系。
23、 曾清涼，(1990)，「全球定位系統衞星導航及定位測量」，遙感探測第十二期抽印本。
24、 曾清涼，余騰鐸，王永昌，陳春益，(1998)，「衞星導航智慧型公車網系統規劃」，第三屆國際GPS衞星科技研討會論文集，第179-187頁。
25、 馮重偉、吳獻堂，(2004)，「結合基因演算法與電腦模擬於預拌廠派車作業之應用」中國土木水利工程學刊，第十六卷，第四期，第685-694頁。
26、 黃兆龍，蔡明谷，(1994)，「預拌混凝土問題集錦」，詹氏書店。
27、 經濟部中央標準局，(1998)，「中國國家標準CNS3090－預拌混凝土(Ready-mixed concrete)」，1998年6月25日修訂公布。
28、 廖亮富，(1998)，「含時窗限制多部車輛途程問題解算之研究」，碩士論文，元智大學工業工程與管理學系。
29、 趙宏逵，(1985)，「市區預拌混凝土廠生產排程車輛調派與路線問題之研究」，碩士論文，國立交通大學交通運輸工程研究所。
30、 劉賓陽，(1998)，「多次運送之路徑指派決策研究」，中國工業工程學會八十七年度年會論文集，第417-422頁。
31、 鄭百成，(2003)，「預拌混凝土拌合廠品質管理電子化系統建構與研究」，碩士論文，國立中央大學土木工程所。
32、 鄭道明、吳獻堂、曾貽威、張維庭，(2000)，「營建作業系統模擬工具-COST」，第四屆營建工程與管理研究成果聯合發表會論文集，第25-36頁。
33、 蕭飛賓，(1997)，「差分衛星定位系統應用於無人飛機之空攝酬載飛行試驗」，國科會計劃案NSC-86-2612-E-006-002。
34、 韓復華，王國琛，(2000)，「巨集啟發式解法在求解大規模旅行推銷員問題之研究」，中華民國第五屆運輸網路研討會論文集，第195-204頁。
35、 韓復華，卓裕仁，(2001)，「運輸網路分析」，五南圖書公司。
36、 蘇木春，張孝德， (1997)，「機器學習：類神經網路、模糊系統以及基因演算法則」，全華科技圖書股份有限公司。
37、 蘇義雄，(2000)，「物流與運籌管理」，華泰文化事業公司。
38、 顏憶茹，張淳智，(2001)，「物流管理原理、方法與實務」，前程企業管理有限公司。

英文部分
01、 Adrados, C., Girard, I., Gendner, J. P., and Janeau, G. (2002). “Global Positioning System (GPS) location accuracy improvement due to Selective Availability removal.” C. R. Biologies, 325, 165-170.
02、 Baker, B. M. and Ayechew, M. A. (2003). “A Genetic Algorithm for the Vehicle Routing Problem.” Computers & Operations Research, 30, 787-800.
03、 Bent, R. and Hentenryck, P. V. (2006). “A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows.” Computers & Operations Research, 33, 875-893.
04、 Bertsekas, D. P. (1993). “A Simple and Fast Label Correcting Algorithm for Short Paths.” NETWORKS, 23, 703-709.
05、 Bodin, L. Golden, B. Assad, A. and Ball, M. (1983). “Routing and Scheduling of Vehicle and Crews. The state of the art.” Computers and Operationas Research, Vol. 10, 63-211.
06、 Brandão, J. and Mercer, A. (1997). “A Tabu Search Algorithm for the Multi Trip Vehicle Routing and Scheduling Problem.” European Journal of Operational Research, Vol. 100, No. 1, 180-191.
07、 Burkowski, F. J. (2004). “Proximity and Priority: Applying a Gene Expression Algorithm to the Traveling Salesman Problem.” Parallel Computing, 30 803-816.

08、 Chang C. Y. (1997). “Using Computer Simulation to Manage the Crowding Problem in Parks: A Case Study.” Landscape and Urban Planning (Amsterdam), 37(4), 147-161.
09、 Chao, I. M. (2002). “A Tabu Search Method for the Truck and Trailer Routing Problem.” Computers & Operations Research 29, 33-51.
10、 Chatterjee, S., Carrera, C., and Lynch, L. A. (1996). “Genetic Algorithms and Traveling Salesman Problems.” European Journal of Operational Research, 93, 490-510.
11、 Chen, X., Wan, W. and Xu, X. (1998). “Modeling Rolling Batch Planning as Vehicle Routing Problem with Time Windows.” Computers & Operations Research, Vol. 25, No. 12, 1127-1136.
12、 Chen, Y. L. and Yang, H. H. (2000). “Shortest Paths in Traffic-Light Networks”, Transportation Research Part B.” 34, 241-253.
13、 Cheng, T. M. and Feng, C.W. (2003). “An Effective Simulation Mechanism for Construction Operations.” Automation in Construction, 12, 227-244.
14、 Cheng, T. M., Wu, H. T., and Tseng Y. W. (2000). “Construction Operation Simulation Tool-COST.” The 17th ISARC Conference, Taipei, 1143-1146.
15、 Chiang, W. C. and Ruessel, R. A., (1996). “Simulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows.” Computers and Operations Research Vol. 63, 3-27.
16、 Chuang, T. N., and Kung, J. Y. (2005). “The Fuzzy Shortest Path Length and the Corresponding Shortest Path in A Network.” Computers and Operations Research, 32, 1409-1428.
17、 Cohoon, P. and W. Paris, (1986). “Genetic placement in Proceedings.” The IEEE International Conference on Computer-Aided Design, 422-425.
18、 Deb, Kalyanmoy and David E. Goldberg (1991). “mGA in C: A Messy Genetic Algorithm in C.” Illinois Genetic Algorithms Laboratory, Illinois.
19、 Derekenaris, G.., Garofalakis, J., Makris, C., Prentzas, J., Sioutas, S., and Tsakalidis, A. (2001). “Integrating GIS, GPS and GSM technologies for the effective management of ambulances.” Computers, Environment and Urban Systems, 25, 267-278.
20、 Desrocher, M. Desrosiers, J. and Solomon, M. (1992). “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows.” Operations Research, 40(2), 342-354.
21、 Dueck, G. and Scheuer, T. (1990). “Threshold Accepting:A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing.” Journal of Computational Physics 90, 161-175.
22、 Ertay, T. (1996). “Simulation Approach in Comparison of A Pull System in A Cell Production System with A Push System in A Conventional Production System According to Flexible Cost: A Case Study.” International Journal of Production Economics Proceedings of the 1996 9th International Working Seminar on production Economics, Austria, 145-155.
23、 Feng, C. W. and Wu, H. T. (2000). “Using Genetic Algorithms to Optimize the Dispatching Schedule of RMC Cars.” Proceeding of the 17th International Symposium on Automation and Robotics in Construction, Taipei, Taiwan, 927-932.
24、 Feng, C. W. and Wu, H. T. (2004). “The Integrated RMC Dispatching System Based on The Dispatching Center Approach.” Proceeding of the 21th International Symposium on Automation and Robotics in Construction, Jeju, Korea, 450-455.
25、 Feng, C. W. and Wu, H. T. (2006). “Integrating fmGA and CYCLONE to optimize the schedule of dispatching RMC trucks.” Automation in Construction, 15, 186-199.
26、 Feng, C. W., Cheng, T. M. and Wu, H. T. (2004). “Optimizing the schedule of dispatching RMC trucks Through genetic algorithm.” Automation in Construction, 13, 327-340.
27、 Fisher, M. L. (1995). “Networking Routing.” Handbooks in Operation Research and Management Science, 8, 1-33.
28、 Garey, M. R. and Johnson D. S. (1979). “Computers and Intractability:A Guide to the Theory of NP Completeness.” W. H. Freeman, New York.
29、 Gen, M. and Cheng, R. (1997). “Genetic Algorithms and Engineering Design.” Wiley, New York.
30、 Gen, M. and Cheng, R. (1999). “Genetic Algorithms and Engineering Optimization.” Wiley, New York.
31、 Gendreau, M., Laporte, G. and Seguin, R. (1996). “Stochastic Vehicle Routing.” European Journal of Operational Research, 88, 3-12.
32、 Gili, J. A., Corominas J., and Rius, J. (2000). “Using Global Positioning System techniques in landslide monitoring.” Engineering Geology, 55, 167-192.
33、 Glover, F. and Kochenberger, G. A. (2003). “Handbook of Metaheuristics.” Kluwer Academic Publishers, Massachusetts.
34、 Goldberg, D. E., Deb, K., Kargupta, H., & Harik, G., (1993). “Rapid Accurate Optimization of Difficult Problems Using Fast Messy Genetic Algorithms.” Proceedings of the Fifth International Conference on Genetic Algorithms, 56-64.
35、 Golden, B.L., Assad, A., Levy, L., and Gheysens, F. (1984). “The Fleet Size and Mix Vehicle Routing Problem.” Computers and Operations Research 11, 49-66.
36、 Gonzalez-Quevedo, A. A., AbouRizk, S. M., Iseley, D. T., and Halpin, D. W. (1993). “Comparison of Two Simulation Methodologies in Construction.” Journal of Construction Engineering and Management, ASCE, 119(3), 573-589.
37、 Halpin, D.W. and Riggs, L. S. (1992). “Planning and Analysis of Construction Operations.” Wiley, New York.
38、 Held, M. and Karp, R. (1970). “The Traveling Salesman Problem and Minimum Spanning Trees.” Operations Research, Vol.18, 1138-1162.
39、 Henderson, D., Vaughan, D. E., Jacobson, S. H., Wakefield, R. R., and Sewell, E. C. (2003). “Solving the Shortest Route Cut and Fill Problem Using Simulated Annealing.” European Journal of Operational Research, 145, 72-84.
40、 Hildreth, J., Vorster, M. and Martinez, J. (2005). “Reduction of Short-Interval GPS Data for Construction Operations Analysis.” Journal of Construction Engineering and Management, Vol. 131, No. 8, 920-927.
41、 Hwang, H. S. (2002). “An Improved Model for Vehicle Routing Problem with Time Constraint Based on Genetic Algorithm.” Computer & Industrial Engineering, 42, 361-369.
42、 Jim, H. K., and Chang Z. Y. (1998). “Airport Passenger Terminal Simulation: A Planning and Design Tool.” Simulation Practice and Theory, 6(4), 387-396.
43、 Jing, G. G., Kelton, W. D., Arantes, J. C., and Houshmand, A. A. (1998). “Modeling a controlled conveyor network with merging configuration.” Proceeding of the 1998 Winter Simulation Conference, Washington. D.C., 1041~1048.
44、 Katayama, K., and Sakamoto, H. (2000). “The Efficiency of Hybrid Mutation Genetic Algorithm for the Travelling Salesman Problem.” Mathematical and Comouter Modelling, 31, 197-203.
45、 Kazaz, B., and Altinkemer, K. (2003). “Optimization of Multi-Feeder (Depot) Printed Circuit Board Manufacturing with Error Guarantees.” European Journal of Operational Research, 150, 370–394.
46、 Khoo, L. P., and Ng, T. K. (1998). “A Genetic Algorithm-Based Planning System for PCB Component Placement.” International Journal of Production Economics, 54, 321~332.
47、 Kim, J. H. and Oh, J. H. (2000) “A land vehicle tracking algorithm using stand-alone GPS.” Control Engineering Practice, 8, 1189-1196.
48、 Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P. (1983) “Optimization by Simulated Annealing.” Science 220, 671-680.
49、 Knjazew, Dimitri. (2002). “OmeGA: A Competent Genetic Algorithm for Solving Permutation and Scheduling Problems.” Kluwer Academic Publishers, Boston.
50、 Kolen, A. W. J., Rinnooy Kan, A. H. G. and Trienkens, H. W. J. M., (1987) “Vehicle Routing and Scheduling with Time Windows.” Operations Research, Vol. 35(2), 266-273.
51、 Lee, D. C., Park, S. J., and Song, J. S. (1998). “Performance Analysis of Queueing Schemes for Multiple Priorities in Multi-Service PCS.” Global Telecommunication Conference Proceeding of the IEEE GLOBECOM 1998, Sydney, 496-501.
52、 Lenstra, J.K., and Rinnooy Kan, A.H.G. (1981). “Complexity of Vehicle Routing and Scheduling Problems.” Networks 11, 221~227.
53、 Leu, S. S. Chen, A. T. and Yang, C. H. (1999). “Fuzzy Optimal for Resource-Constrained Construction Scheduling.” Journal of Computing in Civil Engineering, ASCE, 13(3), 207-216.
54、 Lu, M., Anson, M., Tang, S. L., and Ying, Y. C. (2003). “HKCONSIM: A Practical Simulation Solution to Planning Concrete Plant Operations in Hong Kong.” Journal of Construction Engineering and Management, Vol. 129, No. 5, 547-554.
55、 Lučić, P., and Teodorović, D. (1999). “Simulated Annealing for the Multi-Object Aircrew Rostering Problem.” Transportation Research Part A, 33, 19-45.
56、 Malmborg, C. J. (1996). “A Genetic Algorithm for Service Level Based Vehicle Scheduling.” European Journal of Operational Research, 93, 121-134.
57、 Martínez, J.L., Martínez, M.A. and Garcia-Cerezo, A. (2000). “A New Method of Generating Differential GPS Corrections.” Control Engineering Practice 8, 253-258.
58、 Michalewicz, Z. (1996). “Genetic Algorithms + Data Structure = Evolution Programs, 3rd edition.” Springer-Verlag, New York.
59、 Modesti, P. and Sciomachen A. (1998). “A Utility Measure for Finding Multi-Objective Shortest Paths in Urban Multi-Modal Transportation Networks. ” European Journal of Operational Research, 111, 495~508.
60、 Navona, R., Goldschmidt, E., and Shpatnisky, Y. (2004). “A concept proving prototype of automated earthmoving control.” Automation in Construction, 13, 225-239.
61、 Osman, I. H. and Kelly, J. P. (1996). “Meta-Heuristics: Theory & Applications.” Kluwer Academic Publishers, Massachusetts.
62、 Potvin, J. Y. and Bengio, S. (1996). “The Vehicle Routing Problem with Time Windows Part: Genetic Search.” Informs Journal on Computing, Vol. 8, No. 2, 165-172.
63、 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, 158-164.
64、 Qu, L. and Sun, R. (1999). “A Synergetic Approach to Genetic Algorithms for Solving Traveling Salesman Problem.” Information Sciences, 117, 267-283.
65、 Ree, S. and Yoon, B. S. (1996). “A Two-Stage Heuristic Approach for the Newspapers Delivery Problem.” Computer Industrial Engineering, Vol. 30, No. 3, 501-509.
66、 Renaud, J., Laporte, G., and Boctor F. F. (1996). “A Tabu Search Heuristic for the Multi-Depot Vehicle Routing Problem.” Computer & Operations Research, Vol. 23, No. 3, 229-235.
67、 Roberts, G. W., Dodson, A. H., and Ashkenazi, V. (1999). “Global Positioning System aided autonomous construction plant control and guidance.” Automation in Construction, 8, 589-595.
68、 Saltzman, R. M. (1997). “Animated Simulation Model for Analyzing on Street Parking Issues.” Simulation 69(2), Simulation Councils, Inc. 79-90.
69、 Senior, B. A., and Halpin, D. W. (1998). “Simplified Simulation System for Construction Projects.” Journal of Construction Engineering and Management, ASCE, 124(1), 72-81.
70、 Shannon, R. E. (1975). “System Simulation the Art and Science.” Taipei, pp.ix.
71、 Soltani, A. R., Tawfik, H., Goulermas, J. Y. & Fernando, T. (2002). “Path Planning in Construction Sites: Performance Evaluation of the Dijkstra, A*, and GA Search Algorithms.” Advanced Engineering Informatics, 16, 291-303.
72、 Tan, K. C., Lee, L. H., and Qu, K. (2001a). “Artificial Intelligence Heuristics in Solving Vehicle Routing Problems with Time Window Constraints.” Engineering Applications of Artificial Intelligence, 14, 825-837.
73、 Tan, K. C., Lee, L. H., Zhu, Q. L. and Qu, K. (2001b). “Heuristics Methods for Vehicle Routing Problems with Time Windows.” Artificial Intelligence in Engineering, 15, 281-295.
74、 Tarantilis, C. D., Kiranoudis, C. T., and Vassiliadis, V. S. (2004). “Athreshold Accepting Metaheuristic for the Heterogeneous Fixed Fleet Vehicle Routing Problem.” European Journal of Operational Research, 152, 148-158.
75、 Thompson, P. M. and Psaraftis, H. (1993). “Cyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems.” Operations Research 41, 935-946.
76、 Tserng, H. P., Ran, B., and Russell, J. S. (2000). “Interactive path planning for multi-equipment landfill operations.” Automation in Construction, 10, 155-168.
77、 Weigl, K. H. (1998). “Simulation of a Large-Scale Brewery Distribution System.” Proceeding of the 1998 Winter Simulation Conference, Washington. D.C., 1255~1259.
78、 Zayed, T. M. and Halpin, D. W. (2001). “Simulation of Concrete Batch Plant Production.” Journal of Construction Engineering and Management, ASCE, Vol.127, No.2, 132-141.