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 条
  • [31] A linear ordering problem with weighted rank
    Manuel V. C. Vieira
    Journal of Combinatorial Optimization, 2024, 47
  • [32] Lagrangian heuristics for the Linear Ordering Problem
    Belloni, A
    Lucena, A
    METAHEURISTICS: COMPUTER DECISION-MAKING, 2004, 86 : 37 - 63
  • [33] ON THE LINEAR ORDERING PROBLEM AND THE RANKABILITY OF DATA
    Cameron, Thomas R.
    Charmot, Sebastian
    Pulaj, Jonad
    FOUNDATIONS OF DATA SCIENCE, 2021, 3 (02): : 133 - 149
  • [34] The linear ordering problem with cumulative costs
    Bertacco, Livio
    Brunetta, Lorenzo
    Fischetti, Matteo
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 189 (03) : 1345 - 1357
  • [35] A linear ordering problem with weighted rank
    Vieira, Manuel V. C.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (02)
  • [36] Hybrid Heuristics for the Linear Ordering Problem
    Garcia, Erik
    Ceberio, Josu
    Lozano, Jose A.
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1431 - 1438
  • [37] Heuristic Methods for Linear Multiplicative Programming
    X.J. Liu
    T. Umegaki
    Y. Yamamoto
    Journal of Global Optimization, 1999, 15 : 433 - 447
  • [38] Evolutionary approaches to Linear Ordering Problem
    Snasel, Vaclav
    Kromer, Pavel
    Platos, Jan
    DEXA 2008: 19TH INTERNATIONAL CONFERENCE ON DATABASE AND EXPERT SYSTEMS APPLICATIONS, PROCEEDINGS, 2008, : 566 - 570
  • [39] Journey to the Center of the Linear Ordering Problem
    Hernando, Leticia
    Mendiburu, Alexander
    Lozano, Jose A.
    GECCO'20: PROCEEDINGS OF THE 2020 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2020, : 201 - 209
  • [40] GENETIC ALGORITHMS FOR THE LINEAR ORDERING PROBLEM
    Kroemer, Pavel
    Snasel, Vaclav
    Platos, Jan
    Husek, Dusan
    NEURAL NETWORK WORLD, 2009, 19 (01) : 65 - 80
12345