Enhanced forma analysis of permutation problems

Authors:
Tao Gong;Andrew L. Tuson
Affiliations:
City University of London, London, United Kingdom;City University of London, London, United Kingdom
Venue:
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Year:
2007

Citing 2
Cited 2

A study of permutation crossover operators on the traveling salesman problem

Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Introduction to Algorithms

Introduction to Algorithms

Forma analysis of particle swarm optimisation for permutation problems

Journal of Artificial Evolution and Applications - Particle Swarms: The Second Decade
A design framework for metaheuristics

Artificial Intelligence Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

Forma analysis provides an approach to formally derive domain specific operators based on domain-independent operator templates by manipulating a set of equivalence relations (i.e., the basis), which is used to describe the search space. In the case of permutation problems, where the basis is highly constrained, the declarative nature of forma analysis encounters some difficulties which give rise to some additional issues, such as the interpretation of declarative constraints and the complexity of the application of operator. This paper aims to address these issues by introducing Enhanced Forma Analysis that explores a broader view of forma analysis by using ideas from constraint satisfaction.