Journal Article10.1016/J.COR.2016.09.013
Partial evaluation in Rank Aggregation Problems
13
TL;DR: A theoretical and experimental study of the application of partial evaluation in the Rank Aggregation Problem (RAP) shows that the complexity of evaluating the original objective function can be reduced from quadratic to linear by using partial evaluation after applying insertion and interchange.
read more
About: This article is published in Computers & Operations Research. The article was published on 01 Feb 2017. The article focuses on the topics: Partial evaluation & Operator (computer programming).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A differential evolution algorithm for finding the median ranking under the Kemeny axiomatic approach
TL;DR: An accurate (meta)heuristic solution to the rank aggregation problem is proposed and is particularly feasible when working with a very large number of objects to be ranked, because it is accurate and also faster than other proposals.
34
An improved genetic algorithm with variable neighborhood search to solve the assembly line balancing problem
TL;DR: In this article, an improved genetic algorithm (IGA) is proposed to deal with ALBP to optimize the number of stations and the workload smoothness., to evaluate the performance of the IGA, it is used to solve a set of well-known benchmark problems and a real-life problem faced by an automobile manufacturer.
A data-driven matching algorithm for ride pooling problem
01 Apr 2022
TL;DR: In this paper , a data-driven matching algorithm for the problem of ride pooling, which is a transportation mode enabling people to share a vehicle for a trip, is proposed, where the problem is considered as a variant of matching problem, since it aims to find a matching between drivers and riders.
8
Block-insertion-based algorithms for the linear ordering problem
TL;DR: Four new properties of block insertion for the LOP are presented, and it is shown that changing the node order in one sub-problem does not affect the objective values of the remaining sub-problems.
8
Algorithm 989: perm_mateda: A Matlab Toolbox of Estimation of Distribution Algorithms for Permutation-based Combinatorial Optimization Problems
TL;DR: This article presents a Matlab package, perm_mateda, of estimation of distribution algorithms on permutation problems, which has been implemented as an extension to the Mateda-2.0 toolbox of EDAs.
7
References
•Book
Social Choice and Individual Values
Kenneth J. Arrow
- 01 Jan 1951
TL;DR: Saari as mentioned in this paper introduced Arrow's Theorem and founded the field of social choice theory in economics and political science, and introduced a new foreword by Nobel laureate Eric Maskin, introducing Arrow's seminal book to a new generation of students and researchers.
8.2K
Social Choice and Individual Values.
Leo A. Goodman,Kenneth J. Arrow +1 more
TL;DR: In this article, the authors present a destination search and find the appropriate manuals for their products, providing you with many Social Choice And Individual Values. You can find the manual you are interested in in printed form or even consider it online.
8K
A new measure of rank correlation
TL;DR: Rank correlation as mentioned in this paper is a measure of similarity between two rankings of the same set of individuals, and it has been used in psychological work to compare two different rankings of individuals in order to indicate similarity of taste.
6.8K
•Book
Metaheuristics: From Design to Implementation
El-Ghazali Talbi
- 22 Jun 2009
TL;DR: This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling.
Rank aggregation methods for the Web
Cynthia Dwork,Ravi Kumar,Moni Naor,Dandapani Sivakumar +3 more
- 01 Apr 2001
TL;DR: A set of techniques for the rank aggregation problem is developed and compared to that of well-known methods, to design rank aggregation techniques that can be used to combat spam in Web searches.