Skip to main content
SpringerLink
Log in

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

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Achatz, H., Kleinschmidt, P., Lambsdorff, J.: Der Corruption Perceptions Index und das Linear Ordering Problem. ORNews 26, 10–12 (2006)

    Google Scholar 

  2. Aujac, H.: La hiérarchie des industries dans un tableau des echanges industriels. Rev. Econ. 2, 169–238 (1960)

    Google Scholar 

  3. Becker, O.: Das Helmstädtersche Reihenfolgeproblem – die Effizienz verschiedener Näherungsverfahren. In: Computer Uses in the Social Sciences, Bericht einer Working Conference des Inst. f. höh. Studien u. wiss. Forsch. Wien (1967)

    Google Scholar 

  4. Boenchendorf, K.: Reihenfolgenprobleme/Mean-Flow-Time Sequencing. Mathematical Systems in Economics, vol. 74. Verlagsgruppe Athenäum, Hain, Scriptor, Königstein (1982)

    Google Scholar 

  5. Campos, V., Glover, F., Laguna, M., Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. Glob. Optim. 21, 397–414 (2001)

    Article  MATH  Google Scholar 

  6. Chanas, S., Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl. 6, 191–205 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5, 5–60 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Chenery, H.B., Watanabe, T.: International comparisons of the structure of production. Econometrica 26, 487–521 (1958)

    Article  Google Scholar 

  9. Christof, T.: Low-dimensional 0/1-Polytopes and Branch-and-Cut in Combinatorial Optimization. Shaker, Aachen (1997)

    MATH  Google Scholar 

  10. Christof, T., Reinelt, G.: Combinatorial optimization and small polytopes. Top 4, 1–64 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  11. Condorcet, M.J.A.N.: Essai sur l’application de l’analyse à la probabilité des décisions rendues à la pluralité des voix (1785), Paris

    Google Scholar 

  12. Feo, T., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 2, 1–27 (1995)

    MathSciNet  Google Scholar 

  13. Garcia, C.G., Pérez-Brito, D., Campos, V., Martí, R.: Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33, 3549–3565 (2006)

    Article  MATH  Google Scholar 

  14. Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533–549 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  15. Glover, F., Klastorin, T., Klingman, D.: Optimal weighted ancestry relationships. Manag. Sci. 20, 1190–1193 (1974)

    Article  MATH  Google Scholar 

  16. Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)

    Book  MATH  Google Scholar 

  17. Goemans, M.X., Hall, L.A.: The strongest facets of the acyclic subgraph polytope are unknown. In: Proc. of the 5th Int. IPCO Conference. LNCS, vol. 1084, pp. 415–429. Springer, Berlin (1996)

    Google Scholar 

  18. Grötschel, M., Jünger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32, 1195–1220 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  19. Huang, G., Lim, A.: Designing a hybrid genetic algorithm for the linear ordering problem. In: Cantu-Paz, E., et al. (eds.) Proc. of Genetic and Evolutionary Computation—GECCO 2003. LNCS, vol. 2723, pp. 1053–1064. Springer, Berlin (2003)

    Chapter  Google Scholar 

  20. Hansen, P., Mladenovic, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145–184 (2003)

    Google Scholar 

  21. Jünger, M., Mutzel, P.: 2-layer straightline crossing minimization: performance of exact and heuristic algorithms. J. Graph Algorithms Appl. 1, 1–25 (1997)

    MathSciNet  Google Scholar 

  22. Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–308 (1979)

    Google Scholar 

  23. Knuth, D.E.: The Stanford GraphBase: A Platform for Combinatorial Computing. Addison-Wesley, Reading (1993)

    Google Scholar 

  24. Laguna, M., Martí, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217–1230 (1999)

    Article  MATH  Google Scholar 

  25. Laguna, M., Martí, R.: Scatter Search: Methodology and Implementations in C. Kluwer Academic, Dordrecht (2003)

    Book  Google Scholar 

  26. Leontief, W.: Quantitative input-output relations in the economic system of the United States. Rev. Econ. Stat. 18, 105–125 (1936)

    Article  Google Scholar 

  27. Martí, R., Reinelt, G.: The Linear Ordering Problem: Exact and Heuristics Methods in Combinatorial Optimization. Applied Mathematical Sciences, vol. 175. Springer, Berlin (2010)

    Google Scholar 

  28. Mitchell, J.E., Borchers, B.: Solving linear ordering problems. In: Frenk, H., Roos, K., Terlaky, T., Zhang, S. (eds.) High Performance Optimization. Applied Optimization, vol. 33, pp. 340–366. Kluwer Academic, Dordrecht (2000)

    Google Scholar 

  29. Reinelt, G.: The Linear Ordering Problem: Algorithms and Applications. Research and Exposition in Mathematics, vol. 8. Heldermann, Berlin (1985)

    MATH  Google Scholar 

  30. Ribeiro, C.C., Uchoa, E., Werneck, R.F.: A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS J. Comput. 14, 228–246 (2002)

    Article  MathSciNet  Google Scholar 

  31. Schiavinotto, T., Stützle, T.: The linear ordering problem: instances, search space analysis and algorithms. J. Math. Model. Algorithms 3, 367–402 (2004)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. de Estadística e Investigación Operativa, University of Valencia, Valencia, Spain

    Rafael Martí

  2. Institute for Computer Science, University of Heidelberg, Heidelberg, Germany

    Gerhard Reinelt

  3. Dept. Ciencias de la Computación, University Rey Juan Carlos, Madrid, Spain

    Abraham Duarte

Authors
  1. Rafael Martí
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerhard Reinelt
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Abraham Duarte
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rafael Martí.

Electronic Supplementary Material

Below is the link to the electronic supplementary material.

Appendix (PDF 198 KB)

Rights and permissions

Reprints and permissions

About this article

Cite this article

Martí, R., Reinelt, G. & Duarte, A. A benchmark library and a comparison of heuristic methods for the linear ordering problem. Comput Optim Appl 51, 1297–1317 (2012). https://doi.org/10.1007/s10589-010-9384-9

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-010-9384-9

Keywords

Search

Navigation