Lamarckian genetic algorithms applied to the aggregation of preferences

DOI10.1023/A:1018976217274zbMath0907.90009OpenAlexW188269987MaRDI QIDQ1392449

Irène Charon, Olivier Hudry

Publication date: 28 July 1998

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018976217274

zbMATH Keywords

aggregationsimulated annealingNP-hardmedian ordernoising methodSlater problemcollective linear orderhybridization of heuristicsKemeny problemLamarckian genetic algorithmset of individual preferences

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Individual preferences (91B08)

Related Items (10)

The linear ordering problem revisited ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ Ranking data with ordinal labels: optimality and pairwise aggregation ⋮ A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments ⋮ Evidential reasoning in large partially ordered sets. Application to multi-label classification, ensemble clustering and preference aggregation ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ The noising methods: A generalization of some metaheuristics ⋮ Block-insertion-based algorithms for the linear ordering problem ⋮ Self-tuning of the noising methods ⋮ Application of the “descent with mutations” metaheuristic to a clique partitioning problem

This page was built for publication: Lamarckian genetic algorithms applied to the aggregation of preferences