A linear ordering problem with weighted rank

被引：0
作者：
Manuel V. C. Vieira
机构：
[1] NOVA School of Science and Technology,NOVAMath and Mathematics Department
来源：
Journal of Combinatorial Optimization | 2024年 / 47卷
关键词：
Linear ordering problem; Aggregation of individual preferences; Memetic algorithm;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
This paper introduces an integer linear program for a variant of the linear ordering problem. This considers, besides the pairwise preferences in the objective function as the linear ordering problem, positional preferences (weighted rank) in the objective. The objective function is mathematically supported, as the full integer linear program is motivated by the instant run-off voting method to aggregate individual preferences. The paper describes two meta-heuristics, iterated local search and Memetic algorithms to deal with large instances which are hard to solve to optimality. These results are compared with the objective value of the linear relaxation. The instances used are the ones available from the LOP library, and new real instances with preferences given by juries.
引用
收藏
相关论文
共 56 条
  • [1] Alcaraz J(2020)The linear ordering problem with clusters: a new partial ranking TOP 28 646-671
  • [2] García-Nové EM(2021)Fairness and the set of optimal rankings for the linear ordering problem Optim Eng 288 45-64
  • [3] Landete M(2020)A linear ordering problem of sets Ann Oper Res 241 686-696
  • [4] Mongel JF(2015)The linear ordering problem revisited Eur J Oper Res 87 5-60
  • [5] Anderson PE(2020)Using pairwise precedences for solving the linear ordering problem Appl Soft Comput 5 107-158
  • [6] Chartier TP(2007)A survey on the linear orderign problem for weighted or unweighted tournaments 4OR 175 270-277
  • [7] Langville AN(2010)An updated survey on the linear orderign problem for weighted or unweighted tournaments Ann Oper Res 216 1195-1220
  • [8] Pedings-Behling KE(2012)Metaheuristics for the linear ordering problem with cumulative costs Eur J Oper Res 32 43-60
  • [9] Aparicio J(1984)A cutting plane algorithm for the linear ordering problem Oper Res 33 1-20
  • [10] Landete M(1985)Facets of the linear ordering polytope Math Program 55 77-97
123456