群智能算法的改进及其在相关领域中的应用
详细信息    本馆镜像全文|  推荐本文 |  |   获取CNKI官网全文
摘要
本文对群智能算法中的蚁群算法进行了改进,并将粒子群算法应用于蚁群算法的主要参数选择,取得很好的结果。将改进方法应用于一系列组合优化问题——经典旅行商问题、多点路由问题、生物信息学中的基序发现问题等,实验结果表明改进方法是有效的。
     本文的主要内容之一是针对基本蚁群算法在处理大规模优化问题上算法执行效率很低的缺点进行的改进,改进的算法以提高算法的执行效率和提高解的质量为目的。首先,针对基本蚁群算法的选路时间过长的问题,引入选路优化策略,减少了算法中蚂蚁的选路次数,显著提高了算法的执行效率。尤其对于以往较难处理的大规模TSP问题,改进算法在执行效率上有明显的优势。其次,改进的算法引入了蚂蚁个体差异,并将不同蚂蚁选路策略混合应用,使改进后的蚁群算法在加快收敛速度和提高解的质量的同时,避免了过早停滞现象。最后,由于蚁群算法是概率算法,解的质量依赖于概率函数的参数选择,传统的人工经验方法设置固定的参数不能使所有问题的解得到优化,所以本文引入粒子群优化算法动态调节函数中的参数。模拟实验结果表明改进算法较之基本蚁群算法在收敛速度和解的质量上都有明显提高。
     为了验证改进算法的有效性,将改进的方法应用于经典旅行商问题和多点路由问题,实验结果表明,本文的改进方法是有效的。本文针对生物信息学中的蛋白质和基因海量数据的检索和模式识别的问题进行了研究。首先,针对蛋白质的海量数据设计了高效的检索方法和压缩方法。实现了一种既能高效检索海量数据同时又能对其进行一定的压缩的数据结构,通过正规哈夫曼编码对蛋白质数据进行有效压缩和高效索引,取得了很好的结果。其次,利用改进的蚁群算法和传统的吉布斯抽样识别算法相结合进行基序发现识别问题的优化,得到了很好的实验结果。
     本文的工作主要有以下四个方面:
     1.设计并实现了一种基于选路优化和个体差异的改进的蚁群算法。该算法较之基本蚁群算法在算法的执行效率和解的质量上都有很大改进,性能上优于基本蚁群算法。
     2.对蚁群算法的参数进行了优化处理,设计了一种基于蚁群算法和粒子群算法的混合算法。混合算法主要是通过粒子群算法自动调节蚁群算法的主要参数,使参数选择不再完全依赖于人工经验。实验结果表明混合算法是有效的。
     3.将改进的蚁群算法应用于典型的组合优化问题——经典旅行商问题和多点路由问题。在经典旅行商的多个实例中得到了现有的最优解,而且算法的效率得到了提高。在处理多点路由问题时,在算法的执行效率和解的质量上都得到了很有效的改进。
     4.将改进的蚁群算法应用于生物信息学中的序列基序发现识别问题。首先,针对生物信息学中的海量数据问题进行了有效的处理。通过基于正规哈夫曼编码对生物序列数据进行有效压缩。其次,在已有的吉布斯抽样识别算法处理基序发现问题的基础上,用改进的蚁群算法对算法进行优化,在不影响解的质量的前提下,有效减少了算法的运行时间,取得了很好的结果。
