人工智慧方法應用於聖火傳遞路徑最佳化

Torch Relay Route Optimization by Using the Artificial Intelligence

10.5297/ser.1304.004

劉正達(Cheng-Dar Liou)

遺傳演算法 ； 粒子群演算法 ； 蟻群演算法 ； genetic algorithms ； particle swarm optimization ； ant colony optimization

大專體育學刊

13卷4期（2011 / 12 / 01）

368 - 378

繁體中文;英文

聖火儀式為各項運動會上重要儀式象徵，而聖火的傳遞也詔告了和平與團結的信息，鼓舞大家共同參與體育運動盛事。本研究目的是應用地理資訊系統資料庫取得聖火傳遞路徑上的距離資訊，並運用人工智慧方法在總路徑最短的目標下，求得聖火傳遞的最佳路徑。本研究結合遺傳演算法（genetic algorithms, GA）及粒子群演算法（particle swarm optimization, PSO）提出一種新的混種演算法（hybrid algorithm, HA）以求解聖火傳遞路徑的最佳化問題，經模擬演算10個傳遞點的問題及比對分析民國99年大專運動會五個分區聖火傳遞路徑規劃問題，可驗證本研究所提出的混種演算法較傳統的蟻群演算法（ant colony optimization, ACO）、GA 及PSO 的演算效果為佳且運算時間較短。又與民國99年大專運動會五個分區聖火傳遞路徑比對結果，本研究所提出的聖火傳遞路徑較原規劃路徑總里程減少335公里（約11.68%），且可免去人員路線探勘的風險及費用，因此，此結合地理資訊系統資料庫與人工智慧方法的路徑規劃方法，可應用於聖火傳遞路徑的規劃上，使大型運動盛會的整體管理效能更加提升。

Ceremonial fire is an important symbol for an athletic game. Through the torch relay process, the atmosphere of peace and union is delivered and people are encouraged to participate in the athletic games together. Based on the data obtained from the global position system (GPS), in the study, various artificial intelligence approaches were used to solve the torch relay routing problem. The objective of the torch relay routing problem was to minimize the total distance of torch relay route. By reasonably combining genetic algorithms (GA) and particle swarm optimization (PSO), we developed a fast and easily implemented hybrid algorithm (HA) for solving the considered problem. The effectiveness and efficiency of the proposed HA were demonstrated and compared with those of standard ant colony optimization (ACO), PSO and GA by numerical results of the simulated instance with 10 spots and the real torch relay routing problems of National Intercollegiate Athletic Games in 2010. Numerical results indicate that the total distance of torch relay routes by HA was 335 km, which was 11.68% shorter than the original routes adopted by National Intercollegiate Athletic Games in 2010. It implies that the proposed HA can use the GPS information to schedule the torch relay routes, and it can reduce the cost of reconnoitering and management in an athletic game. Therefore, the proposed HA approach is an effective approach, and it can improve the efficiency for an athletic game.

1. 黃建松、許光麃(2007)。奧運會傳遞火炬及聖火點燃儀式意義之探討。國立臺灣體育學院體育學系系刊，7，61-68。
   連結：
2. 國立體育大學（2010）。99 全國大專校院運動會聖火正式傳遞企劃案。桃園縣：國立體育大學體育室。
3. Chelouah, R.,Siarry, P.(2003).Genetic and Nelder-Mead algorithms hybridized for a more accurate global optimization of continuous multiminima functions.European Journal of Operational Research,148(2),335-348.
4. Dorigo, M.,Stutzle, T.(2004).Ant colony optimization.Cambridge, MA:MIT Press.
5. Fan, S.-K. S.,Zahara, E.(2007).A hybrid simplex search and particle swarm optimization for unconstrained optimization problems.European Journal of Operational Research,181(2),527-548.
6. Gen, M.,Cheng, R.(2000).Genetic algorithms & engineering optimization.New York:Wiley.
7. Holland, J. H.(1975).Adaptation in natural and artificial systems.Ann Arbor, MI:University of Michigan Press.
8. International Olympic Committee(2002).The Olympic flame and torch relay.Lausanne, Switzerland:Olympic Museum and Studies Centre.
9. Kao, Y. T.,Zahara, E.(2008).A hybrid genetic algorithm and particle swarm optimization for multimodal functions.Applied Soft Computing,8(2),849-857.
10. Kennedy, J.,Eberhart, R. C.(1995).Particle swarm optimization.IEEE International Conference on Neural Networks,Perth, Australia:
11. Laporte, G.(1992).The traveling salesman problem: An overview of exact and approximate algorithms.European Journal of Operational Research,59(2),231-247.
12. Larrañaga, P.,Kuijpers, C. M. H.,Murga, R. H.,Inza, I.,Dizdarevic, S.(1999).Genetic algorithm for the traveling salesman problem: A review of representations and operators.Artificial Intelligence Review,13(2),129-170.
13. Lawler, E. L.,Lenstra, J. K.,Rinnooy Kan, A. H. G.,Shmoys, D. B.(1985).The traveling salesman problem: A guided tour of combinatorial optimization.New York:Wiley.
14. Liou, C. D.,Liu, C. H.(2010).A novel encoding scheme of PSO for two-machinegroup scheduling.International Conference on Swarm Intelligence,Beijing, China:
15. Liu, B.,Wang, L.,Jin, Y. H.(2008).An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers.Computers & Operations Research,35(9),2791-2806.
16. Michalewicz, Z.(1996).Genetic algorithm + data structure .London:Springer.
17. Murata, T.,Ishibuchi, H.,Tanaka, H.(1996).Genetic algorithms for flowshop scheduling problem.Computers & Industrial Engineering,30(4),1061-1071.
18. Shi, Y.,Eberhart, R. C.(1998).Parameter selection in particle swarm optimization.Proceedings of the 7th International Conference on Evolutionary Programming,New York:
19. Takenaka, Y.,Funabiki, N.(1998).An improved genetic algorithm using the convex hull for traveling salesman problem.IEEE Transactions on Systems, Man, and Cybernetics,3,2279-2284.
20. 王小平、曹立明(2002)。遺傳算法─理論、應用與軟件實現。西安:西安交通大學。
21. 李炳昭、林佳慧(2008)。奧運聖火儀式發展與演變之探析。國立臺中教育大學體育學系系刊，3，74-79。
22. 段海濱(2007)。蟻群算法原理及其應用。北京:科學。
23. 紀震、廖惠達、吳青華(2009)。粒子群算法及應用。北京:科學。