Другие журналы

scientific edition of Bauman MSTU

SCIENCE & EDUCATION

Bauman Moscow State Technical University.   El № FS 77 - 48211.   ISSN 1994-0408

Global optimization based on methods of particle swarm, mind evolution and clonal selection

# 08, August 2012
DOI: 10.7463/0812.0431723
Article file: Карпенко_P.pdf (1087.24Kb)
authors: A.E. Antukh, A.P. Karpenko

References

1. Luke S. Essentials of Metaheuristics. A Set of Undergraduate Lecture Notes. Department of Computer Science George Mason University. Available at: http://cs.gmu.edu/~sean/book/metaheuristics/Essentials.pdf .
 
 
2. Karpenko A.P. Populiatsionnye algoritmy global'noi poiskovoi optimizatsii. Obzor novykh i maloizvestnykh algoritmov [Population algorithms of global search optimization. Overview of new and little-known algorithms]. Prilozhenie k zhurnalu «Informatsionnye tekhnologii» [Supplement to the journal "Information Technologies"], 2012. In press.
 
 
3. Wang X. Hybrid nature-inspired computation method for optimization. Dokt. diss. Helsinki University of Technology, TKK Dissertations, Espoo, 2009. 161 p.
 
 
4. Raidl G.R. A Unified View on Hybrid Metaheuristics. Hybrid Metaheuristics. Proc. of Third International Workshop, Gran Canaria, Spain, 13-14 October 2006. Springer-Verlag, 2006, pp. 1–12. (Lecture Notes in Computer Science (LNCS), vol. 4030).
http://dx.doi.org/10.1007/11890584
 
5. El-Abd, Kamel M. A taxonomy of cooperative search algorithms. Hybrid Metaheuristics. Proc. of Second International Workshop, Barcelona, Spain, 29-30 August 2005. Springer-Verlag, 2005, pp. 32–41. (Lecture Notes in Computer Science (LNCS), vol. 3636). 
http://dx.doi.org/10.1007/11546245
 
6. Krasnogor N. Studies on the Theory and Design Space of Memetic Algorithms. Ph.D. Thesis. Faculty of Computing, Mathematics and Engineering, University of the West of England, Bristol, U.K., 2002. 289 p.
 
 
7. Eiben A.E., Michalewicz Z., Schoenauer M., Smith J.E. Parameter Control in Evolutionary Algorithms. Parameter Setting in Evolutionary Algorithms. Springer-Verlag, 2007, pp. 19-46. (Studies in Computational Intelligence, vol. 54).
http://dx.doi.org/10.1007/978-3-540-69432-8
 
8. Smith J.E., Fogarty T.C. Operator and parameter adaptation in genetic algorithms. Soft Computing, 1997, no. 1, pp. 81-87.
http://dx.doi.org/10.1007/s005000050009
 
9. Karpenko A.P., Seliverstov E.Iu. Obzor metodov roia chastits (PSO) dlia zadachi global'noi optimizatsii [Review of the particle swarm optimization method (PSO) for a global optimization problem]. Nauka i obrazovanie MGTU im. N.E. Baumana [Science and Education of the Bauman MSTU], 2009, no. 3. Available at: http://technomag.edu.ru/doc/116072.html, accessed 14.07.2012.
 
 
10. Chen M.-R., Lu Y.-Z., Luo Q. A novel hybrid algorithm with marriage of particle-swarm optimization and extremely optimization. Optimization OnlineDigest - May 2007. Available at: http://www.optimization-online.org/ARCHIVE_DIGEST/2007-05.html, accessed 14.07.2012.
 
 
11. Boettcher S., Percus A.G. Nature's way of optimizing. Artificial Intelligence, 2000, vol. 119, no. 1-2, pp. 275-286. Available at: http://www.sciencedirect.com/science/journal/00043702/119/1-2, accessed 14.07.2012.
 
 
12. Kaveh A., Talatahari S. Optimal design of skeletal structures via the charged system search algorithm. Structural Multidisciplinary Optimization, 2010, vol. 37, pp. 893-911.
http://dx.doi.org/10.1007/s00158-009-0462-5
 
