Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 680624, 6 pages
http://dx.doi.org/10.1155/2015/680624
Research Article

Linkage-Based Distance Metric in the Search Space of Genetic Algorithms

1Department of Computer Science & Engineering, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 139-701, Republic of Korea
2Department of Computer Engineering, College of Information Technology, Gachon University, 1342 Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do 461-701, Republic of Korea

Received 31 July 2014; Accepted 7 September 2014

Academic Editor: Shifei Ding

Copyright © 2015 Yong-Hyuk Kim and Yourim Yoon. 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. D. W. Kahn, Topology: An Introduction to the Point-set and Algebraic Areas, Dover Publications, New York, NY, USA, 1995. View at MathSciNet
  2. Y.-H. Kim and B.-R. Moon, “New usage of Sammon's mapping for genetic visualization,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1136–1147, 2003.
  3. A. Moraglio and R. Poli, “Topological interpretation of crossover,” in Proceedings of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 1377–1388, 2004.
  4. M. Wineberg and F. Oppacher, “Distance between populations,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1481–1492, 2003.
  5. Y. Yoon and Y.-H. Kim, “Geometricity of genetic operators for real-coded representation,” Applied Mathematics and Computation, vol. 219, no. 23, pp. 10915–10927, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. S.-S. Choi and B.-R. Moon, “Normalization in genetic algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 862–873, 2003.
  7. Y.-H. Kim, A. Moraglio, A. Kattan, and Y. Yoon, “Geometric generalisation of surrogate model-based optimisation to combinatorial and program spaces,” Mathematical Problems in Engineering, vol. 2014, Article ID 184540, 10 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  8. Y.-H. Kim, A. Moraglio, Y. Yoon, and B.-R. Moon, “Geometric crossover for multiway graph partitioning,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1217–1224, July 2006. View at Scopus
  9. 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
  10. Y. Yoon and Y.-H. Kim, “An efficient genetic algorithm for maximum coverage deployment in wireless sensor networks,” IEEE Transactions on Cybernetics, vol. 43, no. 5, pp. 1473–1483, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. 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 MathSciNet · View at Scopus
  12. Y. Yoon, Y.-H. Kim, A. Moraglio, and B.-R. Moon, “A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation,” Information Sciences, vol. 183, pp. 48–65, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. K. D. Boese, A. B. Kahng, and S. Muddu, “A new adaptive multi-start technique for combinatorial global optimizations,” Operations Research Letters, vol. 16, no. 2, pp. 101–113, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  14. T. Jones and S. Forrest, “Fitness distance correlation as a measure of problem difficulty for genetic algorithms,” in Proceedings of the 6th International Conference on Genetic Algorithms, pp. 184–192, Pittsburgh, Pa, USA, July 1995.
  15. P. Merz and B. Freisleben, “Fitness landscape analysis and memetic algorithms for the quadratic assignment problem,” IEEE Transactions on Evolutionary Computation, vol. 4, no. 4, pp. 337–352, 2000. View at Publisher · View at Google Scholar · View at Scopus
  16. J. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Mich, USA, 1975. View at MathSciNet
  17. J. Bagley, The behavior of adaptive systems which employ genetic and correlation algorithms [Ph.D. thesis], University of Michigan, Ann Arbor, Mich, USA, 1967.
  18. G. R. Harik and D. E. Goldberg, “Learning linkage,” in Foundations of Genetic Algorithms, vol. 4, pp. 247–262, Morgan Kaufmann, San Francisco, Calif, USA, 1996. View at Google Scholar
  19. D. E. Goldberg, B. Korb, and K. Deb, “Messy genetic algorithms: motivation, analysis, and first results,” Complex Systems, vol. 3, no. 5, pp. 493–530, 1989. View at Google Scholar · View at MathSciNet
  20. T. N. Bui and B.-R. Moon, “Hyperplane synthesis for genetic algorithms,” in Proceedings of the 5th International Conference on Genetic Algorithms, pp. 102–109, July 1993.
  21. T. N. Bui and B. R. Moon, “Genetic algorithm and graph partitioning,” IEEE Transactions on Computers, vol. 45, no. 7, pp. 841–855, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  22. T. N. Bui and B. R. Moon, “New genetic approach for the Traveling salesman problem,” in Proceedings of the 1st IEEE Conference on Evolutionary Computation, pp. 7–12, June 1994. View at Scopus
  23. Y.-H. Kim, Y.-K. Kwon, and B.-R. Moon, “Problem-independent schema synthesis for genetic algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1112–1122, Chicago, Ill, USA, July 2003.
  24. B.-R. Moon and C. K. Kim, “A two-dimensional embedding of graphs for genetic algorithms,” in Proceedings of the International Conference on Genetic Algorithms, pp. 204–211, 1997.
  25. Y.-H. Kim and K. Seo, “Two congruence classes for symmetric binary matrices over F2,” WSEAS Transactions on Mathematics, vol. 7, no. 6, pp. 339–343, 2008. View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y.-H. Kim and Y. Yoon, “Effect of changing the basis in genetic algorithms using binary encoding,” KSII Transactions on Internet and Information Systems, vol. 2, no. 4, pp. 184–193, 2008. View at Publisher · View at Google Scholar · View at Scopus
  27. Y. Yoon and Y.-H. Kim, “A mathematical design of genetic operators on GLn(Z2),” Mathematical Problems in Engineering, vol. 2014, Article ID 540936, 8 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  28. M. Anderson and T. Feil, “Turning lights out with linear algebra,” Mathematics Magazine, vol. 71, no. 4, pp. 300–303, 1998. View at Publisher · View at Google Scholar · View at MathSciNet
  29. S.-H. Kim, Y.-H. Kim, and B.-R. Moon, “A hybrid genetic algorithm for the max cut problem,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 416–423, 2001.
  30. K. Seo, S. Hyun, and Y.-H. Kim, “A spanning tree-based encoding of the MAX CUT problem for evolutionary search,” in Proceedings of the International Conference on Parallel Problem Solving from Nature, vol. 7491 of Lecture Notes in Computer Science, pp. 510–518, 2012.
  31. K. Seo, S. Hyun, and Y.-H. Kim, “An edge-set representation based on spanning tree for searching cut space,” IEEE Transactions on Evolutionary Computation, 2014. View at Publisher · View at Google Scholar
  32. Y.-H. Kim and B.-R. Moon, “Investigation of the fitness landscapes and multi-parent crossover for graph bipartitioning,” in Genetic and Evolutionary Computation—GECCO 2003, vol. 2723 of Lecture Notes in Computer Science, pp. 1123–1135, Springer, Berlin, Germany, 2003. View at Google Scholar
  33. Y.-H. Kim and B.-R. Moon, “Investigation of the fitness landscapes in graph bipartitioning: an empirical study,” Journal of Heuristics, vol. 10, no. 2, pp. 111–133, 2004. View at Publisher · View at Google Scholar · View at Scopus
  34. I. Hwang, Y.-H. Kim, and B.-R. Moon, “Multi-attractor gene reordering for graph bisection,” in Proceedings of the 8th Annual Genetic and Evolutionary Computation Conference, pp. 1209–1215, July 2006. View at Scopus
  35. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, “Optimization by simulated annealing: an experimental evaluation, part I. Graph partitioning,” Operations Research, vol. 37, no. 6, pp. 865–892, 1989. View at Publisher · View at Google Scholar · View at Scopus
  36. Y.-H. Kim, “An enzyme-inspired approach to surmount barriers in graph bisection,” in Proceedings of the International Conference on Computational Science and Its Applications, vol. 5072 of Lecture Notes in Computer Science, pp. 841–851, 2008.
  37. Y.-H. Kim and B.-R. Moon, “A hybrid genetic search for graph partitioning based on lock gain,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 167–174, 2000.
  38. 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
  39. Y. Yoon and Y.-H. Kim, “New bucket managements in iterative improvement partitioning algorithms,” Applied Mathematics and Information Sciences, vol. 7, no. 2, pp. 529–532, 2013. View at Publisher · View at Google Scholar · View at Scopus
  40. Y. Yoon and Y.-H. Kim, “Vertex ordering, clustering, and their application to graph partitioning,” Applied Mathematics and Information Sciences, vol. 8, no. 1, pp. 135–138, 2014. View at Publisher · View at Google Scholar · View at Scopus