Improving the performance of the Kernighan-Lin and simulated annealing graph bisection algorithms
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
Computer architecture: a quantitative approach
Computer architecture: a quantitative approach
Stochastic evolution: a fast effective heuristic for some generic layout problems
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
SIAM Journal on Computing
Finding good approximate vertex and edge partitions is NP-hard
Information Processing Letters
Vertex and edge partitions of graphs
Vertex and edge partitions of graphs
What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation
Machine Learning - Special issue on genetic algorithms
TimberWolf3.2: a new standard cell placement and global routing package
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Biases in the Crossover Landscape
Proceedings of the 3rd International Conference on Genetic Algorithms
Uniform Crossover in Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Hyperplane Synthesis for Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
An Analysis of the Interacting Roles of Population Size and Crossover in Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Analyzing Hyperplane Synthesis in Genetic Algorithms Using Clustered Schemata
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
A linear-time heuristic for improving network partitions
DAC '82 Proceedings of the 19th Design Automation Conference
Nonlinearities in genetic adaptive search.
Nonlinearities in genetic adaptive search.
On partitioning a graph: a theoretical and empirical study.
On partitioning a graph: a theoretical and empirical study.
Efficient and effective placement for very large circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Greedy, Prohibition, and Reactive Heuristics for Graph Partitioning
IEEE Transactions on Computers
Genetic VLSI circuit partitioning with two-dimensional geographic crossover and zigzag mapping
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
Programming and Computing Software
Load balancing for unstructured mesh applications
Progress in computer research
Functional Partitioning for Low Power Distributed Systems of Systems-on-a-chip
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
An improved circuit-partitioning algorithm based on min-cut equivalence relation
Integration, the VLSI Journal
Lock-Gain Based Graph Partitioning
Journal of Heuristics
Investigation of the Fitness Landscapes in Graph Bipartitioning: An Empirical Study
Journal of Heuristics
An Effective Multilevel Algorithm for Bisecting Graphs and Hypergraphs
IEEE Transactions on Computers
Genetic-algorithm-based real-time task scheduling with multiple goals
Journal of Systems and Software - Special issue: Computer systems
A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning
Journal of Global Optimization
Hybrid Genetic Algorithms for Feature Selection
IEEE Transactions on Pattern Analysis and Machine Intelligence
The Design and Implementation of a Framework for Automatic Modularization of Software Systems
The Journal of Supercomputing
New topologies for genetic search space
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Subproblem optimization by gene correlation with singular value decomposition
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Genetic fuzzy discretization with adaptive intervals for classification problems
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A language-independent software renovation framework
Journal of Systems and Software - Special issue: Software reverse engineering
Fitness Landscapes, Memetic Algorithms, and Greedy Operators for Graph Bipartitioning
Evolutionary Computation
IEA/AIE'2003 Proceedings of the 16th international conference on Developments in applied artificial intelligence
Finding optimal solutions to the graph partitioning problem with heuristic search
Annals of Mathematics and Artificial Intelligence
An ant-based algorithm for finding degree-constrained minimum spanning tree
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
Spectral techniques for graph bisection in genetic algorithms
Proceedings of the 8th annual conference on Genetic and evolutionary computation
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
Proceedings of the 9th annual conference companion on Genetic and evolutionary computation
Journal of Management Information Systems
A PROBE-Based Heuristic for Graph Partitioning
IEEE Transactions on Computers
Geometric crossovers for multiway graph partitioning
Evolutionary Computation
Classifier ensemble selection using hybrid genetic algorithms
Pattern Recognition Letters
A genetic algorithm for joint replenishment based on the exact inventory cost
Computers and Operations Research
Graph partitioning through a multi-objective evolutionary algorithm: a preliminary study
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Linear transformation in Pseudo-Boolean functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Scan chain organization for embedded diagnosis
Proceedings of the conference on Design, automation and test in Europe
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
A Flexible Stochastic Automaton-Based Algorithm for Network Self-Partitioning
International Journal of Distributed Sensor Networks
Expert Systems with Applications: An International Journal
Feature Selection in Genetic Fuzzy Discretization for the Pattern Classification Problems
IEICE - Transactions on Information and Systems
Single- and multi-objective evolutionary algorithms for graph bisectioning
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Metaheuristics for graph bisection
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Lower and upper bounds for linkage discovery
IEEE Transactions on Evolutionary Computation
Trie Partitioning in distributed PC based routers
COMSNETS'09 Proceedings of the First international conference on COMmunication Systems And NETworks
An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
Discrete Applied Mathematics - Special issue: 2nd cologne/twente workshop on graphs and combinatorial optimization (CTW 2003)
A survey on chromosomal structures and operators for exploiting topological linkages of genes
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Finding the optimal gene order in displaying microarray data
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
Normalization in genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
New usage of SOM for genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Problem-independent schema synthesis for genetic algorithms
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Investigation of the fitness landscapes and multi-parent crossover for graph bipartitioning
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
New usage of Sammon's mapping for genetic visualization
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Automatic reproduction of a genius algorithm: Strassen's algorithm revisited by genetic search
IEEE Transactions on Evolutionary Computation
Multiobjective evolutionary algorithms for dynamic social network clustering
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Partitioning composite web services for decentralized execution using a genetic algorithm
Future Generation Computer Systems
An optimal relationship-based partitioning of large datasets
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
Heat diffusion based dynamic load balancing for distributed virtual environments
Proceedings of the 17th ACM Symposium on Virtual Reality Software and Technology
An effective multilevel tabu search approach for balanced graph partitioning
Computers and Operations Research
Graph partitioning by multi-objective real-valued metaheuristics: A comparative study
Applied Soft Computing
Genetic approaches for graph partitioning: a survey
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Journal of Systems and Software
Analysis of Heuristic Graph Partitioning Methods for the Assignment of Packet Control Units in GERAN
Wireless Personal Communications: An International Journal
Computer Networks: The International Journal of Computer and Telecommunications Networking
SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
Data & Knowledge Engineering
Genetic algorithm based restructuring of web applications using web page relationships and metrics
ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Regrouping service sites: a genetic approach using a voronoi diagram
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A comparison of distributed test generation techniques
VECoS'08 Proceedings of the Second international conference on Verification and Evaluation of Computer and Communication Systems
Performance of a genetic algorithm for the graph partitioning problem
Mathematical and Computer Modelling: An International Journal
Increasing the scalability of the fitting of generalised block models for social networks
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Survey: A survey on search-based software design
Computer Science Review
A spanning tree-based encoding of the MAX CUT problem for evolutionary search
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
VICUS: a noise addition technique for categorical data
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
| Hi-index | 14.99 |
Hybrid genetic algorithms (GAs) for the graph partitioning problem are described. The algorithms include a fast local improvement heuristic. One of the novel features of these algorithms is the schema preprocessing phase that improves GAs' space searching capability, which in turn improves the performance of GAs. Experimental tests on graph problems with published solutions showed that the new genetic algorithms performed comparable to or better than the multistart Kernighan-Lin algorithm and the simulated annealing algorithm. Analyses of some special classes of graphs are also provided showing the usefulness of schema preprocessing and supporting the experimental results.