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
来源：
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS | 2012年 / 51卷 / 03期
关键词：
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 条
  • [21] A linear ordering problem of sets
    Juan Aparicio
    Mercedes Landete
    Juan F. Monge
    Annals of Operations Research, 2020, 288 : 45 - 64
  • [22] The linear ordering problem revisited
    Ceberio, Josu
    Mendiburu, Alexander
    Lozano, Jose A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 241 (03) : 686 - 696
  • [23] A linear ordering problem of sets
    Aparicio, Juan
    Landete, Mercedes
    Monger, Juan F.
    ANNALS OF OPERATIONS RESEARCH, 2020, 288 (01) : 45 - 64
  • [24] Exact methods in disassembly sequencing as a benchmark for heuristic algorithms
    Lambert, AJD
    ENVIRONMENTALLY CONSCIOUS MANUFACTURING IV, 2004, 5583 : 1 - 11
  • [25] A comparison of three heuristic methods for solving the parsing problem for tandem repeats
    Matroud, A.A.
    Tuffley, C.P.
    Bryant, D.
    Hendy, M.D.
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2012, 7409 LNBI : 37 - 48
  • [26] A Heuristic Algorithm for Relaxed Optimal Rule Ordering Problem
    Harada, Takashi
    Tanaka, Ken
    Mikawa, Kenji
    2018 2ND CYBER SECURITY IN NETWORKING CONFERENCE (CSNET), 2018,
  • [27] Simple value ordering heuristic in Frequency Assignment Problem
    Hu, Jun
    Caminada, Alexandre
    Mabed, Hakim
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 1596 - 1598
  • [28] A NEW HEURISTIC FOR THE LINEAR PLACEMENT PROBLEM
    SURYANARAYANAN, JK
    GOLDEN, BL
    WANG, Q
    COMPUTERS & OPERATIONS RESEARCH, 1991, 18 (03) : 255 - 262
  • [29] EXACT SOLUTION OF THE NO-WAIT FLOWSHOP SCHEDULING PROBLEM WITH A COMPARISON TO HEURISTIC METHODS
    PEKNY, JF
    MILLER, DL
    COMPUTERS & CHEMICAL ENGINEERING, 1991, 15 (11) : 741 - 748
  • [30] Heuristic methods for linear multiplicative programming
    Liu, XJ
    Umegaki, T
    Yamamoto, Y
    JOURNAL OF GLOBAL OPTIMIZATION, 1999, 15 (04) : 433 - 447
12345