Memetic algorithms and the fitness landscape of the graph bi-partitioning problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1498 LNCS, Issue , 1998, Pages 765-774

  Merz, Peter ^a   Freisleben, Bernd ^a  

^a UNIVERSITY OF SIEGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GRAPHIC METHODS; LOCAL SEARCH (OPTIMIZATION);

ANALYTICAL RESULTS; FITNESS LANDSCAPE; GEOMETRIC RANDOM GRAPH; GREEDY HEURISTICS; MEMETIC ALGORITHMS; OPTIMUM SOLUTION; PARTITIONING PROBLEM; PROBLEM INSTANCES;

GEOMETRY;

EID: 84878562525     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056918     Document Type: Conference Paper

References (22)

1. R. Battiti and A. Bertossi. Differential Greedy for the 0-1 Equicut Problem. In D.Z. Du and P.M. Pardalos, editors, Proceedings of the DIMACS Workshop on Network Design: Connectivity and Facilities Location. Amer. Math. Soc, 1997.
2. R. Battiti and A. Bertossi. Greedy, Prohibition, and Reactive Heuristics for Graph-Partitioning. IEEE Transactions on Computers, 1997, to appear.
3. K.D. Boese. Cost versus Distance in the Traveling Salesman Problem. Technical Report TR-950018, UCLA CS Department, 1995.
4. T. N. Bui and B. R. Moon. Genetic Algorithm and Graph Partitioning. IEEE Transactions on Computers, 45(7): 841-855, 1996.
5. R. Dawkins. The Selfish Gene. Oxford University Press, Oxford, 1976.
6. L. J. Eshelman and J. D. Schaffer. Preventing Premature Convergence in Genetic Algorithms by Preventing Incest. In Proceedings of the 4th Int. Conference on Genetic Algorithms, pages 115-122. Morgan Kaufmann, 1991.
7. L.J. Eshelman. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination. In. In G. J. E. Rawlings, editor, Foundations of Genetic Algorithms, pages 265-283. Kaufmann, 1991.
8. C. M. Fiduccia and R. M. Mattheyses. A Liner-Time Heuristic for Improving Network Partitions. In Proceedings of the 19th ACM/IEEE Design Automation Conference DAC 82, pages 175-181, 1982.
9. B. Freisleben and P. Merz. A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 616-621. IEEE Press, 1996.
10. B. Freisleben and P. Merz. New Genetic Local Search Operators for the Traveling Salesman Problem. In H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, editors, Proceedings of the 4th Conference on Parallel Problem Solving from Nature - PPSN IV, pages 890-900. Springer, 1996.
11. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York, 1979.
12. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon. Optimization by Simulated Annealing; Part I, Graph Partitioning. Operations Research, 37: 865-892, 1989.
13. T. Jones and S. Forrest. Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms. In L. J. Eshelman, editor, Proceedings of the 6th Int. Conference on Genetic Algorithms, pages 184-192, Kaufman, 1995.
14. S. A. Kauffman. The Origins of Order: Self-Organization and Selection in Evolution. Oxford University Press, 1993.
15. S. A. Kauffman and S. Levin. Towards a General Theory of Adaptive Walks on Rugged Landscapes. Journal of Theoretical Biology, 128: 11-45, 1987.
16. B. Kernighan and S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell Systems Journal, 49: 291-307, 1972.
17. P. Merz and B. Freisleben. On the Effectiveness of Evolutionary Search in High-Dimensional NK-Landscapes. In Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pages 741-745, IEEE Press, 1998.
18. P. Merz and B. Freisleben. A Genetic Local Search Approach to the Quadratic Assignment Problem. In T. Bäck, editor, Proceedings of the 7th International Conference on Genetic Algorithms, pages 465-472, Morgan Kaufmann, 1997.
19. P. Merz and B. Freisleben. Genetic Local Search for the TSP: New Results. In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pages 159-164, IEEE Press, 1997.
20. P. Moscato. On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. Technical Report No. 790, Caltech Concurrent Computation Program, California Institue of Technology, USA, 1989.
21. P. Moscato and M. G. Norman. A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems. In M. Valero, E. Onate, M. Jane, J. L. Larriba, and B. Suarez, editors, Parallel Computing and Transputer Applications, pages 177-186, IOS Press, 1992.
22. A. G. Steenbeek, E. Marchiori, and A. E. Eiben. Finding Balanced Graph Bipartitions Using a Hybrid Genetic Algorithm. In Proceedings of the IEEE International Conference on Evolutionary Computation ICEC'98, pages 90-95, IEEE press, 1998.