Application of Particle Swarm Optimization to solve Helicopter Arc Routing Problems for High Voltage Transmission Line Inspection
Keywords:
high voltage transmission line, helicopter, capacitated arc routing problem, particle swarm optimizationAbstract
Electric power is very essential for human daily life. Each year, the demand for electricity is steadily increasing until it affects the production of electricity with limited resources and production potential. Therefore, responsible organizations must balance electricity generation and ensure the safety of electricity consumers. One thing such organizations can do to create safety is to inspect high-voltage transmission lines to ensure they are available and ready to use at all times. By inspecting high-voltage transmission lines, it is necessary to obtain a work plan and minimize operating costs. The capacitated arc routing problem was used as a model for constructing a mathematical model for high-voltage transmission lines, and particle swarm optimization was applied in this research. The mathematical model created can only be used to find answers for small samples and it takes a reasonable amount of time to process the program. However, for large-scale cases and real-world scenarios, it cannot provide answers within a reasonable amount of time. Therefore, in the next step of the research, the cluster-particle metaheuristic method was employed to find additional answers.
References
กฟผ., “ความต้องการพลังไฟฟ้าสูงสุด – สถิติรายปี - การไฟฟ้าฝ่ายผลิตแห่งประเทศไทย,” [Online]. Available: https://www.egat.co.th/home/statistics-demand-annual/. [Accessed: 19-Jun-2023].
J. K. Lenstra and A. H. G. R. Kan, “On general routing problems,” Networks, vol. 6, no. 3, pp. 273–280, 1976.
U. F. Aminu and R. W. Eglese, “A constraint programming approach to the Chinese postman problem with time windows,” Computers and Operations Research., vol. 33, no. 12, pp. 3423–3431, 2006.
H. Thimbleby, “The directed Chinese postman problem,” Software: Practice and Experience., vol. 33, no. 11, pp. 1081–1096, 2003.
E. Minieka, “The Chinese postman problem for mixed networks,” Management Science., vol. 25, no. 7, pp. 643–648, 1979.
B. L. Golden and R. T. Wong, “Capacitated arc routing problems,” Networks, vol. 11, no. 3, pp. 305–315, 1981.
H. A. Eiselt, M. Gendreau, and G. Laporte, “Arc routing problems, part I: the Chinese postman problem,” Operations Research., vol. 43, no. 2, p. 231, 1995.
H. A. Eiselt, M. Gendreau, and G. Laporte, “Arc routing problems, part II: the rural postman problem,” Operations Research., vol. 43, no. 3, pp. 399–414, Jun. 1995.
Ángel Corberán and Gilbert Laporte (Edited), Arc routing : problem, methods, and applications, USA: MOS-SIAM Series on Optimization, 2015.
M. Liu, H. K. Singh, and T. Ray, “A Memetic Algorithm with a New Split Scheme for Solving Dynamic Capacitated Arc Routing Problems,” in Proceedings of the 2014 IEEE Congress on Evolutionary Computation, CEC 2014, China, 2014.
J. Kennedy and R. Eberhart, “Particle Swarm Optimization,” in Proceedings of International Joint Conference on Neural Networks. International Joint Conference on Neural Networks, United States of America, 1995.
Y. Shi and R. C. Eberhart, “Empirical Study of Particle Swarm Optimization,” in Proceedings of the 1999 Congress on Evolutionary Computation, United States of America, 1999.
พิศุทธิ์ พงศ์ชัยฤกษ์, “การอธิบายขั้นตอนการทำงานของวิธีการพาทิเคิลสวอมออปติไมเซชันผ่านตัวอย่าง,” วารสารมหาวิทยาลัยศรีนครินทรวิโรฒ, pp. 78–87, 2557.
บารมี ศรีวิชัยนันท์, “การจัดเส้นทางเฮลิคอปเตอร์สำหรับตรวจสายส่งไฟฟ้าแรงสูง,” วิศวกรรมศาสตรมหาบัณฑิต, วิศวกรรมโลจิสติกส์และการจัดการโซ่อุปทาน, มหาวิทยาลัยเชียงใหม่, เชียงใหม่, 2559.
Downloads
Published
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
