Pheromone-Based Ant Colony Algorithm for Optimal Proliferation of Research

Abstract:

In order to realize the water-saving irrigation of field plots path pipeline deployment management and control, the pheromone of ant colony algorithm for optimization design of. Ant colony algorithm (ACA) is a kind of Bionic Engineering with the development of the optimization algorithm, is mainly based on ant foraging in the search for the shortest path model and form. This article attempts in the existing ant colony algorithm combinatorial optimization of real defect on the basis of field plots, to coordinate as a data source, An improved ant colony algorithm for field plots wiring path design, thereby improving the ant colony algorithm in an iterative process to update the optimal solution ability, Finally in the same number of iterations to find path shorter, cost less rules, solve agricultural water-saving irrigation pipeline path optimization deployment problem. And in the VC++ program validation path optimization problems. The test results show that, under the same climatic conditions, route optimization design results can be deployed for water saving irrigation pipeline layout management provides reference basis and data support.

• Periodical: Advanced Materials Research (Volumes 734-737)
• Pages: 3152-3157
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.734-737.3152
• Online since: August 2013
• Authors: Lei Lei Deng*
• Keywords: ACA, Pheromone, Pheromone Diffusion, Water Saving Irrigation

References

[1] Kuang Qiuming, Zhao Yandong, Bai Chenxiang. Study on [J]. Journal of Chinese agricultural engineering water saving irrigation automatic control system, 2007, 23 ( 6 ) : 136-139.

[2] H-P. Tseng. Detailed Routing Alogithms for VLSI Circuits. Ph.D. Dissertation. Department of Electrical Engineering[J]. Universith of Washington, 1997(4): 85-90.

[3] Seung Gwan Lee, TaeUng Jung, Taechoong Chung. An effective dynamical weighted rule for Ant Colony system algorithm[J]. Proceedings of IEEE conference on Evolutionary Computation. 2001(2): 1393-1396.

DOI: 10.1109/cec.2001.934354

[4] Chen Peng. Ant colony algorithm optimization based on TPS [D]. Master Dissertation of Chang'an University, 2009 ( 4 ): 202-215.

[5] Fabio Abbattista, Nicola Abbattista, Laura Caponetti. An Evolutionary and Cooperative agents for optimization [J]. Proceedings of IEEE conference on Evolutionary Computation. 1995(2): 668-671.

DOI: 10.1109/icec.1995.487464

[6] Wu Bin, Shi Zhongzhi. A kind of TSP problem based on ant colony algorithm segmentation algorithm [J]. Journal of computer, 2001 ( 12 ): 189-195.

[7] Kang Xiaodong. What Pilian . Liu Yujie. Li Zhisheng. Research on [J]. Application Research of computers in medical image segmentation based on ant colony algorithm, 2008 ( 9 ): 154-156.

[8] Jia Shijie, Huang Qingsong, Liu Lijun. Constructing strategy of [J] aggregation pheromone in ant colony algorithm based on the heterogeneous case. Computer engineering and applications, 2008 ( 25 ): 167-172.

[9] Wang Lanchun. Research on [J]. computer software and application of ant colony algorithm based on pheromone diffusion, 2010 ( 14 ): 177-184.

[10] Song Qingbao, Yang Zhijun. Ant colony optimization algorithm of [J]. software variability and dynamic pheromone updating based on, 2004, 15 (2 ): 191-207.

[11] Huang Guo-rui, Gao Xian-bin, Wang Xu-fa. An ant colony optimization algorithm bused on pherornone diffusion. [J]Chinese Journal of Electronics, 2004, 32(5): 389-397.

[12] Gambardella I. M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colomies. International Conference on Evolutionary Computation. [J]Nagoya, Japan, 1996(5): 622-627.

DOI: 10.1109/icec.1996.542672