The linear ordering problem revisited

The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this problem. This paper studies a procedure to extract static information from an instance of the problem, and proposes a method to incorporate the obtained knowledge in order to improve the performance of local search-based algorithms. The procedure introduced identifies the positions where the indexes cannot generate local optima for the insert neighbourhood, and thus global optima solutions. This information is then used to propose a restricted insert neighbourhood that discards the insert operations which move indexes to positions where optimal solutions are not generated. In order to measure the efficiency of the proposed restricted insert neighbourhood system, two state-of-the-art algorithms for the LOP that include local search procedures have been modified. Conducted experiments confirm that the restricted versions of the algorithms outperform the classical designs systematically when a maximum number of function evaluations is considered as the stopping criterion. The statistical test included in the experimentation reports significant differences in all the cases, which validates the efficiency of our proposal. Moreover, additional experiments comparing the execution times reveal that the restricted approaches are faster than their counterparts for most of the instances.

[1]  W. Leontief Input-output economics , 1967 .

[2]  Fred W. Glover,et al.  An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem , 2001, J. Glob. Optim..

[3]  Gerhard Reinelt,et al.  A Cutting Plane Algorithm for the Linear Ordering Problem , 1984, Oper. Res..

[4]  Thomas Stützle,et al.  The linear ordering problem: Instances, search space analysis and algorithms , 2004, J. Math. Model. Algorithms.

[5]  Camelia-Mihaela Pintea,et al.  Solving the linear ordering problem using ant models , 2009, GECCO '09.

[6]  T. Klastorin,et al.  Optimal Weighted Ancestry Relationships , 1974 .

[7]  Christian Komusiewicz,et al.  Average parameterization and partial kernelization for computing medians , 2010, J. Comput. Syst. Sci..

[8]  J. Mitchell,et al.  Solving Linear Ordering Problems with a Combined Interior Point/Simplex Cutting Plane Algorithm , 2000 .

[9]  Irène Charon,et al.  A survey on the linear ordering problem for weighted or unweighted tournaments , 2007, 4OR.

[10]  Irène Charon,et al.  Lamarckian genetic algorithmsapplied to the aggregation of preferences , 1998, Ann. Oper. Res..

[11]  Rafael Martí,et al.  Intensification and diversification with elite tabu search solutions for the linear ordering problem , 1999, Comput. Oper. Res..

[12]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[13]  Alexander Mendiburu,et al.  The Plackett-Luce ranking model on permutation-based optimization problems , 2013, 2013 IEEE Congress on Evolutionary Computation.

[14]  Hollis B. Chenery,et al.  International Comparisons of the Structure of Production , 1958 .

[15]  Henri Aujac,et al.  La hiérarchie des industries dans un tableau des échanges interindustriels , 1960 .

[16]  John E. Mitchell,et al.  Solving real-world linear ordering problems using a primal-dual interior point cutting plane method , 1996, Ann. Oper. Res..

[17]  Gerhard Reinelt,et al.  A benchmark library and a comparison of heuristic methods for the linear ordering problem , 2012, Comput. Optim. Appl..

[18]  Gerhard Reinelt,et al.  The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization , 2011 .

[19]  S. Shapiro,et al.  Mathematics without Numbers , 1993 .

[20]  Jason Eisner,et al.  Learning Linear Ordering Problems for Better Translation , 2009, EMNLP.

[21]  R. Kaas,et al.  A branch and bound algorithm for the acyclic subgraph problem , 1981 .

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Christian Blum,et al.  Metaheuristics in combinatorial optimization: Overview and conceptual comparison , 2003, CSUR.

[24]  Irène Charon,et al.  A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments , 2006, Discret. Appl. Math..

[25]  Christian Komusiewicz,et al.  Average parameterization and partial kernelization for computing medians , 2011, J. Comput. Syst. Sci..

[26]  Rafael Martí,et al.  Variable neighborhood search for the linear ordering problem , 2006, Comput. Oper. Res..

[27]  Petrica C. Pop,et al.  A Genetic Programming Approach for Solving the Linear Ordering Problem , 2012, HAIS.

[28]  Stefan Chanas,et al.  A new heuristic algorithm solving the linear ordering problem , 1996, Comput. Optim. Appl..