Authors S.I. Rodzin, L.S. Rodzina
Month, Year 04, 2015 @en
Index UDC 004.89
Abstract Many problems in geoinformatics tasks are reduced to the search for optimal solutions. In order to effectively solve their bioinspired developed algorithms. These species, along with genetic algorithms are algorithms for genetic programming, evolutionary strategies, evolutionary programming, training classifiers, Monte Carlo algorithms, swarm intelligence, memetics, harmonious and others search. One of the main problems faced by their developers is the problem ensure a balance between the rate of convergence of the algorithm and the diversification of the search. This is - the fundamental problem, because of its theoretical and practical importance. For purposeful synthesis bioinspired algorithms developed mechanisms to solve the problem of balance, self-adaptation and adaptation of necessary general theory bioinspired search for optimal solutions. The article discusses the main elements of the theory bioinspired search for optimal solutions. An original memetic algorithms, combining local search, cooperation and competition. Experiments for NP-hard optimization problems have shown that with the help of the developed theory of these problems are solved quickly, reliably and accurately. Bioinspired algorithm - is actively developing field of optimization techniques and decision-making. At the moment, the most promising is the creation of adaptive versions bioinspired search algorithms that take into account the background of the search, as well as task-oriented information on the scope of the search for optimal solutions. The main tool for the construction of new high-performance algorithms bioinspired is hybridization. A feature bioinspired algorithms is the high number of free parameters. From them it may vary depending on the performance of the algorithms. There are only experimental guidelines for choosing the values of these parameters. Further research is needed to adapt and self-adaptation of these parameters.

Download PDF

Keywords Geoinformatics; bioinspired search; memetic algorithm; processing of problem-oriented knowledge.
References 1. Holland J.H. Adaptation in Natural&Artificial Systems. Ann Arbor: Uni of Michigan Press, 1975.
2. Kureichik V.M. and Rodzin S. I. Evolutionary algorithms: Genetic programming, J. Computer System Science Int., 2002, Vol. 41, No. 1, pp. 123-132.
3. Rodzin S.I.: Schemes of Evolution Strategies, Proc. of IEEE Int. Conf. on Art. Intel. Systems (ICAIS’2002), 2002, pp. 375-380.
4. Fogel D. B. Evolutionary Computation. The Fossil Record. Piscataway. NJ: IEEE Press, 1998.
5. Dorigo M., Maniezzo V., Colorni A. The Ant System: Optimization by a colony of cooperating objects, IEEE Trans. on Systems, Man, and Cybernetics, 1996, Part B, No. 26 (1), pp. 29-41.
6. Pham D.T., Ghanbarzadeh A., Koc E., Otri S., Rahim S., and Zaidi M. The Bees Algorithm. Tech. Note, Manufacturing Eng. Centre, Cardiff University, UK, 2005.
7. Bastos-Filho C.J.A., Lima-Neto F.B., Lins A., Nascimento A., Lima M. Fish School Search. Nature-inspired Algorithms for Optimization (NISCO’2010). Springer, Heidelberg, 2009, Vol. 193, pp. 261-277.
8. Reynolds C. Flocks, Herds, and Schools: A Distributed Behavioral Model, Computer Graphics, 1987, No. 4 (21), pp. 25-34.
9. Das S., Biswas A., Dasgupta S., Abraham A. Bacterial foraging optimization algorithm: theoretical foundations, analysis, and applications, Foundations of Computational Intelligence. Publisher: Springer, 2009, Vol. 203, pp. 23-55.
10. Yang X.-S., Deb S. Cuckoo search via l’evy flights, Proc. of the World Congress on Nature & Biologically Inspired Computing (NaBIC’09, India). IEEE Publ., USA, 2009, pp. 210-214.
11. Yang Xin-She. Firelly algorithm, stochastic test functions and design optimization, Int. Jour. of Bioinspired Computation, 2002, Vol. 2, No. 2, pp. 78-84.
12. Mehrabiana A.R., Lucase C. A novel numerical optimization algorithm inspired from weed colonization, Ecological informatics, 2006, No. 1, pp. 355-366.
13. Mucherino A., Seref O. Monkey search: a novel meta-heuristic search for global optimization, Proc. of AIP Conf. «Data mining, system analysis and optimization in biomedicine», 2007, pp. 162-173.
14. Abidin Z.Z., Arshad M.R., Ngah U.K. A simulation based fly optimization algorithm for swarms of mini autonomous surface vehicles application, Indian Jour. of Geo-marine Sciences, 2011, Vol. 40 (2), pp. 250-266.
15. Eusuff M.M., Lansey K., Pasha F. Shuffled flog leaping algorithm: a memetic meta-heuristic for discrete optimization, Engineering Optimization, 2006, Vol. 38, No. 2, pp. 129-154.
16. Yang X.-S. A new metaheuristic sat-inspired algorithm, Nature Inspired Cooperative Strategies for Optimization (NISCO’2010), Berlin: Springer, 2010, Vol. 284, pp. 65-74.
17. Wolpert D.H., Macready W.G. The no Free Lunch Theorems for Optimization, IEEE Trans. Evol. Comp., 1997, Vol. 1, No. 1, pp. 67-82.
18. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. MIT Press, 2009.
19. Rodzin S.I. Smart Dispatching and Metaheuristic Swarm Flow Algorithm, J. of Comp. and Syst. Sc. Inter., 2014, Vol. 53, No. 1, pp. 109-115.
20. Conway R.W., Maxwell W.L., Miller L.W. Theory of Scheduling. Courier Dover Publ., 2003.
21. Moscato P. Memetic algorithms. Handbook of Applied Optimization. Oxford: Uni Press, 2002.
22. Rodzina L., Kristofferson S. Context-dependent car Navigation as kind of human-machine collaborative interaction, Proc. of the 2013 Int. Conf. on Collaboration Technologies & Systems (CTS’2013, San Diego, California, USA.). Publ. of the IEEE, pp. 253-259.
23. Kureychik V.V., Kureychik V.M., Rodzin S.I. Teoriya evolyutsionnykh vychisleniy [The theory of evolutionary computation]. Moscow: Fizmatlit, 2012, 260 p.
24. Rodzin S.I., Rodzina L.S. Theory of Bioinspired Search for Optimal Solutions and its Application for the Processing of Problem-Oriented Knowledge, Proc. of the 8th IEEE Int. Conf. Application of Information and Communication Technologies (AICT'2014), Astana, Kazakhstan, pp. 142-146.

Comments are closed.