In this thesis, we present some novel improvements and results for a computational paradigm called Ant Colony Optimization (ACO). And we also design a hybrid optimization algorithm with Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) in order to improve the selections of parameters of ACO. Simulation results show that ACO algorithm with our improvement can get a better solution always. And the speed of convergence of ACO algorithm could be enhanced greatly. We use the improved algorithm to deal with some combinatorial optimization problems, include Traveling Salesman Problem(TSP), Multicast Routing Problem(MRP) and Finding Motif Problem(FMP). Simulation experiments show that the improved methods are effective.
     We begin with the introduction of some related topics, including the Combinatorial Optimization and using the Traveling Salesman Problem as an example. Some famous Heuristic Algorithms for Combinatorial Optimization are described briefly and the method of colony intelligent solving the same problem along with its advantages is also given. Then we introduce the background and the details of Ant Colony Optimization. Among the applications of ACO, we emphasize some existing methods solving TSP problem by ACO. The new improvements and results of ACO are presented, which are the main contributions of the thesis.
     We put some improvements on ACO through analyzed the performance of it. And we proposed some improvements on ant colony optimization algorithm to solve Traveling Salesman Problem. First, a novel optimized implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional ACO. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the ACO but also surpasses existing algorithms in performance for solving large-scale TSP problems. The individual variation is introduced in the ACO, which enables the strategy of ants’route selection to possess variety. Simulations show that the speed of convergence of the improved ACO algorithm can be enhanced greatly. At last the PSO is used to optimize the parameters in the ACO, which makes the selection of parameters do not depend on artificial experiences or trial and error, but rely on the adaptive search of the particles in the PSO. Simulation results show that the speed of convergence of ACO algorithm could be enhanced greatly by our methods. We use the improved algorithm to solving the TSP and MRP in order to prove the validity of it. We also deal the FMP with our improved method. Simulation results show that our improved method is effective.
     In this thesis, we focus on improving the performance of the ACO and applied to some related fields. The main work and innovations are as follows.
     1. We do some works in order to improve the performances of the ACO. Two improvements on Ant Colony Optimization (ACO) algorithm are presented in this thesis. A novel optimized implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional ACO. The results of the simulated experiments show that the improved algorithm not only reduces the number of routing in the ACO but also surpasses existing algorithms in performance for solving large-scale TSP problems. The individual variation is introduced in the ACO, which enables the strategy of ants’route selection to possess variety. Simulations show that the speed of convergence of the improved ACO algorithm can be enhanced greatly compared with the traditional ACO.
     2. In this thesis, we present a hybrid optimization algorithm with particle swarm optimization (PSO) and ant colony optimization (ACO). Unlike the conventional ACO or PSO, the new optimization scheme makes full use of the attributes of both algorithms. In the proposed algorithm, the PSO is used to optimize the parameters in the ACO, which makes the selection of parameters do not depend on artificial experiences or trial and error, but rely on the adaptive search of the particles in the PSO. We also try to find the best assembled of the parameters by a series of experiments. Simulation results show that works had great effects in practicality.
     3. Three improvements on the Dijkstra algorithm based on ACO are presented in this thesis. The improvements are given as follows:(1)A novel optimized implementing approach is designed to reduce the processing costs involved with routing of ants in the conventional ACO. (2) Based on the model of network routing, the set of candidates is limited to the nearest c points in order to reduce the counting of other points. (3) In order to prevent selecting blocked points we mark the flags on these points. Simulations show that the speed of convergence of the improved algorithm can be enhanced greatly compared with the traditional algorithm.
     4. We also apply the improve algorithm to solve bioinformatics problems.First, we introduce the canonical Huffman code to wavelet tree of biological sequences. Compared with Huffman code based wavelet tree, the memory space used to represent the shape of wavelet is not needed. In case of large alphabet, this part of memory is not neligible.We present an efficient construction algorithm for this index, which is on-line and linear. And we also applied this structure to Protein sequences. The second, for the finding motif problem of biological sequences, a mixture Gibbs sampling algorithm based on ACO is presented. Based on mixture motifs model learning though ACO, a greedy strategy that adds sequentially new motif to mixture model is employed. Experiments results indicate that the proposed algorithm is advantageous in identifying motifs characteristic of biological families.
     At last, the contents of the paper are summarized and the future work to do is proposed.