13. Kaveh A., Talatahari S. A novel heuristic optimization method: Charged system search. Acta Mechanica, 2010, vol. 213, pp. 267-286.
http://dx.doi.org/10.1007/s00707-009-0270-4
 
14. Kennedy J., Eberhart R. C. A discrete binary version of the particle swarm algorithm. Proc. of 1997 IEEE International Conference on Systems, Man and Cybernetics, 1997, Vol. 5, pp. 4104-4108.
 
15. Khamsawang S., Boonseng C., Pothiya S. Solving the economic dispatch problem with tabu search algorithm. IEEE International Conference on Industrial Technology (ICIT '02), Bangkok, Thailand, 2002, vol. 1, pp. 274–278. DOI: 10.1109/ICIT.2002.1189906
http://dx.doi.org/10.1109/ICIT.2002.1189906
 
16. George A.J.T., Gray D. Receptor editing during affinity maturation. Immunology Today, 1999, vol. 20, no. 4, p. 196.
http://dx.doi.org/10.1016/S0167-5699(98)01408-X
 
17. Rossato de Oliveira D., Parpinelli R.S., Lopes H.S. Bioluminescent Swarm Optimization Algorithm. Evolutionary Algorithms. InTech Publ., 2011, ch. 5, pp. 69-84. 
http://dx.doi.org/10.5772/627
 
18. Kaveh A., Talatahari S. Engineering optimization with hybrid particle swarm and ant colony optimization. Asian journal of civil engineering, 2009, vol. 10, no. 6, pp. 611-628.
 
 
19. Mehrabian A.R., Lucas C. A novel numerical optimization algorithm inspired from weed colonization. Ecological Informatics, 2006, vol. 1, pp. 355–366.
http://dx.doi.org/10.1016/j.ecoinf.2006.07.003
 
20. Jianchao Zeng, Kai Zha. An Mind Evolution Method for Solving Numerical Optimization Problems. Proc. 3rd World Congress on Intelligent Control and Automation, Hefei, P.R. China, 2000, pp. 126-128.
 
21. Jie J., Han Ch., Zeng J. An Extended Mind Evolutionary Computation Model for Optimizations. Applied Mathematics and Computation, 2007, no. 185(2), pp. 1038 – 1049.
 
 
22. Dasgupta D., Ed. Artificial Immune Systems and Their Applications, Springer-Verlag, Inc. Berlin, 1999. (Russ. ed.: Dasgupta D. Iskusstvennye immunnye sistemy i ikh primenenie. Moscow, Fizmatlit, 2006. 344 p.).
 
 
23. Zhan Z-H., Zhang J. Adaptive Particle Swarm Optimization. Proc. of the 6th International Conference on Ant Colony Optimization and Swarm Intelligence (ANTS 2008), Brussels, Belgium, 22-24 September 2008.Springer-Verlag Berlin and Heidelberg, 2008, pp. 227-234. (Lecture Notes in Computer Science (LNCS), vol. 5217). 
http://dx.doi.org/10.1007/978-3-540-87527-7
 
24. Fan E. Global optimization of Lennard-Jones atomic clusters. MASTER OF SCIENCE. McMaster University, COMPUTING & SOFTWARE, Hamilton, Ontario, 2002. Available at: http://camo.ici.ro/books/thesis/ellen.pdf .
 
 
25. Cai W., et al. Optimization of Lennard-Jones atomic clusters. Journal of Molecular Structure (Theochem), 2002, no. 579, pp. 229-234.
http://dx.doi.org/10.1016/S0166-1280(01)00730-8
Поделиться:
 
SEARCH
 
elibrary crossref ulrichsweb neicon rusycon
Photos
 
Events
 
News



Authors
Press-releases
Library
Conferences
About Project
Rambler's Top100
Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)
  RSS
© 2003-2024 «Наука и образование»
Перепечатка материалов журнала без согласования с редакцией запрещена
 Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)