Approaches of Meta Heuristics Optimization Techniques

J. Sheik Mohamed*, S. Ramakrishna**, P. Chittibabu***
* Research Scholar, Department of Computer Science, SVUCCMCS, S. V. University, Tirupathi, Andhra Pradesh, India.
** Professor, Department of Computer Science, SVUCCMCS, S. V. University, Tirupathi, Andhra Pradesh, India.
*** Principal, APGCCS, Rajampet, Kadapa Dist, Andhra Pradesh, India.
Periodicity:December - February'2014
DOI : https://doi.org/10.26634/jcom.1.4.2717

Abstract

Optimization is ubiquitous and spontaneous process that forms an integral part of day-to-day life. In the most basic sense, it can be defined as an art of selecting the best alternative among a given set of options. Optimization plays an important role in Engineering designs, Agricultural sciences, Manufacturing systems, Economics, Physical sciences, Pattern recognition[1] and other such related fields. The objective of optimization is to seek values for a set of parameters that maximize or minimize the objective functions subject to certain constraints. A choice of values for the set of parameters that satisfy all the constraints is called a feasible solution. Feasible solutions with objective function value(s) are as good as the values of any other feasible solutions, that are called as optimal solutions. In order to use optimization successfully, they must first determine an objective through which they can measure the performance of the system under study. That objective could be time, cost, weight, potential energy or any combination of quantities that can be expressed by a single variable. The objective relies on certain characteristics of the system, called variable or unknowns. The optimization algorithms come from different areas and are inspired by different techniques. But they are sharing some common characteristics. They are iteratives that are begun with an initial guess of the optimal values of the variables and then generate a sequence of improved estimates until they converge to a solution.

Keywords

Optimization, Metaheuristics, Genetic Algorithm, Ant Colony, Simulated Annealing

How to Cite this Article?

Mohamed, J.S., Ramakrishna, S., and Chittibabu, P. (2014). Approaches Of Meta Heuristics Optimization Techniques. i-manager’s Journal on Computer Science, 1(4), 32-40. https://doi.org/10.26634/jcom.1.4.2717

References

[1]. Al-Sultan, K.S., (1995). “A tabu search approach to the clustering problem Pattern Recognition”, 28(9): 1443- 1451.
[2]. Christian Blum and Andrea Roli, (2003). “Metaheuristics in combinatorial optimization: Overview and conceptual comparison”., ACM Computing Surveys, 35(3):268–308.
[3]. Dorigo, M. and V. Maniezzo, (1992). “Optimization, Learning and Natural Algorithms”. Ph.D. Thesis, Politecnico di Milano, Italy.
[4]. Fred Glover and Gary A. Kochenberger, (2003). “Handbook of Metaheuristics, volume57 of International Series in Operations Research & Management Science”., Springer, New York, USA.
[5]. Glover, F., (1989). “Tabu search-part I., ORSA, J. Computer”., 1(3): 190-206.
[6]. Holland, J., (1975). “An introduction with application to biology, control and artificial intelligence Adaptation in Natural and Artificial System”, MIT Press, Cambridge, MA.
[7]. Kirkpatrick, S., C.D. Gelatt and M.P. Vecchi, (1983). “Optimization by simulated annealing Science”, 220(4598): 671-680.
[8]. Shyr, W.J., (2008). “Introduction and Comparison of Three Evolutionary Based Intelligent Algorithms for Optimal Design”, Third 2008 International Conference on Convergence and Hybrid Information Technology, pp: 879-884.
[9]. Teofilo F. Gonzalez, (2007). “Hand book of Approximation Algorithms and Metaheuristics”., Chapmann & Hall/CRC Computer and Information Science Series.
[10]. Thomas Back, (1996). “Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms”., Oxford University US.
[11]. Z bigniew Michale wiczand David B. Fogel, (2004). “How to Solve It: Modern Heuristics”., Springer, second revised and extended edition.
If you have access to this article please login to view the article or kindly login to purchase the article

Purchase Instant Access

Single Article

North Americas,UK,
Middle East,Europe
India Rest of world
USD EUR INR USD-ROW
Pdf 35 35 200 20
Online 35 35 200 15
Pdf & Online 35 35 400 25

Options for accessing this content:
  • If you would like institutional access to this content, please recommend the title to your librarian.
    Library Recommendation Form
  • If you already have i-manager's user account: Login above and proceed to purchase the article.
  • New Users: Please register, then proceed to purchase the article.