引文
[1]黄席樾等.现代智能算法理论及应用[M],科学出版社,2005.
    [2]邢文训谢金星.现代优化计算方法[M],清华大学出版社1999.
    [3]王凌智能优化算法及其应用[M],清华大学出版社,2001.
    [4]王攀、万君康、冯珊.创建计算智能的软计算的混合方法研究[J].武汉理工大学学报, 2005,27(2):76-83.
    [5] Dorigo M, Maniezzo V, Colorni A. The Ant System: optimization by a colony of cooperating agents. IEEE Transactions on SMC [J], Part B, 1996, 26 (1): 1-13.
    [6] Colorni A, Dorigo M. Heuristics from nature for hard combinatorial optimization problems. International Trans Operational Research [J], 1996, 3 (1): 1-21.
    [7] Voigt H-M, Ebeling W, Rechenberg I, Schwefel H-S, eds. Proceedings of the PPSN 44th International Conference on Parallel Problem Solving from Nature[C]. Berlin: Springer-Verlag, 1996:656~665.
    [8] Dorigo M, Gambardella L M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutional Comutation [J], 1997, 1 (1): 53-66.
    [9] Huang L, Zhou CG, Wang KP,Hybrid ant colony algorithm for traveling salesman problem, Progress in Natural Science[J], 2003, 13 (4): 295-299.
    [10] Kcnncdy J,Eberhart RC. Particle swarm optimization. In Proc the IEEE International Joint ConScrence on Neural Networks[C]. Orland, USA, 1995.
    [11] Eberhart RC, Kennedy J. A new optimizer using particle swarm theory. Proceedings of the Sixth International Symposium on Micro Machine and Human Science. Piscataway[C], NJ, Nagoya, Japan: IEEE Service Center, 1995:39-43.
    [12] Dorigo M., Caro G. D. Ant Colony Optimization: A New Meta-Heuristic, Proc. 1999 Congress on Evolutionary Computation[C], 1999(7):1470-1477.
    [13] T.Stützle, MAX-MIN Ant System for Quadratic Assignemnt Problems, Intellectics Group: Technical Report[R], 1997.
    [14] T.Stützle, H. Hoos, MAX-MIN Ant System, Future Generation Computer Systems Journal [J]. 16(8):889-914, 2000.
    [15] Bullnheimer B., Hartl R.F, Strauss C. A new rank based version of the ant system: Acomputational study [J]. Cental European Journal for Operations Research and Economics, 1999.7 (1):25-28.
    [16] Blum C., Dorigo M., the Hyper-Cube Framework for Ant Colony Optimization, IEEE Transactions on Systems, Man and Cybernetics B [J], 2004, 34 (2):1161– 1172.
    [17] Bullnheimer B., Kotsis G. Parallelization Strategies for the Ant System, Adaptive Information Systems and Modelling in Economics and Management Science [J], 1997.10.
    [18] Chau C. K. A Non-Convergence to the Optimal Path in Parallel Ant Colony Optimization, Working Paper[R], 2002.
    [19] Islam M. T., Thulasiraman P., Thulasiram R. K. A Parallel Ant Colony Optimization Algorithm for All-Pair Routing in MANETs, IEEE Proceedings of the International Parallel and Distributed Processing Symposium[C], 2003.
    [20] Middendorf M., Reischle F.and Schmeck H. Information Exchange in Multi Colony Ant Algorithm, Parallel and Distributed Computing, Proceedings of the 15 IPDPS 2000 Workshops[C], 2000.
    [21] Piriyakumar D.A.L., Levi P. A new approach to exploiting parallelism in ant colony optimization, Proceedings of 2002 International Symposium on Micromechatronics and Human Science[C],2002: 237-243.
    [22] Randall M., A Parallel Implementation of Ant Colony Optimization, Journal of Parallel and Distributed Computing [J], 2002.
    [23] Randall M., Lewis A., A Parallel Implementation of Ant Colony Optimization, Journal of Parallel and Distributed Computing[J], 2002.62(9):1421-1432.
    [24] T.Stützle, Parallelization Strategies for Ant Colony Optimization, Lecture Notes in Computer Science[C], 1998.
    [25] E-G. Talbi, O. Roux, C. Fonlupt and D. Robillard, Parallel Ant Colonies for Combinatorial Optimization Problems, IEEE Int. Parallel Processing Symposium / Symposium on Parallel and Distributed Processing[C], 1999.
    [26] E-G. Talbi, O. Roux, C. Fonlupt, D. Robillard, Parallel Ant Colony for the Quadratic Assignment Problem, Future Generation Computer System [J], 2001,17 (4):441-449.
    [27] Blum C. and Dorigo M., The Hyper-Cube Framework for Ant Colony Optimization, IEEE Transactions on Systems, Man and Cybernetics B [J], 2004, 34(2):1161 - 1172.
    [28] Bonabeau E., Dorigo M. and Theraulaz G., Inspiration for optimization from social insect behavior, Nature [J], 2000, 406(6)39-42.
    [29] Dorigo M., Optimization, learning and natural algorithms. Ph.D.Thesis[D], Politecnico di Milano, Italy, 1992.
    [30] Dorigo M.,Bonabeau E. , Theraulaz G., Ant algorithms and stigmergy [J]. Future Generation Computer Systems 16:851– 871.
    [31] Dorigo M., T.Stützle.The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances [R], Metaheuristic Network Publication International Summer School on Metaheuristics, 2003(3).
    [32] Maniezzo V. and Carbonaro A., Ant Colony Optimization: An Overview [C], CiteSeer, 1999.
    [33] Middendorf M., Reischle F. and Schmeck H., Multi Colony Ant Algorithms, Journal of Heuristics [J], 2002(8): 305-320.
    [34] Wu QH, Zhang JH, Xu XH. An ant colony algorithm with mutation features. Journal of Computer Research & Development [J], 1999, 36 (10): 1240-1245 (in Chinese).
    [35] Wu B, Shi ZZ. An ant colony algorithm based partition algorithm for TSP. Chinese Journal of Computers [J], 2001, 24 (12): 1328-1333 (in Chinese).
    [36] Zhang JH, Gao QS, Xu XH. A self-adaptive ant colony algorithm. Control Theory And Applications [J], 2000, 17 (1): 1-3 (in Chinese).
    [37]王颖,谢剑英.一种自适应蚁群算法及其仿真研究.系统仿真学报[J], 2002.14(1): 32-33.
    [38] Guntsch M., Middendorf M.: A Population Based Approach for ACO [C], EvoWorkshops 2002: 72-81.
    [39] Walter J. Gutjahr: ACO algorithms with guaranteed convergence to the optimal solution. Inf [C]. Process. Lett. 2002.82(3): 145-153.
    [40] T.Stützle and M. Dorigo, ACO Algorithm for Traveling Salesman Problem, Evolutionary Algorithms in Engineering and Computer Science [M], Wiley, 1999.
    [41] DING Jian-li, CHEN Zeng-qiang, YUAN Zhu-zhi. Dynamin optimization routing method base on ant adaptive algorithm.Control and Decision [J], 2003 18(6):751-753 (in Chinese).
    [42] T.Stützle, H. Hoos, MAX-MIN Ant System, Future Generation Computer Systems Journal [J]. 2000,16(8):889-914.
    [43] Bullnheimer B., Hartl R. F. and Strauss C., An Improved Ant System Algorithm for the Vehicle Routing Problem [C], Sixth Viennese workshop on Optimal Control, Dynamic Games, Nonlinear Dynamics and Adaptive Systems, Vienna (Austria), 1997(5):21-23.
    [44] Li YJ, Wu TJ. A nested ant colony algorithm for hybrid production scheduling [A]. Proc ofthe American Control Conf[C]. Anchorage, 2002:1123-1128.
    [45] Li YJ, Wu TJ. A nested hybrid ant colony algorithm for hybrid production scheduling problems [J]. Acta Auomatica Sinica, 2003, 29 (1): 95-101.
    [46] Blum C. Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shops scheduling [J].Computer and Operations Reserch, 2005.32(6): 1899-1909.
    [47] Liao CJ, Juan HC, An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups [J]. Computer and Operations Reserch, 2007.34(7):p1565-1591.
    [48] Chen L, Shen J, Qin L. A method for solving optimization problem in continuous space by using ant colony algorithm. Journal of Software [J], 2002, 13 (12): 2317-2322 (in Chines).
    [49]高尚,钟娟等.连续优化问题的蚁群算法研究[J].微机发展,2003(1).:45-47.
    [50]汪镭,吴启迪.蚁群算法在连续空间寻优问题求解中的应用[J].控制与决策.2004(1):58-61.
    [51]沈洁,秦玲.蚁群算法求解连续空间优化问题的一种方法[J].软件学报.2002(7):457-460.
    [52] Zheng, H. Wong, A. Nahavandi, S. Hybrid ant colony algorithm for texture classification [C]. CEC '03. The 2003 Congress on Evolutionary Computation, 2003.(4): 2648- 2652.
    [53] Wang XN, Feng YJ, Feng ZR. Ant colony optimization for image segmentation [C]. Proceedings of 2005 International Conference on Machine Learning and Cybernetics, 2005. (9): 5355-5360.
    [54] Han YF., Shi PF. An improved ant colony algorithm for fuzzy clustering in image segmentation. Neurocomputing [J], 2007.70(4-6): 665-671.
    [55] Ouadfel S., Batouche M. MRF-based image segmentation using Ant Colony System. Electronic Letters on Computer Vision and Image Analysis [C], 2003,2(2) : 12-24
    [56] Liang YC., Smith, A.E. An ant colony optimization algorithm for the redundancy allocation problem (RAP) [C]. IEEE Transactions on Reliability, 2004.53(3): 417-423.
    [57] Liang YC., Smith, A.E. An ant system approach to redundancy allocation[C]. Proceedings of the 1999 Congress on Evolutionary Computation, 1999. CEC 99.1999.2:1478-1484.
    [58] Nahas N., Nourelfath M., Ait-Kadi D. Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series–parallel systems. Reliability Engineering & System Safety [J], 2007.92(2): 211-222.
    [59] Costa D. and Hertz A., Ants can colour graphs, Journal of the Operational Research Society[R] 1997 (48):295-305.
    [60] Solnon, C. Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation[C]. 2002.6(4): 347- 357.
    [61] Schoofs L., Naudts, B. Ant colonies are good at solving constraint satisfaction problems [C]. Proceedings of the 2000 Congress on Evolutionary Computation, 2000: 1190-1195.
    [62]汪镭,吴启迪.蚁群算法在系统辨识中的应用[J].自动化学报,2003.29(1):102-109.
    [63] Duan HB,Wang JQ,et,al.Parameters identification of LuGre friction model for flight simulation servo system based on ant colony algorithm[J].Transactions of Nanjing Unversity of Aeronautics and Astronautics,2004.21(3):179-183.
    [64] Parpinelli RS, Lopes HS, Freitas AA. Data mining with an ant colony optimization algorithm. IEEE Trans. on Evolutionary Computation [C], 2002, 6(4):321~328.
    [65] Tsai Cheng-Fa, Wu Han-Chang, Tsai Chun-Wei. A new data clustering approach for data mining in large databases. Parallel Architectures, Algorithms and Networks[C], 2002. I-SPAN '02. Proceedings. International Symposium, 2002: 278-283.
    [66] Parpinelli RS, Lopes HS, Freitas AA. Data Mining: a Heuristic Approach [M], 2002.
    [67] Shelokar PS., Jayaraman V. K., Kulkarni B. D. An ant colony classifer sysem: application to some process engineering problems [J]. Computers and Chemical Engineering, 2004.28(9): 1577-1584.
    [68] Rajesh J., Gupta K., Dynamic optimization of chemical processes using ant colony framework [J].Computers and Chemistry [J], 2001.25(6): 583-595.
    [69] Schoonderwoerd R, Holland O, Bruten J. Ant-based Load Balancing in Telecommunications Networks. Adaptive Behavior [J], 1996, 5(2):169-207.
    [70] Dicaro G., Ducatelle F., Gambardella L.M.,AntHocNet: An adaptive nature-inspired algorithm for routing in mobile ad hoc networks, European Transactions on Telecommunications (Special Issue on Self-organization in Mobile Networking) [R](2005).
    [71] Amin K A, Mikler A R.Agent-Based Distance Vector Routing: A Resource Efficient and Scalable Approach to Routing in Large Communication Networks [J].Journal of Systems and Software, 2003, 71(3):215-227.
    [72] Caro G D, Dorigo M.Antnet: Distributed Stigmergetic Control for Communication Network [J].Journal of Artificial Intelligence Research, 1998(9):317-365.
    [73] Yuen WH., Lee HN, Andersen T D.A simple and effective cross layer networking system for mobile ad hoc networks.In:Proc of the 13th IEEE International Symposium on Personal,Indoor and Mobile Radio Communications[C].IEEE Press, Lisbon, Portugal, 2002:1952 -1956.
    [74]王翼飞等译.生物信息学算法导论[M].化学工业出版社.2007.7.
    [75]梁栋,霍红卫,自适应蚁群算法在序列比对中的应用[J] .计算机仿真.2005.01.
    [76]陈娟,陈崚求解多重序列比对问题的蚁群算法[J].计算机应用研.2007.1: 53-57.
    [77]陈娟,陈崚,渐进方法结合蚁群算法求解多序列比对问题[J].计算机工程与应用.2006.21
    [78]陈娟,陈崚,多重序列比对的蚁群算法.计算机应用[J].2006.21: 67-71.
    [79] Needleman S, Wunsch C.A general method applicable to the search for similarities in the amino acid sequence of two proteins [J].J.Mol.Biol. 1970,48:443-453.
    [80] Lipman DJ, Altschul SF, Kececioglu JD.A tool for multiple sequence alignment.Proc.Natl.Acad.Sci[C].USA 1989, 86:4412 -4415.
    [81] Stoye J, Moulton V, and Dress AW: DCA: an efficient implementation of the divide-andconquer approaches to simultaneous multiple sequence alignment [J].Comput.Appl.Biosci.1997, 13(6):625-626.
    [82] Reinert K, Stoye J, Will T.An iterative method for faster sum-of-pair multiple sequence alignment [J].Bioinformatics, 2000, 16(9):808 -814.
    [83] Carrillo H, Lipman DJ.The multiple sequence alignment problem in biology[J].SIAM J.Appl.Math.1988,48:1073-1082.
    [84] Pilat M L, White T. Using genetic algorithms to optimize ACS- TSP [C]. Brussels, Belgium: Proceedings of 3rd International Workshop on ant Algorithms ANTS2002, LNCS, 2002:282-287.
    [85] Acan A. GAACO: A GA+ACO hybrid for faster and better search capability[C]. Brussels, Belgium: Proceedings of the 3rd International Workshop on ant Algorithms/ANTS2002, Lecture Notes in Computer Science, 2002: 300-301.
    [86] Gong D X, Ruan X G. A hybrid approach of GA and ACO for TSP[C]. Hangzhou, China: Proceedings of the 5th World Congress on Intelligent Control and Automation, 2004: 2068-2072.
    [87] Tsai CF, Tsai CW.A new approach for solving large travelingsalesman problem using evolution ant rules[C]. In :Proc of the 2002 Int,1Joint Conf on Neural Networks ,IJCNN 2002 Honolulu :IEEE Press, 2002(2):1540-1545.
    [88]陆锋.最短路径算法:分类体系与研究进展[J].地球信息科学2001(3):35-38.
    [89]付梦印,李杰邓志红.限制搜索区域的距离最短路径规划算法[J].北京理工大学报,2004,24(10):881-884.
    [90]陆锋,卢冬梅崔伟宏.交通网络限制搜索区域时间最短路径算法[J].中国图像图形学报,1999,4(10):849-853.
    [91]周春光,梁艳春.计算智能[M],吉林大学出版社,2001.
    [92] Michalewicz Z. Genetic Algorithms+Data Structures=Evolution Programs [M], Berlin: Springer-Verlag, 1992.
    [93]陈国良,王煦法等,遗传算法及其应用[M],人民邮电出版社,北京,1996.
    [94]刘勇,康立山,陈毓屏,非数值并行算法(第二册)——遗传算法(第二版) [M],科学出版社,北京,1997.
    [95]焦李成,保铮,进化计算与遗传算法——计算智能的新方向[J],系统工程与电子技术,1995(6):20-32.
    [96]张春慨,进化算法的若干研究及应用[D],上海交通大学,博士学位论文,2001.
    [97]王战权,进化算法的研究及其应用[D],东北大学,博士学位论文,1999.
    [98] Andre J., Siarry P. and Dognon T., An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization, Advances in Engineering Software [J], 2001, 32(1): 49-60.
    [99] Holland J.H., Adaptation in Natural and Artificial System[R], the University of Michigan Press, Ann Arbor, 1975.
    [100] Goldberg D.E., Genetic Algorithms in Search, Optimization & Machine Learning [M], Addison-Wesley, Reading MA, 1989.
    [101] Stender J., Parallel Genetic Algorithms: Theory and Applications [M], IOS Press, Amsterdam, 1993.
    [102] Back T., Evolutionary Algorithms in Theory and Practice [M], Oxford University Press, Oxford, 1996.
    [103] Schwefel H.P., Evolution and Optimum Seeking [M], John Wiley & Sons, New York, 1994.
    [104] Liu Y.M. and Wang C.J. A modified genetic algorithm based optimization of milling parameters, The International Journal of Advanced Manufacturing Technology [J], 1999, 15(11): 796-799.
    [105] Schraudolph N.N. , Belew R.K. Dynamic parameter encoding for genetic algorithms, Machine Learning [J], 1992, 9(1): 9-21.
    [106]巩敦卫,孙晓燕,郭西进,一种新的优胜劣汰遗传算法[J],控制与决策,2002,17(6):908-911.
    [107]葛红,免疫算法综述,华南师范大学学报(自然科学版)[J],2002,(3):120-126.
    [108]王磊,潘进,焦李成,免疫算法[J],电子学报,2000,28(7):74-78.
    [109]谈英姿,沈炯,肖隽,宋兆龙,吕震中,人工免疫工程综述[J],东南大学学报(自然科学版),2002,32(4):676-682.
    [110]肖人彬,王磊,人工免疫系统:原理、模型、分析及展望[J],计算机学报,1999.25(12):1281-1293.
    [111] Kirkpatrick S, Gelatt J r C D, Vecchi J r M P. Optimization by simulated annealing [J]. Science, 1983.
    [112] Bolte A., U. W. Thonemann, Optimization simulated annealing schedules with genetic programming [J]. European Journal of Operational Research 92 (1996): 402-407.
    [113] Bonabeau E , Dorigo M , Theraulaz G, Swarm intelligence: from natural to artificial systems, Oxford University Press, Inc., New York, NY, 1999.
    [114] Bonabeau E., Dorigo M., G. Theraulaz, Inspiration for optimization from social insect behavior, Nature [J], 406 (2000) 39-42.
    [115] Millonas, M.M., Swarms, Phase Transitions, and Collective Intelligence, in Artificial Life, SFI Studies in the Sciences of Complexity [J], 1994.
    [116] Clerc M, Kennedy J. The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation[C], 2002, 6: 58-73.
    [117] Ioan CT. The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters[C], 2003, 85: 317–325.
    [118] Shigenori N, Takamu G, Toshiki Y, Yoshikazu F. A hybrid particle swarm optimization for distribution state estimation. IEEE Transactions on Power Systems [J], 2003, 18: 60-68.
    [119] Kcnncdy J, Eberhart RC. Particle swarm optimization.In Proc the IEEE International Joint ConScrence on Neural Networks[C].Orland, USA, 1995.
    [120] Eberhart RC, Kennedy J. A new optimizer using particle swarm theory. Proceedings of the Sixth International Symposium on Micro Machine and Human Science. Piscataway[C], NJ, Nagoya, Japan: IEEE Service Center, 1995:39-43.
    [121] Eberhart R C, Hu X. Human tremor analysis using particle swarm optimization. Proc Congress on Evolutionary Computation [C]. Washington, Piscataway: IEEE Service Center, 1999:1927-1930.
    [122]李爱国,覃征,鲍复民,贺开平.粒子群优化算法[J].计算机工程与应用,2002,21:1-3.
    [123] Kennedy J., R.C. Eberhart, Particle swarm optimization, in: Proceedings of the 1995 IEEEInternational Conference on Neural Networks, IEEE Press[C], Piscataway, NJ, 1995:1942-1948.
    [124] Angeline PJ. Evolutionary optimization versus particle swarm optimization: philosophy and performance differences. Evolutionary Programming [J], 1998(7): 601-610.
    [125] Shi Y, Eberhart R. Parameter selection in particle swarm optimization. Proceedings of the Seventh Annual Conference on Evolutionary Programming[C], 1998:591-600.
    [126] Mikki S, Kishk A. Improved particle swarm optimization technique using hard boundary conditions. Microwave and Optical Technology Letters [J], 2005, 46 (5): 422-426.
    [127] Liu B, Wang L, Jin YH, Tang F, Huang DX. Improved particle swarm optimization combined with chaos. Chaos Solitons Fractals [J], 2005, 25(5): 1261-1271.
    [128] Jian W, Xue YC, Qian JX. An improved particle swarm optimization algorithm with disturbance. IEEE International Conference on Systems, Man and Cybernetics [J], 2004, 6: 5900-5904.
    [129] ZHANG Su-bing LU Guo-ying LIU Ze-min ZHOU Zheng QoS Routing Based on Ant-Algorithm JOURNAL OF CIRCUITS AND SYSTEMS [J]. 2000 .5 (1).
    [130] Hughes JD.,Estep PW,Tavazoie S.,GM.ComPutational identification of cis-regulatoy relements associated with functionally coherent groups of genes in Saccharomyeds cerevisiae [J].J.Mol.Biol.2000,296: 1205一1214.
    [131] Lwarence C.E.,Altschul S.F.,Bogouski M.S.,Liu J.S.,Neuwald A.F.,and Wboten J.C. Detecting Subtle Sequence Signals:A Gibbs Sampling Strategy for Multiple Alignment[J].Science,1993,262(5131):208-214.
    [132] Neuwald AF., Liu J.S., and Lwarence C.E.Gibbs Motif Sampling: Detection of bacterial outer membrane repeats [J].ProteinScience, 1995, 4(8):1618-1632.
    [133] Liu J.S.,Neuwald AF.,and Lwarence C.E.Byaesian Models for Multiple Local Sequence Alignment and Gibbs Sampling Strategies[J].Journal of the American Statistical Association,1995,90(432): 1156一1170.
    [134] Thompson W, Rouchka E.C. andLwarence C.E.Gibbs Recursive Sampler:finding transcription factor binding sites[J].Nucleic Acids Research,2003,31(13): 3580一3585.
    [135] Timothy L., Bailey and Charles Elkan.Fitting a mixuture model by expectation maximization to discover motifs in biopolymers .Proceedings of the Second International Conefrence on Intelligent Systems for Molecular Biology[C], Menlo Park, Caliofnria: AAAI Press, 1994:28-36.
    [136] Cnlndy WN., Bailey T.L., Elkan C.P., and Baker M.E.Meta一MEME: motif based hidden Markov models of Proteinafmilies [J].Computer Applications in the Biosciences. 1997, 13(4):397-406.
    [137] Liao YJ... Motif Finding in Biological Sequences. In partical fulfillment of the requirements for the degree of Master of Science [D].2003.6.
    [138] K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix arrays. In Proceedings of the 11th International Symposium on Algorithms and Computation, Springer-Verlag LNCS 1969[C], 2000:410-421.
    [139] Gusfield D... Algorithms on Strings Trees and Sequences [M]. Cambridge UniversityPress, New York, 1997.
    [140] Blumer A., Blumer J., Haussler D., Ehrenfeucht A.,Chen M.T., Seiferas J.. The smallest automation recognizing the subwords of a text. Theoretical Computer Science [J], 1985 40:31-55.
    [141] Manber U., Myers G. Suffix arrays: A new method for on-line string searches. SIAM Journal on Computing [J], 1993.10(22):935-948.
    [142] Meng He, J. Ian Munro, S. Srinivasa Rao. A categorization theorem on suffix arrays with applications to space efficient text indexes In SIAM Symposium on Discrete Algorithms (SODA) [C], 2005: 23-32.
    [143] Ferragina P., Manzini G. An Alphabet-Friendly FM-Index. SPIRE 2004 [C]: 150-160.
    [144] Grossi R. andVitter J... Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proceedings of the 32nd ACM Symposium on Theory of Computing[C], 2000.
    [145] J. I. Munro. Tables. In Proceedings of the 16th ray Conference on Foundations of Software Technology and Computer Science (FSTTCS'96), LNCS 1180[C], 1996:37-42.
    [146] Jacobson G... Succinct static data structures. Technical Report CMU-CS-89-112[R], Dept. of Computer Science, Carnegie-Mellon University, 1989 (1).
    [147] Sadakane K... Compressed text databases with efficient query algorithms based on the compressed suffix arrays. In Proceedings of the 11th International Symposium on Algorithms and Computation, Springer-Verlag LNCS 1969[C], 2000:410-421.
    [148]孙啸,陆祖宏.生物信息学基础[M],清华大学出版社2005.
    [149] Rooney R.J., Raychaudhuri P., Nevins J.R.E4F and ATF, two transcription factors that Recognize the same site, can be distinguished both physically and functionally: a role forE4F in E1A Trans activation, Mol Cell Biol [J], 1990, 10(10):5138-5149.
    [150]朱骥,杨华等. Motif识别算法简介及软件性能研究[J].计算机应用研究.2006.10:66-68.
    [151] Keich U., Pevzner PA. Finding motisf in the twilight zone[J].Bioinofrmatics.2002,18(10): 1374-1381.
    [152] Myetri G.,Jun.S, .Liu.Discovery of Consevred Sequence patterns Using Satochastic Dictionary Model [J].Journal of the American Statistical Association.2003,98 (461): 55-66.
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.