Towards practical `neural' computation for combinatorial optimization problems
AIP Conference Proceedings 151 on Neural Networks for Computing
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
An improved spectral graph partitioning algorithm for mapping parallel computations
SIAM Journal on Scientific Computing
A multilevel algorithm for partitioning graphs
Supercomputing '95 Proceedings of the 1995 ACM/IEEE conference on Supercomputing
Models for iterative global optimization
Models for iterative global optimization
Autocorrelation coefficient for the graph bipartitioning problem
Theoretical Computer Science
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
Genetic Algorithm and Graph Partitioning
IEEE Transactions on Computers
Signal-to-noise, Crosstalk, and Long Range Problem Difficulty in Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Memetic Algorithms and the Fitness Landscape of the Graph Bi-Partitioning Problem
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Partitioning a Graph with a Parallel Genetic Algorithm
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
The Weighted Graph Bi-Partitioning Problem: A Look at GA Performance
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
New Genetic Local Search Operators for the Traveling Salesman Problem
PPSN IV Proceedings of the 4th International Conference on 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
Spectral partitioning works: planar graphs and finite element meshes
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Graph Partitioning Algorithms with Applications to Scientific Computing
Graph Partitioning Algorithms with Applications to Scientific Computing
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming
Journal of Heuristics
Clustering Gene Expression Profiles with Memetic Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Lock-Gain Based Graph Partitioning
Journal of Heuristics
A Study on the use of "self-generation'' in memetic algorithms
Natural Computing: an international journal
Advanced fitness landscape analysis and the performance of memetic algorithms
Evolutionary Computation - Special issue on magnetic algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
An effective local search for the maximum clique problem
Information Processing Letters
Genetic local search for multicast routing
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Properties of symmetric fitness functions
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Multi-attractor gene reordering for graph bisection
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Geometric crossover for multiway graph partitioning
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Landscape analysis for multicast routing
Computer Communications
Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
Computers and Operations Research
Geometric crossovers for multiway graph partitioning
Evolutionary Computation
A bivariate probabilistic model-building genetic algorithm for graph bipartitioning
Proceedings of the 10th annual conference companion on Genetic and evolutionary computation
An Enzyme-Inspired Approach to Surmount Barriers in Graph Bisection
ICCSA '08 Proceeding sof the international conference on Computational Science and Its Applications, Part I
'Adaptive Link Adjustment' Applied to the Fixed Charge Transportation Problem
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Advances in Engineering Software
Analyzing the landscape of a graph based hyper-heuristic for timetabling problems
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Dispatching rules for production scheduling: a hyper-heuristic landscape analysis
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
An effective local search for the maximum clique problem
Information Processing Letters
The property analysis of evolutionary algorithms applied to spanning tree problems
Applied Intelligence
Normalization in genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Iterated k-opt local search for the maximum clique problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
An effective multilevel tabu search approach for balanced graph partitioning
Computers and Operations Research
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A theoretical model and convergence analysis of memetic evolutionary algorithms
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
A new memetic algorithm using particle swarm optimization and genetic algorithm
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Memetic algorithms for the MinLA problem
EA'05 Proceedings of the 7th international conference on Artificial Evolution
On a property analysis of representations for spanning tree problems
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Hierarchical clustering, languages and cancer
EuroGP'06 Proceedings of the 2006 international conference on Applications of Evolutionary Computing
A comparison of memetic recombination operators for the MinLA problem
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
Performance of a genetic algorithm for the graph partitioning problem
Mathematical and Computer Modelling: An International Journal
Breakout Local Search for maximum clique problems
Computers and Operations Research
Hi-index | 0.00 |
The fitness landscape of the graph bipartitioning problem is investigated by performing a search space analysis for several types of graphs. The analysis shows that the structure of the search space is significantly different for the types of instances studied. Moreover, with increasing epistasis, the amount of gene interactions in the representation of a solution in an evolutionary algorithm, the number of local minima for one type of instance decreases and, thus, the search becomes easier. We suggest that other characteristics besides high epistasis might have greater influence on the hardness of a problem. To understand these characteristics, the notion of a dependency graph describing gene interactions is introduced. In particular, the local structure and the regularity of the dependency graph seems to be important for the performance of an algorithm, and in fact, algorithms that exploit these properties perform significantly better than others which do not. It will be shown that a simple hybrid multi-start local search exploiting locality in the structure of the graphs is able to find optimum or near optimum solutions very quickly. However, if the problem size increases or the graphs become unstructured, a memetic algorithm (a genetic algorithm incorporating local search) is shown to be much more effective.