本研究目的為解決以自動搬運車同時取送多貨物之最佳派車及路徑規劃問題，以期降低車輛派遣成本與能源之消耗。為解決此問題，我們參考相關文獻，發展出以自動搬運車中央控制系統爲主軸的數學規劃模型，解決自動搬運車路線規劃問題（AGVRP)。根據我們所提供的搬運成本與能源消耗間的權衡機制，決策者可經由規劃求解軟體（CPLEX 12.5）得到最佳滿意解。
然而，因為此數學規劃模型屬於靜態模型，當系統在運作時，如突然有未在規劃內的任務產生時，靜態系統無法即時處理該任務。因此，爲解決動態環境之即時任務指派與路徑規劃問題，我們利用模擬軟體（FLEXSIM) 模擬動態環境以建構模擬模型，並且提出稱爲『智慧控制演算方法』的架構。此方法結合模擬模型進行運算後，可以同時解決任務指派與路徑規劃的問題。在此架構下的內容，包含智慧控制演算方法與兩個基於此演算方法之派遣法則，分別是最短路派遣法則與最佳車輛使用率派遣法則。為確保模擬解的精確度，我們比較確定性模型(AGVRP)和智慧控制演算方法。結果顯示本架構在小規模生產下的結果接近最佳解。而在大規模的問題中，與常用之最近車輛法則[1, 2]比較，我們所提出的方法較為優異。
最後，我們所提之智慧控制系統以合作公司為案例，已驗證其可行性與效益。

Due to the rise of labor cost and the requirement of quality stability, industrial automation has become a solution for enterprises to strengthen the competitiveness and reduce the operational costs in recent years. In the field of industrial automation, automated guided vehicle (AGV) system has been generally adopted for transporting semi-manufactured goods, components or products between workstations to facilitate production processes in an unmanned factory. In order to satisfy production processes, the planned routes of AGVs which coordinate workstations and a warehouse play a critical rule to enhance system performance.
This study first investigates the important factors which affect the vehicle routing performances of the AGVs and has the following observations: (1) In-time material delivery along workstations smoothens the production process; (2) The lighter “en route vehicle weight” alleviates energy wastes; (3) The increased space utilization of an AGV reduces the fleet size of AGVs. Based on the aforementioned analysis, a mathematical model in the form of multi-objective integer programming model is developed to obtain the optimal vehicle routings for pick-ups and deliveries of multiple products/components along the production flows such that energy consumption and operational cost can be minimized. Moreover, in order to have further applications in a practical circumstance, the simultaneously dispatching and routing algorithm, called Intelligent Control Algorithm, is proposed to enhance system performance, such as the moving distance and the completion time of the products.
Finally, an illustrative example from an assembly company of Taiwan is presented to verify our proposed deterministic model and dynamic algorithm embedded in the simulation software, Flexsim. With given layout and production flows, the result shows that the pick-up and delivery routes of AGVs can be determined optimally and ensured feasibility with sufficient fleet in deterministic model and our proposed rules based on the algorithm can outperform the conventional nearest-vehicle dispatching rules.

