Geometric crossovers for multiway graph partitioning

Evolutionary Computation

Volumn 15, Issue 4, 2007, Pages 445-474

  Moraglio, Alberto ^a   Kim, Yong Hyuk ^b   Yoon, Yourim ^c   Moon, Byung Ro ^c  

^a UNIVERSITY OF COIMBRA   (Portugal)

^b Kwangwoon University   (South Korea)

^c Seoul National University   (South Korea)

Author keywords

Cycle crossover; Genetic algorithms; Geometric crossover; Graph partitioning

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; THEORETICAL MODEL;

ALGORITHMS; MODELS, GENETIC; MODELS, THEORETICAL;

EID: 38149068280     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/evco.2007.15.4.445     Document Type: Article

References (39)

1. Avis, D. (1983). A survey of heuristics for the weighted matching problem. Networks, 13:475-493.
2. Battiti, R. and Bertossi, A. (1999). Greedy, prohibition, and reactive heuristics for graph partitioning. IEEE Transactions on Computers, 48(4):361-385.
3. Boese, K. D., Kahng, A. B., and Muddu, S. (1994). A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters, 15:101-113.
4. Bui, T. N. and Moon, B. R. (1996). Genetic algorithm and graph partitioning. IEEE Transactions on Computers, 45(7):841-855.
5. Choi, S. S. and Moon, B. R. (2003). Normalization in genetic algorithms. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 862-873.
6. Cong, J. and Lim, S. K. (1998). Multiway partitioning with pairwise movement. In Proceedings of the International Conference on Computer-Aided Design, pages 512-516.
7. Cong, J., Lim, S. K., and Wu, C. (2000). Performance driven multi-level and multiway partitioning with retiming. In Proceedings of the. ACM/IEEE-CAS/EDAC Design Automation Conference, pages 274-279.
8. Dutt, S. (1993). New faster kernighan-lin-type graph-partitioning algorithms. In Proceedings of the IEEE/ACM International Conference on Computer-Aided. Design, pages 370-377.
9. Fiduccia, C. and Mattheyses, R. (1982). A linear time heuristics for improving network partitions. In Proceedings of the 19th ACM/IEEE Design Automation Conference, pages 175-181.
10. Garey, M. and Johnson, D. S. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
11. Glover, F., Laguna, M., and Marti, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3):653-684.
12. Goldberg, D. E. and Lingle, R. (1985). Alleles, loci, and the travelling salesman problem. In Proceedings of the First International Reference on Genetic Algorithms and their Applications, pages 154-159.
13. Hohn, C. and Reeves, C. R. (1996). Graph partitioning using genetic algorithms. In Proceedings of the 2nd International Conference on Massively Parallel Computing Systems, pages 31-38.
14. Hu, T. C. and Kuh, E. S. (1985). VLSI Circuit Layout Theory and Design. IEEE Press, New York.
15. Hwang, I., Kim, Y. H., and Moon, B. R. (2006). Multi-attractor gene reordering for graph bisection. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1209-1215.
16. Johnson, D. S., Aragon, C., McGeoch, L., and Schevon, C. (1989). Optimization by simulated annealing: An experimental evaluation, Part 1, graph partitioning. Operations Research, 37:865-892.
17. Jones, D. R. and Beltramo, M. A. (1991). Solving partitioning problems with genetic algorithms. In Proceedings of the 4th International Conference on Genetic Algorithms, pages 442-450.
18. Jones, T (1995). Evolutionary Algorithms, Fitness Landscapes and Search. PhD thesis, University of New Mexico.
19. Kahn, D. W. (1995). Topology: An Introduction to the Point-Set and Algebraic Areas. Dover Publications, Inc., New York.
20. Kang, S. J. and Moon, B. R. (2000). A hybrid genetic algorithm for multiway graph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 159-166.
21. Karypis, G. and Kumar, V. (1998). Multilevel k-way partitioning scheme for irregular graphs. Journal of Parallel and Distributed Computing, 48(1):96-129.
22. Kernighan, B. and Lin, S. (1970). An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal, 49:291-307.
23. Kim, J. P. and Moon, B. R. (2001). A hybrid, genetic search for multi-way graph partitioning based on direct partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 408-415.
24. Kim, Y. H. and Moon, B. R. (2004). Lock-gain based graph partitioning. Journal of Heuristics, 10(1):37-57.
25. Kim, Y. H., Yoon, Y., Moraglio, A., and Moon, B. R. (2006). Geometric crossover for multiway graph partitioning. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1217-1224.
26. Kuhn, H. W. (1955). The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83-97.
27. Laszewski, G. (1991). Intelligent structural operators for the k-way graph partitioning problem. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 45-52.
28. Merz, P. and Freisleben, B. (2000). Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning. Evolutionary Computation, 8(1):61-91.
29. Moraglio, A. and Poli, R. (2004). Topological interpretation of crossover. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 1377-1388.
30. Moraglio, A. and Poli, R. (2005a). Geometric crossover for the permutation representation. Technical Report CSM-429, University of Essex.
31. Moraglio, A. and Poli, R. (2005b). Topological crossover for the permutation representation. In GECCO 2005 Workshop on Theory of Representations.
32. Moraglio, A., Poli, R., and Seehuus, R. (2006). Geometric crossover for biological sequences. In Proceedings of European Conference on Genetic Programming, pages 121-132.
33. Oliver, I. M., Smith, D. J., and Holland, J. R. C. (1987). A study of permutation crossover operators on the travelling salesman problem. In Proceedings of the Second International Conference on Genetic Algorithms, pages 224-230.
34. Papadimitriou, C. H. and Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Inc., second edition.
35. Pardalos, P. M. and Resende, M. G. C., editors (2002). Handbook of Applied Optimization. Oxford University Press.
36. Radcliffe, N. (1991). Forma analysis and random respectful recombination. In Proceedings of the Fourth International Conference on Genetic Algorithms, pages 31-38.
37. Sadayappan, P., Ercal, F., and Ramanujam, J. (1998). Partitioning graphs on message-passing machines by pairwise mincut. Information Sciences, 111:223-237.
38. Sanchis, L. A. (1989). Multiple-way network partitioning. IEEE Transactions on Computers, 38(1):62-81.
39. Weinberger, E. D. (1990). Correlated, and uncorrelated fitness landscapes and how to tell the difference. Biological Cybernetics, 63:325-336.