Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2016, Article ID 3512546, 13 pages
http://dx.doi.org/10.1155/2016/3512546
Research Article

A New Adaptive Hungarian Mating Scheme in Genetic Algorithms

1Department of Computer Science and Engineering, Seoul National University, 1 Gwanak-ro, Gwanak-gu, Seoul 08826, Republic of Korea
2Department of Computer Science and Engineering, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 01890, Republic of Korea
3Department of Computer Engineering, Gachon University, 1342 Sengnamdaero, Sujeong-gu, Seongnam-si, Gyeonggi-do 13120, Republic of Korea

Received 10 December 2015; Revised 1 March 2016; Accepted 17 March 2016

Academic Editor: Lu Zhen

Copyright © 2016 Chanju Jung et al. 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. G. Ochoa, C. Mädler-Kron, R. Rodriguez, and K. Jaffe, “Assortative mating in genetic algorithms for dynamic problems,” in Applications of Evolutionary Computing, pp. 617–622, Springer, Berlin, Germany, 2005. View at Google Scholar
  2. L. B. Booker, “Improving the performance of genetic algorithms in classifier systems,” in Proceedings of the 1st International Conference on Genetic Algorithms, pp. 80–92, Lawrence Erlbaum Associates, 1985.
  3. C. M. Fonseca and P. J. Fleming, “Genetic algorithms for multiobjective optimization: formulation discussion and generalization,” in Proceedings of the 5th International Conference on Genetic Algorithms, S. Forrest, Ed., vol. 1, pp. 416–423, July 1993.
  4. F. Ramezani and S. Lotfi, “IAMGA: intimate-based assortative mating genetic algorithm,” in Proceedings of the Swarm Evolutionary and Memetic Computing Conference, pp. 240–247, 2011.
  5. C. Fernandes, R. Tavares, C. Munteanu, and A. Rosa, “Using assortative mating in genetic algorithms for vector quantization problems,” in Proceedings of the ACM Symposium on Applied Computing (SAC '01), pp. 361–365, ACM, 2001. View at Publisher · View at Google Scholar
  6. H. Ishibuchi, K. Narukawa, N. Tsukamoto, and Y. Nojima, “An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization,” European Journal of Operational Research, vol. 188, no. 1, pp. 57–75, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. H. Ishibuchi and Y. Shibata, “Mating scheme for controlling the diversity-convergence balance for multiobjective optimization,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1259–1271, Seattle, Wash, USA, June 2004.
  8. 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
  9. C. Jung, Y.-H. Kim, Y. Yoon, and B.-R. Moon, “An adaptive method of Hungarian mating schemes in genetic algorithms,” in Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, pp. 1413–1414, Madrid, Spain, 2015. View at Scopus
  10. C. Jung, Y.-H. Kim, Y. Yoon, and B.-R. Moon, “Investigation of Hungarian mating schemes for genetic algorithms,” in Proceedings of the 29th Annual ACM Symposium on Applied Computing (SAC '14), pp. 140–147, ACM, Gyeongju, Republic of Korea, March 2014. View at Publisher · View at Google Scholar · View at Scopus
  11. D. E. Goldberg and R. Lingle, “Alleles, loci, and the traveling salesman problem,” in Proceedings of the International Conference on Genetic Algorithms and Their Applications, pp. 154–159, 1985.
  12. O. Martin, E. W. F. Steve, and W. Otto, “Large-step Markov chains for the traveling salesman problem,” Complex Systems, vol. 5, no. 3, pp. 299–251, 1991. View at Google Scholar
  13. H. Ishibuchi and Y. Shibata, “A similarity-based mating scheme for evolutionary multiobjective optimization,” in Genetic and Evolutionary Computation—GECCO 2003, E. Cantú-Paz, J. A. Foster, K. Deb et al., Eds., vol. 2723 of Lecture Notes in Computer Science, pp. 1065–1076, 2003. View at Publisher · View at Google Scholar
  14. H. W. Kuhn, “The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, vol. 2, pp. 83–97, 1955. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982. View at MathSciNet
  16. D. Avis, “A survey of heuristics for the weighted matching problem,” Networks, vol. 13, no. 4, pp. 475–493, 1983. View at Publisher · View at Google Scholar
  17. P. Hahn, T. Grant, and N. Hall, “A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method,” European Journal of Operational Research, vol. 108, no. 3, pp. 629–640, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  18. A. Moraglio, Y.-H. Kim, Y. Yoon, and B.-R. Moon, “Geometric crossovers for multiway graph partitioning,” Evolutionary Computation, vol. 15, no. 4, pp. 445–474, 2007. View at Publisher · View at Google Scholar · View at Scopus
  19. Y. Yoon, Y.-H. Kim, and B.-R. Moon, “Feasibility-preserving crossover for maximum k-coverage problem,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '08), pp. 593–598, Atlanta, Ga, USA, July 2008.
  20. Y. Yoon, Y.-H. Kim, A. Moraglio, and B.-R. Moon, “Quotient geometric crossovers and redundant encodings,” Theoretical Computer Science, vol. 425, pp. 4–16, 2012. View at Publisher · View at Google Scholar · View at Scopus
  21. K. S. Goh, A. Lim, and B. Rodrigues, “Sexual selection for genetic algorithms,” Artificial Intelligence Review, vol. 19, no. 2, pp. 123–152, 2003. View at Publisher · View at Google Scholar · View at Scopus
  22. A. Moraglio and R. Poli, “Topological interpretation of crossover,” in Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '04), vol. 3102, pp. 1377–1388, Seattle, Wash, USA, June 2004.
  23. K. A. De Jong, An analysis of the behavior of a class of genetic adaptive systems [Ph.D. dissertation], University of Michigan, Ann Arbor, Mich, USA, 1975.
  24. G. Reinelt, “TSPLIB—a traveling salesman problem library,” INFORMS Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Google Scholar
  25. B. L. Welch, “The generalization of “Student's” problem when several different population variances are involved,” Biometrika, vol. 34, no. 1-2, pp. 28–35, 1947. View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y.-H. Kim and B.-R. Moon, “Lock-gain based graph partitioning,” Journal of Heuristics, vol. 10, no. 1, pp. 37–57, 2004. View at Publisher · View at Google Scholar · View at Scopus