[1] P. J. Egbelu and J. M. Tanchoco, "Characterization of automatic guided vehicle dispatching rules," THE INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, vol. 22, pp. 359-374, 1984.
[2] C. KLEI and J. Kim, "AGV dispatching," International Journal of Production Research, vol. 34, pp. 95-110, 1996.
[3] J. T. Lin, F.-K. Wang, and P.-Y. Yen, "The maximum loading and the optimum number of vehicles in a double-loop of an interbay material handling system," Production Planning & Control, vol. 15, pp. 247-255, 2004.
[4] A. Asef-Vaziri and G. Laporte, "Loop based facility planning and material handling," European Journal of Operational Research, vol. 164, pp. 1-11, 2005.
[5] R. Gaskins and J. M. Tanchoco, "Flow path design for automated guided vehicle systems," International Journal of Production Research, vol. 25, pp. 667-676, 1987.
[6] A. Asef-Vaziri, G. Laporte, and R. Ortiz, "Exact and heuristic procedures for the material handling circular flow path design problem," European Journal of Operational Research, vol. 176, pp. 707-726, 2007.
[7] A. Asef-Vaziri and M. Goetschalckx, "Dual track and segmented single track bidirectional loop guidepath layout for AGV systems," European Journal of Operational Research, vol. 186, pp. 972-989, 2008.
[8] T. Nishi, Y. Hiranaka, and I. E. Grossmann, "A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles," Computers & Operations Research, vol. 38, pp. 876-888, 2011.
[9] G. B. Dantzig and J. H. Ramser, "The truck dispatching problem," Management Science, vol. 6, pp. 80-91, 1959.
[10] P. Toth and D. Vigo, "An overview of vehicle routing problems," The vehicle routing problem, vol. 9, pp. 1-26, 2002.
[11] M. M. Solomon and J. Desrosiers, "Survey Paper—Time Window Constrained Routing and Scheduling Problems," Transportation science, vol. 22, pp. 1-13, 1988.
[12] J.-F. Chen and T.-H. Wu, "Vehicle routing problem with simultaneous deliveries and pickups," Journal of the Operational Research Society, vol. 57, pp. 579-587, 2005.
[13] S. Anbuudayasankar and K. Mohandas, "Mixed-integer linear programming for vehicle routing problem with simultaneous delivery and pick-up with maximum route-length," International Journal of Applied Management and Technology, vol. 6, p. 2, 2008.
[14] H.-F. Wang and Y.-Y. Chen, "A genetic algorithm for the simultaneous delivery and pickup problems with time window," Computers & Industrial Engineering, vol. 62, pp. 84-95, 2012.
[15] A. Hasani-Goodarzi and R. Tavakkoli-Moghaddam, "Capacitated Vehicle Routing Problem for Multi-Product Cross-Docking with Split Deliveries and Pickups," Procedia-Social and Behavioral Sciences, vol. 62, pp. 1360-1365, 2012.
[16] I. Kara, B. Y. Kara, and M. K. Yetis, "Energy minimizing vehicle routing problem," in Combinatorial Optimization and Applications, ed: Springer, 2007, pp. 62-71.
[17] P.-H. Koo and J. Jang, "Vehicle travel time models for AGV systems under various dispatching rules," International Journal of Flexible Manufacturing Systems, vol. 14, pp. 249-261, 2002.
[18] P. Saayman, I. Craig, and F. Camisani-Calzolari, "Optimization of an autonomous vehicle dispatch system in an underground mine," JOURNAL-SOUTH AFRICAN INSTITUTE OF MINING AND METALLURGY, vol. 106, p. 77, 2006.
[19] R. Pisuchpen, "A simulation of AGV dispatching rules for supplying parts to assembly lines," International Journal of Modelling in Operations Management, vol. 2, pp. 1-25, 2012.
[20] M. B. Duinkerken, J. A. Ottjes, and G. Lodewijks, "Comparison of routing strategies for AGV systems using simulation," in Simulation Conference, 2006. WSC 06. Proceedings of the Winter, 2006, pp. 1523-1530.
[21] T. Nishi, S. Morinaka, and M. Konishi, "A distributed routing method for AGVs under motion delay disturbance," Robotics and Computer-Integrated Manufacturing, vol. 23, pp. 517-532, 2007.
[22] K. Vivaldini, J. Galdames, T. Pasqual, R. Sobral, R. Araújo, M. Becker, and G. Caurin, "Automatic Routing System for Intelligent Warehouses," in IEEE International Conference on Robotics and Automation, 2010, pp. 1-6.
[23] E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische mathematik, vol. 1, pp. 269-271, 1959.
[24] C.-J. Huang, K.-H. Chang, and J. T. Lin, "Optimal vehicle allocation for an Automated Materials Handling System using simulation optimisation," International Journal of Production Research, vol. 50, pp. 5734-5746, 2012.
[25] Q. Zeng and Z. Yang, "Integrating simulation and optimization to schedule loading operations in container terminals," Computers & Operations Research, vol. 36, pp. 1935-1944, 2009.
[26] Y. A. Bozer, R. D. Meller, and S. J. Erlebacher, "An improvement-type layout algorithm for single and multiple-floor facilities," Management Science, vol. 40, pp. 918-932, 1994.