Buradasınız

Anasayfa » Content

Population-Based Metaheuristics: A Comparative Analysis

Journal Name:

  • International Journal of Science and Engineering Investigations

Publication Year:

  • 2012

Key Words:

Author Name
Abstract (2. Language): 
To optimally solve hard optimization problems in real life, many methods were designed and tested. The metaheuristics proved to be the generally adequate techniques, while the exact traditional optimization mathematical methods are prohibitively expensive in computational time. The population-based metaheuristics, which manipulate a set of candidate solutions at a time, have advantages over the single-state methods and therefore are preferred techniques when hard problems are to be solved. Such metaheuristics include Genetic Algorithms, Ant Colony Optimization, Particle Swarm Optimization, Scatter Search and many more methods. In this survey a comparative analysis of the main population-based metaheuristics was accomplished; the focus is on the fundamental properties regarding operational principle, on the adequate problems, the advantages and disadvantages in use.
Bookmark/Search this post with
FULL TEXT (PDF): 
PDF icon arastirmax-population-based-metaheuristics-comparative-analysis.pdf
  • 8
84-88
  • Turkish

REFERENCES

References: 

[1] K. Deb, “Multi-objective genetic algorithms: Problem difficulties and construction of test problems”, Evol. Comp. J, vol. 7, pp. 205-230, 1999.
[2] F. Glover, "Future Paths for Integer Programming and Links to Artificial Intelligence", Comp. Oper. Res., vol. 13, pp. 533–549, 1986.
[3] S. Luke, Essentials of metaheuristics, Lulu, online version 1.1, 2011.
[4] E. S. Nicoară, GA-based Control of Multi-objective Flexible Job Shop Scheduling Processes (in Romanian), Ph.D. Dissertation, Informatics Dept., Petroleum-Gas University of Ploieşti, Ploiesti, Romania, 2011.
[5] D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence, Piscataway, NJ: IEEE Press, 1995.
[6] J. H. Holland, Adaptation in Natural and Artificial Systems, MIT Press The University of Michigan Press, Ann Arbor, 1975.
[7] O. J. Sharpe, Towards a rational methodology for using evolutionary search algorithms, Ph.D. Dissertation, School of Cognitive and Computing Sciences, University of Sussex, 2000.
[8] M. Dorigo, Optimization, Learning and Natural Algorithms, Ph.D. Dissertation (in Italian), Politecnico di Milano, Italy, 1992.
[9] M. Dorigo and G. Di Caro, The ant colony optimization meta-heuristic, in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds., McGraw-Hill, 1999.
[10] M. Dorigo and T. Stutzle, „The Ant Colony Optimization metaheuristic: algorithms, application and advances”, Int. S. Oper. Res. Man. Sc., vol. 57, Handbook of Metaheuristics, F. Glover and G. Kochenberger, Eds., Kluwer Academic Publishers, Norwell, MA, 2002, pp. 251-285.
[11] J. Kennedy and R. Eberhart, “Particle swarm optimization”, Proc. of IEEE Int. C. on Neural Networks, Perth, Australia, IEEE Service Center, Piscataway, NJ, 1995, pp. 1942-1948.
[12] F. Glover, M. Laguna, and R. Martí, “Fundamentals of Scatter Search and Path Relinking”, Contr. Cyb., vol. 39, 2000, pp. 653-684.
[13] F. Glover, “Genetic Algorithms and Scatter Search: Unsuspected Potentials”, Stat. Comp., vol. 4, 1994, pp. 131-140.

Thank you for copying data from http://www.arastirmax.com