INTERNATIONAL RESEARCH JOURNAL OF SCIENCE ENGINEERING AND TECHNOLOGY

( Online- ISSN 2454 -3195 ) New DOI : 10.32804/RJSET

Impact Factor* - 6.2311


**Need Help in Content editing, Data Analysis.

Research Gateway

Adv For Editing Content

   No of Download : 136    Submit Your Rating     Cite This   Download        Certificate

A REVIEW: HEURISTIC ALGORITHMS

    1 Author(s):  JUGMENDRA SINGH

Vol -  5, Issue- 4 ,         Page(s) : 59 - 67  (2015 ) DOI : https://doi.org/10.32804/RJSET

Abstract

An algorithm is a precise, step-by-step set of instructions for solving a task. An algorithm does not solve a task; it gives you a series of steps that, if executed correctly, will result in a solution to a task. You use algorithms every day but you often do not explicitly think about the individual steps of the algorithm. Nowadays computers are used to solve incredibly complex problems. But in order to manage with a problem we should develop an algorithm. Sometimes the human brain is not able to accomplish this task. Moreover, exact algorithms might need centuries to manage with formidable challenges. In such cases heuristic algorithms that find approximate solutions but have acceptable time and space complexity play indispensable role. In this paper heuristics, their areas of application and the basic underlying ideas are surveyed. We also describe in more detail some modern heuristic techniques, namely Evolutionary Algorithms, Genetic algorithm and neural network.

1.  S. A. Cook. ”An overview of computational complexity”, in Communication of the ACM, vol. 26, no. 6, June 1983, pp. 401–408.
2.  T. Cormen, Ch. Leiserson, R. Rivest. Introduction to algorithms. MIT Press, 1989.
3.  M. R. Garey, D. S. Johnson. Computers and Intractability. Freeman&Co, 1979.
4.  Z. Xiang, Q. Zhang, W. Zhu, Z. Zhang, Y. Q. Zhang. ”Peer-to-Peer Based Mul- timedia Distribution Service”, in IEEE Transactions on Multimedia, vol. 6, no. 2, Apr. 2004, pp. 343–355.
5.  M. E. Aydin, T. C. Fogarty. ”A Distributed Evolutionary Simulated Annealing Algorithm for Combinatorial Optimization Problems”, in Journal of Heuristics, vol. 24, no. 10, Mar. 2004, pp. 269–292.
6.  R. Battiti. ”Reactive search: towards self-tuning heuristics”, in Modern heuristic search methods. Wiley&Sons, 1996, pp. 61-83.
7.  R. Eberhart, Y. Shi, and J. Kennedy. Swarm intelligence. Morgan Kaufmann, 2001.
8.  B. Kr¨ose, P. Smagt. An introduction to Neural Networks. University of Amsterdam, Nov. 1996.
9.  D. Karaboga, D. Pham. Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer Verlag, 2000.
10.  X. Wu, B. S. Sharif, O. R. Hinton. ”An Improved Resource Allocation Scheme for Plane Cover Multiple Access Using Genetic Algorithm”, in IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, Feb. 2005, pp.74–80.
11.  J.C. Crput, A. Koukam, T. Lissajoux, A. Caminada. ”Automatic Mesh Genera- tion for Mobile Network Dimensioning Using Evolutionary Approach”, in IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, Feb. 2005, pp. 18–30.
12.  F. Divina, E. Marchiori. ”Handling Continuous Attributes in an Evolutionary In- ductive Learner”, in IEEE Transactions on Evolutionary Computation, vol. 9, no. 1, Feb. 2005, pp. 31–43.
13. R.R. Yager, (1992), “Adaptive Models for the Defuzzification Process.” Proc. Second Intern. Conf. on  Neural Networks, Iizuka, Japan, pp. 65-71.
14. M.A.Pereira, , C.A.F.Murari, and Jr. C.A Castro,. (1999) “A heuristic algorithm for distribution systems” service restoration. Elsevier, 102,pp. 125-133.
15. J.J. Buckley, and Y. Hayashi, (1994), “ Neural networks: a survey”. Elsevier, 66(1), pp. 1-13.

*Contents are provided by Authors of articles. Please contact us if you having any query.






Bank Details