Lamarckian genetic algorithms applied to the aggregation of preferences
From MaRDI portal
Publication:1392449
DOI10.1023/A:1018976217274zbMath0907.90009OpenAlexW188269987MaRDI QIDQ1392449
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
aggregationsimulated annealingNP-hardmedian ordernoising methodSlater problemcollective linear orderhybridization of heuristicsKemeny problemLamarckian genetic algorithmset of individual preferences
Related Items
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