Best-so-far vs. where-you-are: implications for optimal finite-time annealing
Systems & Control Letters
A probability-based approach to VLSI circuit partitioning
DAC '96 Proceedings of the 33rd annual Design Automation Conference
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Fast and Robust Network Bisection Algorithm
IEEE Transactions on Computers
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Genetic algorithms with multi-parent recombination
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
Local Optimization and the Traveling Salesman Problem
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Empirical investigation of multiparent recombination operators in evolution strategies
Evolutionary Computation
New topologies for genetic search space
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |
An empirical study is performed on the local-optimum space of graph bipartitioning. We examine some statistical features of the fitness landscape. They include the cost-distance correlations and the properties around the central area of local optima. The study revealed some new notable results about the properties of the fitness landscape; e.g., the central area yielded fairly good quality in the local-optimum space. We performed an experiment on a spectrum of different exploitation strengths of the central areas. From the results, it seems attractive to exploit the central area, but excessive or insufficient exploitation is not desirable.