Geometric-based sampling for permutation optimization

Authors:
Olivier Regnier-Coudert;John McCall;Mayowa Ayodele
Affiliations:
Robert Gordon University, Aberdeen, United Kingdom;Robert Gordon University, Aberdeen, United Kingdom;Robert Gordon University, Aberdeen, United Kingdom
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 6
Cited 0

The complexity of finding minimum-length generator sequences

Theoretical Computer Science
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization

Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization
Self-adaptation of mutation operator and probability for permutation representations in genetic algorithms

Evolutionary Computation
Parallel Implementation of EDAs Based on Probabilistic Graphical Models

IEEE Transactions on Evolutionary Computation
Competing mutating agents for bayesian network structure learning

PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

There exist several operators to search through permutation spaces that can benefit search and score algorithms when combined. This paper presents COMpetitive Mutating Agents (COMMA), an algorithm which uses geometric mutation operators to create a geometrically defined distribution of solutions. Sampling from the distribution generates solutions in a similar fashion as with Estimation of Distribution Algorithms (EDAs). COMMA is applied on classical permutation optimization benchmarks, namely the Quadratic Assignement and the Permutation Flowshop Scheduling Problems and its performance is compared with those of reference EDAs. Although COMMA does not require a model building step, results suggest that it is competitive with state-of-the-art EDAs. In addition, COMMA's underlying geometric-based sampling could be transposed to representations other than permutations.