Abstract
The problem that we deal with consists in aggregating a set of individual preferencesinto a collective linear order summarizing the initial set as accurately as possible. As thisproblem is NP-hard, we apply heuristics to find good approximate solutions. More precisely,we design a Lamarckian genetic algorithm by hybridizing some meta-heuristics (based onthe simulated annealing method or the noising method) with a genetic algorithm. For theproblems that we studied, the experiments show that such a hybridization brings improvementsto these already good methods.
Similar content being viewed by others
References
J.D. Bagley, The behavior of adaptive systems which employ genetic and correlation algorithms, Ph.D. Thesis, University of Michigan, USA, 1967.
J.-P. Barthélemy and B. Monjardet, The median procedure in cluster analysis and social choice theory, Mathematical Social Sciences 1(1981)235 – 267.
G. Bogdanova, Optimal codes over an alphabet of 4 elements, in: Proceedings of the 5th International Workshop on Algebraic and Combinatorial Coding Theory, Unicorn, Shumen, Sozopol, Bulgaria, 1996, pp. 46 – 53.
J.-S. de Cani, Maximum likelihood paired comparison ranking by linear programming, Biometrika 3(1969)537 – 545.
M.J.A.N. Caritat, marquis de Condorcet, Essai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix, Paris, 1785.
I. Charon and O. Hudry, The noising method: A new method for combinatorial optimization, Operations Research Letters 14(1993)133 – 137.
I. Charon and O. Hudry, Mixing different components of meta-heuristics, in: Meta-heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly, Kluwer Academic, Boston, 1996, pp. 589 –603.
L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.
B. Debord, Axiomatisation de procédures d'agrégation de préférences, Ph.D. Thesis, University of Grenoble, Grenoble, 1987.
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison Wesley, 1989.
A. Guénoche, B. Vandeputte-Riboud and J.-B. Denis, Selecting varieties using a series of trials and a combinatorial ordering method, Agronomie 14(1994)363 – 375.
J.H. Holland, Outline for a logical theory of adaptive systems, Journal of the Association for Computing Machinery 3(1962)297 – 314.
J.H. Holland, Adaptation in Natural and Artificial Systems, The University of Michigan Press, Ann Arbor, 1st ed. 1975, 2nd ed. 1992.
L. Hubert, Seriation using asymmetric proximity measures, Br. J. Math. Statist. Psychol. 29(1976) 32 – 52.
O. Hudry, Recherche d'ordres médians: complexité, algorithmique et problèmes combinatoires, Ph.D. Thesis, ENST, Paris, 1989.
M. Jünger, Polyhedral Combinatorics and the Acyclic Subdigraph Problem, Heldermann, Berlin, 1985.
J.G. Kemeny, Mathematics without numbers, Daedalus 88(1959)577 – 591.
M.G. Kendall, Rank Correlation Methods, Hafner, New York, 1938.
J.-B. Monet, chevalier de Lamarck, Philosophie Zoologique, Paris, 1809.
B. Monjardet, Sur diverses formes de la “règle de Condorcet” d'agrégation des préférences, Math. Inf. Sci. hum 111(1990)61 – 71.
H. Mülhenbein, Evolutionary algorithms: Theory and application, in: Local Search in Combinatorial Optimization, eds. E.H.L. Aarts and J.K. Lenstra, Wiley, Chichester, 1995.
I.H. Osman and J.P. Kelly, Meta-heuristics: An overview, in: Meta-heuristics: Theory and Applications, eds. I.H. Osman and J.P. Kelly, Kluwer Academic, Boston, 1996.
M. Pirlot, General local search heuristics in combinatorial optimization: A tutorial, JORBEL 32 (1992)7 – 68.
R.S. Rosenberg, Simulation of genetic populations with biochemical properties, Mathematical Biosciences 7(1970)223 – 257; Mathematical Biosciences 8(1970)1 – 37.
P. Slater, Inconsistencies in a schedule of paired comparisons, Biometrika 48(1961)303 – 312.
Proceedings of the 1st International Conference on Genetic Algorithms and their Applications, ed. J.J. Grefenstette, Carnegie-Mellon University, Pittsburgh, Lawrence Erlbaum, USA, 1985.
Genetic Algorithms and their Applications: Proceedings of the 2nd International Conference, ed. J.J. Grefenstette, Massachussetts Institute of Technology, Cambridge, Lawrence Erlbaum, USA, 1987.
Proceedings of the 3rd International Conference on Genetic Algorithms, ed. J.D. Schaffer, George Mason University, Morgan Kaufmann, USA, 1989.
Proceedings of the 4th International Conference on Genetic Algorithms, eds. R.K. Belew and L.B. Booker, University of California, San Diego, Morgan Kaufmann, USA, 1991.
Proceedings of the 5th International Conference on Genetic Algorithms, ed. S. Forrest, Morgan Kaufmann, Los Altos, USA, 1993.
Proceedings of the 6th International Conference on Genetic Algorithms, Morgan Kaufmann, USA, 1995.
Proceedings of the 7th International Conference on Genetic Algorithms, Michigan State University, East Lansing, USA, July 1997, to appear.
Rights and permissions
About this article
Cite this article
Charon, I., Hudry, O. Lamarckian genetic algorithmsapplied to the aggregation of preferences. Annals of Operations Research 80, 281–297 (1998). https://doi.org/10.1023/A:1018976217274
Issue Date:
DOI: https://doi.org/10.1023/A:1018976217274