Excellence in Research and Innovation for Humanity

International Science Index

Select areas to restrict search in scientific publication database:
Combined Simulated Annealing and Genetic Algorithm to Solve Optimization Problems
Combinatorial optimization problems arise in many scientific and practical applications. Therefore many researchers try to find or improve different methods to solve these problems with high quality results and in less time. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used to solve optimization problems. Both GA and SA search a solution space throughout a sequence of iterative states. However, there are also significant differences between them. The GA mechanism is parallel on a set of solutions and exchanges information using the crossover operation. SA works on a single solution at a time. In this work SA and GA are combined using new technique in order to overcome the disadvantages' of both algorithms.
Digital Article Identifier (DAI):


[1] An Introduction to Genetic Algorithms for Electromagnetics. Haupt, R.L. 2, s.l. : IEEE, April 1995, Vol. 37, pp. 7-15.
[2] Parallel simulated annealing and genetic algorithms: A space of hybrid methods. H Chen, N S Flann. s.l: International Conference on Evolutionary Computation the Third Conference Parallel Problem Solving, 1994. 866.
[3] Genetic algorithms and very fast simulated reannealing: A comparison. Rosen, L. Ingber and B. 11, s.l. : Mathematical Computer Modeling, 1992, Vol. 16. 87-100.
[4] Metropolis, N, et al. Equation of State Calculations by Fast Computing Machines. Florida State University. (Online) 1953. (Cited: 2 17, 2008.) www.csit.fsu.edu/~beerli/mcmc/metropolis-et-al-1953.pdf.
[5] W. Thomas. Global Optimization Algorithms Theory and Application. Thomas Weise. (Online) 2008. (Cited: 11 7, 2008.) http://www.itweise. de/projects/book.pdf.
[6] S. Kirkpatrick, C. D. Gelatt, Jr., M. P. Vecchi. Optimization by Simulated Annealing. Computer Engineering Research Group. (Online) May 13, 1983. (Cited: 8 13, 2007.) http://www.eecg.utoronto.ca/~janders/ece1387/readings/sim_anneal.pdf.
[7] Bradley, J and Lambert, C. Simulated Annealing Applications. University of Victoria . (Online) November 18, 1999. (Cited: 4 12, 2008.) http://www.me.uvic.ca/~zdong/courses/mech620/SA_App.PDF.
[8] Beasley, D, Bull, D R and Martin, R. An Overview of Genetic Algorithms :. Part 1, Fundamentals. Norwegian University of Science and Technology. (Online) 93. (Cited: 3 24, 2008.) http://www.idi.ntnu.no/emner/it3704/lectures/papers/Beasley93GA.pdf.
[9] Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Holland, J. s.l. : The University of Michigan Press, 1975.
[10] An Improved Genetic Algorithm to Solve the Traveling Salesman Problem. Sallabi, Omar M and Elhaddad, Younis R. Rome : World Academy of Science, Engineering and Technology, 2009. pp. 471-474. Issue 52.
[11] http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/. Heidelberg University. (Online) (Cited: 1 22, 2007.)
Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007