A benchmark library and a comparison of heuristic methods for the linear ordering problem

被引:32
|
作者
Marti, Rafael [1 ]
Reinelt, Gerhard [2 ]
Duarte, Abraham [3 ]
机构
[1] Univ Valencia, Dept Estadist & Invest Operat, Valencia, Spain
[2] Heidelberg Univ, Inst Comp Sci, Heidelberg, Germany
[3] Univ Rey Juan Carlos, Dept Ciencias Computac, Madrid, Spain
关键词
Metaheuristics; Empirical comparison; Library; SEARCH; ALGORITHM;
D O I
10.1007/s10589-010-9384-9
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The linear ordering problem consists of finding an acyclic tournament in a complete weighted digraph of maximum weight. It is one of the classical NP-hard combinatorial optimization problems. This paper surveys a collection of heuristics and metaheuristic algorithms for finding near-optimal solutions and reports about extensive computational experiments with them. We also present the new benchmark library LOLIB which includes all instances previously used for this problem as well as new ones.
引用
收藏
页码:1297 / 1317
页数:21
相关论文
共 50 条
  • [1] A benchmark library and a comparison of heuristic methods for the linear ordering problem
    Rafael Martí
    Gerhard Reinelt
    Abraham Duarte
    Computational Optimization and Applications, 2012, 51 : 1297 - 1317
  • [3] Primal Heuristic for the Linear Ordering Problem
    Agrawal, Ravi
    Iranmanesh, Ehsan
    Krishnamurti, Ramesh
    ICORES: PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON OPERATIONS RESEARCH AND ENTERPRISE SYSTEMS, 2019, : 151 - 156
  • [4] New heuristic algorithm solving the linear ordering problem
    Chanas, Stefan
    Kobylanski, Przemyslaw
    Computational Optimization and Applications, 1996, 6 (02): : 191 - 205
  • [5] A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem
    Blazsik, Zoltan
    Fajfrik, Zoltan Imre
    CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH, 2017, 25 (01) : 55 - 70
  • [6] A heuristic framework on a common generalization of the Vehicle Routing Problem and the Linear Ordering Problem
    Zoltán Blázsik
    Zoltán Imre Fajfrik
    Central European Journal of Operations Research, 2017, 25 : 55 - 70
  • [7] Comparison of neural and heuristic methods for a timetabling problem
    Mausser, HE
    Magazine, MJ
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1996, 93 (02) : 271 - 287
  • [8] A heuristic and a benchmark for the stowage planning problem
    Rune Larsen
    Dario Pacino
    Maritime Economics & Logistics, 2021, 23 : 94 - 122
  • [9] A heuristic and a benchmark for the stowage planning problem
    Larsen, Rune
    Pacino, Dario
    MARITIME ECONOMICS & LOGISTICS, 2021, 23 (01) : 94 - 122
  • [10] Bio-inspired and Heuristic Methods applied to a Benchmark of the Task Scheduling Problem
    de Carvalho, Tiago I.
    Morais, Bruno W. D.
    Oliveira, Gina M. B.
    2018 7TH BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2018, : 516 - 521