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 条
  • [11] Monge JF(2013)A computational study and survey of methods for the single-row facility layout problem Comput Optim Appl 140 1703-1727
  • [12] Ceberio J(2013)Semidefinite relaxations of ordering problems Math Program 9 577-591
  • [13] Mendiburu A(2015)A semidefinite optimization approach to the Target Visitation Problem Optim Lett 88 1217-1230
  • [14] Lozano JA(1959)Mathematics without numbers Daedelus 26 395-409
  • [15] Ceberio J(1999)Intensification and diversification with elite Tabu search solutions for the linear ordering problem Comput Oper Res 14 1297-1317
  • [16] Santucci V(2022)A diversity-awarememetic algorithm for the linear ordering problem Memetic Comput 51 93-107
  • [17] Charon I(2012)A benchmark library and a comparison of heuristic methods for the linear ordering problem Comput Optim Appl 271 367-402
  • [18] Hudry I(2019)Analysis of a generalized Linear Ordering Problem via integer programming Discret Appl Math 115 1793-1799
  • [19] Charon I(2020)Block-insertion-based algorithms for the linear ordering problem Comput Oper Res 3 undefined-undefined
  • [20] Hudry I(2005)The linear ordering problem: instances, search space analysis and algorithms J Math Model Algor 66 undefined-undefined
123456