Table of Contents Author Guidelines Submit a Manuscript
Journal of Mathematics
Volume 2016 (2016), Article ID 4015845, 10 pages
http://dx.doi.org/10.1155/2016/4015845
Research Article

Improving Genetic Algorithm with Fine-Tuned Crossover and Scaled Architecture

Department of Computer Science and Engineering, University of Bridgeport, 126 Park Avenue, Bridgeport, CT 06604, USA

Received 26 November 2015; Revised 13 March 2016; Accepted 21 March 2016

Academic Editor: Niansheng Tang

Copyright © 2016 Ajay Shrestha and Ausif Mahmood. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, Mich, USA, 1975.
  2. D. Fouskakis and D. Draper, “Stochastic optimization: a review,” International Statistical Review, vol. 70, no. 3, pp. 315–349, 2002. View at Publisher · View at Google Scholar · View at Scopus
  3. D. Whitley, A Genetic Algorithm Tutorial, Department of Computer Science, Colorado State University, Fort Collins, Colo, USA, 1993.
  4. D. E. Goldberg and R. Lingle Jr., “Alleles, loci and the TSP,” in Proceedings of the First International Conference on Genetic Algorithms and Their Applications, J. J. Grefenstette, Ed., pp. 154–159, Lawrence Erlbaum Associates, Pittsburgh, Pa, USA, July 1985.
  5. P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, “Genetic algorithms for the travelling salesman problem: a review of representations and operators,” Artificial Intelligence Review, vol. 13, no. 2, pp. 129–170, 1999. View at Publisher · View at Google Scholar · View at Scopus
  6. N. M. Razali and J. Geraghty, “Genetic algorithm performance with different selection strategiesin solving TSP,” in Proceedings of the World Congress on Engineering (WCE '11), vol. 2, pp. 1134–1139, London, UK, July 2011. View at Scopus
  7. C. Nilsson, “Heuristics for the traveling salesman problem,” Tech. Rep., Linköping University, Linköping, Sweden, 2003. View at Google Scholar
  8. G. Reinelt, “TSPLIB—a traveling salesman problem library,” ORSA Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Li, H. Chen, and Z. Tang, “Study of Pseudo-Parallel genetic algorithm with ant colony optimization to solve the TSP,” IJCSNS International Journal of Computer Science and Network Security, vol. 11, no. 3, 2011. View at Google Scholar
  10. X. Yao, “Evolving artificial neural networks,” Proceedings of the IEEE, vol. 87, no. 9, pp. 1423–1447, 1999. View at Publisher · View at Google Scholar
  11. D. H. Nguyen and B. Widrow, “Neural networks for self-learning control systems,” IEEE Control Systems Magazine, vol. 10, no. 3, pp. 18–23, 1990. View at Publisher · View at Google Scholar · View at Scopus
  12. L. Davis, “Applying adaptive algorithms to epistatic domains,” in Proceedings of the International Joint Conferene on Artificial Intelligence (IJCAI '85), vol. 1, pp. 162–164, 1985.
  13. D. Whitley, T. Starteather, and D. Shaner, “The traveling salesman and sequence scheduling: quality solutions using genetic edge recombination,” in Handbook of Genetic Algorithms, L. Davis, Ed., pp. 350–372, D. Van Nostrand Reinhold Company, New York, NY, USA, 1991. View at Google Scholar
  14. S. F. Galán, O. J. Mengshoel, and R. Pinter, “A novel mating approach for genetic algorithms,” Evolutionary Computation, vol. 21, no. 2, pp. 197–229, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. L. J. Eshelman and J. D. Schaffer, “Preventing premature convergence in genetic algorithms by preventing incest,” in Proceedings of the 4th International Conference on Genetic Algorithms (ICGA '91), pp. 115–122, Morgan Kaufmann, San Diego, Calif, USA, July 1991.
  16. G. Ochoa, C. Madler-Kron, R. Rodriguez, and K. Jaffe, “Assortative mating in genetic algorithms for dynamic problems,” in Applications of Evolutionary Computing, vol. 3449 of Lecture Notes in Computer Science, pp. 617–622, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  17. I. J. Wilson, M. E. Weale, and D. J. Balding, “Inferences from DNA data: population histories, evolutionary processes and forensic match probabilities,” Journal of the Royal Statistical Society Series A: Statistics in Society, vol. 166, no. 2, pp. 155–201, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. Y. Guo, Q. Cai, D. C. Samuels et al., “The use of next generation sequencing technology to study the effect of radiation therapy on mitochondrial DNA mutation,” Mutation Research/Genetic Toxicology and Environmental Mutagenesis, vol. 744, no. 2, pp. 154–160, 2012. View at Publisher · View at Google Scholar
  19. M. Li, A. Schonberg, M. Schaefer, R. Schroeder, I. Nasidze, and M. Stoneking, “Detecting heteroplasmy from high-throughput sequencing of complete human mitochondrial DNA genomes,” The American Journal of Human Genetics, vol. 87, no. 2, pp. 237–249, 2010. View at Publisher · View at Google Scholar
  20. W. Amos and J. Harwood, “Factors affecting levels of genetic diversity in natural populations,” Philosophical Transactions of the Royal Society B, vol. 353, no. 1366, pp. 177–186, 1998. View at Publisher · View at Google Scholar
  21. E. Hagelberg, M. Kayser, M. Nagy et al., “Molecular genetic evidence for the human settlement of the Pacific: analysis of mitochondrial DNA, Y chromosome and HLA markers,” Philosophical Transactions of the Royal Society B: Biological Sciences, vol. 354, no. 1379, pp. 141–152, 1999. View at Publisher · View at Google Scholar · View at Scopus