Evolutionary algorithms and matroid optimization problems

Authors:
Joachim Reichel;Martin Skutella
Affiliations:
University of Dortmund, Dortmund, Germany;University of Dortmund, Dortmund, Germany
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 12
Cited 16

Improved bounds for matroid partition and intersection algorithms

SIAM Journal on Computing
A matroid approach to finding edge connectivity and packing arborescences

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Efficient theoretic and practical algorithms for linear matroid intersection problems

Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolutionary Algorithms and the Maximum Matching Problem

STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
An Efficient Polynomial Time Approximation Scheme for the Constrained Minimum Spanning Tree Problem Using Matroid Intersection

SIAM Journal on Computing
Minimum spanning trees made easier via multi-objective optimization

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Deterministic network coding by matrix completion

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Maximum cardinality matchings on trees by randomized local search

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
Edge sets: an effective evolutionary coding of spanning trees

IEEE Transactions on Evolutionary Computation
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems

Operations Research Letters

Runtime analysis of binary PSO

Proceedings of the 10th annual conference on Genetic and evolutionary computation
Computing minimum cuts by randomized search heuristics

Proceedings of the 10th annual conference on Genetic and evolutionary computation
On the size of weights in randomized search heuristics

Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Exact Solutions to the Traveling Salesperson Problem by a Population-Based Evolutionary Algorithm

EvoCOP '09 Proceedings of the 9th European Conference on Evolutionary Computation in Combinatorial Optimization
Non-monotone submodular maximization under matroid and knapsack constraints

Proceedings of the forty-first annual ACM symposium on Theory of computing
Evolutionary algorithms and dynamic programming

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Runtime analysis of a binary particle swarm optimizer

Theoretical Computer Science
Theoretical results in genetic programming: the next ten years?

Genetic Programming and Evolvable Machines
Practical performance models of algorithms in evolutionary program induction and other domains

Artificial Intelligence
Drift analysis with tail bounds

PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties

Mathematics of Operations Research
Runtime analysis of the (1+1) evolutionary algorithm on strings over finite alphabets

Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Evolutionary algorithms and dynamic programming

Theoretical Computer Science
Black-box complexities of combinatorial problems

Theoretical Computer Science
Black-box complexity: from complexity theory to playing mastermind

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the performance of evolutionary algorithms on various matroid optimization problems thatencompass a vast number of efficiently solvable as well as NP-hard combinatorial optimizationproblems (including many well-known examples such as minimum spanning tree and maximum bipartitematching). We obtain very promising bounds on the expected running time and quality of the computedsolution. Our results establish a better theoretical understanding of why randomized searchheuristics yield empirically good results for many real-world optimization problems.