Memetic algorithms and the fitness landscape of the graph bi-partitioning problem
- 1 January 1998
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 765-774
- https://doi.org/10.1007/bfb0056918
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Finding balanced graph bi-partitions using a hybrid genetic algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the effectiveness of evolutionary search in high-dimensional NK-landscapesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Genetic local search for the TSP: new resultsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Genetic algorithm and graph partitioningIEEE Transactions on Computers, 1996
- New genetic local search operators for the traveling salesman problemLecture Notes in Computer Science, 1996
- The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic RecombinationFoundations of Genetic Algorithms, 1991
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph PartitioningOperations Research, 1989
- Towards a general theory of adaptive walks on rugged landscapesJournal of Theoretical Biology, 1987
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970