Abstract
Permutation optimisation problems are of interest to the local search community, who have long been interested in effective representations of such problems. This paper examines the effectiveness of one such ‘general-purpose’ approach, the ordinal encoding. Using forma analysis to structure the discussion, it shall be argued that the ordinal approach, by abstracting away problem structure, can perform poorly even in cases where the structures they manipulate map relatively well onto the problem domain. The discussion will be evaluated by an empirical study of the flowshop sequencing problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Michael R. Garey and David S. Johnson. Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, 1979.
J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. Van Gucht. Genetic Algorithm for the TSP. In J. J. Grefenstette, editor, Proceedings of the International Conference on Genetic Algorithms and their Applications, pages 160–168. San Mateo: Morgan Kaufmann, 1985.
John H. Holland. Adaptation in Natural and Artificial Systems. Ann Arbor: The University of Michigan Press, 1975.
M. Jelasity and J. Dombi. Implicit Formae in Genetic Algorithms. In H.-M. Voigt et al, editor, Parallel Problem-solving from Nature-PPSN IV, LNCS, pages 154–163. Springer-Verlag, 1996.
A. H. G. Rinnooy Kan. Machine Sequencing Problems: Classification, Complexity and Computations. Martinus Nijhoff, The Hague, 1976.
D. Mattfeld, C. Bierwirth, and H. Kopfer. On Permutation Representations for Scheduling Problems. In H.-M. Voigt et al, editor, Parallel Problem-solving from Nature-PPSN IV, LNCS, pages 310–318. Springer-Verlag, 1996.
I. H. Osman and C. N. Potts. Simulated annealing for permutation flow-shop scheduling. OMEGA, 17:551–557, 1989.
N. J. Radcliffe. Equivalence Class Analysis of Genetic Algorithms. Complex Systems, 5(2):183–205, 1991.
N.J Radcliffe. The Algebra of Genetic Algorithms. Annals of Maths and Artificial Intelligence, 10:339–384, 1994.
N.J Radcliffe and P. D. Surry. Formal memetic algorithms. In T. C. Fogarty, editor, Proceedings of the AISB workshop on Evolutionary Computation. Springer-Verlag, 1994.
C. R. Reeves. A genetic algorithm for flowshop sequencing. Computers & Ops. Res., 22:5–13, 1995.
P. D. Surry. A Prescriptive Formalism for Constructing Domain-Specific Evolutionary Algorithms. PhD thesis, University of Edinburgh, UK, 1998.
E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operations Research, 64:278–285, 1993.
A. L. Tuson. No Optimisation Without Representation: A Knowledge-Based Systems View of Evolutionary/Neighbourhood Search Optimisation. PhD thesis, University of Edinburgh, 2000.
D. Whitley. The GENITOR Algorithm and Selective Pressure. In Stephanie Forrest, editor, Proceedings of the Third International Conference on Genetic Algorithms, pages 116–121. San Mateo: Morgan Kaufmann, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag London Limited
About this paper
Cite this paper
Tuson, A. (2005). Are Ordinal Representations Effective?. In: Bramer, M., Coenen, F., Allen, T. (eds) Research and Development in Intelligent Systems XXI. SGAI 2004. Springer, London. https://doi.org/10.1007/1-84628-102-4_15
Download citation
DOI: https://doi.org/10.1007/1-84628-102-4_15
Publisher Name: Springer, London
Print ISBN: 978-1-85233-907-4
Online ISBN: 978-1-84628-102-0
eBook Packages: Computer ScienceComputer Science (R0)