Journey to the center of the linear ordering problem

A number of local search based algorithms have been designed to escape from the local optima, such as, iterated local search or variable neighborhood search. The neighborhood chosen for the local search as well as the escape technique play a key role in the performance of these algorithms. Of course, a specific strategy has a different effect on distinct problems or instances. In this paper, we focus on a permutation-based combinatorial optimization problem: the linear ordering problem. We provide a theoretical landscape analysis for the adjacent swap, the swap and the insert neighborhoods. By making connections to other different problems found in the Combinatorics field, we prove that there are some moves in the local optima that will necessarily return a worse or equal solution. The number of these non-better solutions that could be avoided by the escape techniques is considerably large with respect to the number of neighbors. This is a valuable information that can be included in any of those algorithms designed to escape from the local optima, increasing their efficiency.

[1]  T. Stützle,et al.  Iterated Local Search: Framework and Applications , 2018, Handbook of Metaheuristics.

[2]  Sounaka Mishra,et al.  On approximability of linear ordering and related NP-optimization problems on graphs , 2004, Discret. Appl. Math..

[3]  Alexander Mendiburu,et al.  The linear ordering problem revisited , 2015, Eur. J. Oper. Res..

[4]  Steve Linton,et al.  Permutation Patterns , 2010 .

[5]  Sébastien Vérel,et al.  NILS: A Neutrality-Based Iterated Local Search and Its Application to Flowshop Scheduling , 2011, EvoCOP.

[6]  Enrico Tronci 1997 , 1997, Les 25 ans de l’OMC: Une rétrospective en photos.

[7]  Thomas Stützle,et al.  Search Space Analysis of the Linear Ordering Problem , 2003, EvoWorkshops.

[8]  Signed: Date: , 2003 .

[9]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[10]  Alexander Mendiburu,et al.  Characterising the rankings produced by combinatorial optimisation problems and finding their intersections , 2019, GECCO.

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

[12]  Enrique Alba,et al.  Local Optima Networks, Landscape Autocorrelation and Heuristic Search Performance , 2012, PPSN.

[13]  Thomas Stützle,et al.  Iterated local search for the quadratic assignment problem , 2006, Eur. J. Oper. Res..

[14]  Tony C. Scott,et al.  On the origin of the Fibonacci Sequence , 2014 .

[15]  Alexander Mendiburu,et al.  Hill-Climbing Algorithm: Let's Go for a Walk Before Finding the Optimum , 2018, 2018 IEEE Congress on Evolutionary Computation (CEC).

[16]  Robert Donaghey,et al.  Motzkin Numbers , 1977, J. Comb. Theory, Ser. A.

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

[18]  M. Gribaudo,et al.  2002 , 2001, Cell and Tissue Research.

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

[20]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[21]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[22]  Valentino Santucci,et al.  Using pairwise precedences for solving the linear ordering problem , 2020, Appl. Soft Comput..

[23]  Kathleen Steinhöfel,et al.  Combinatorial landscape analysis for k-SAT instances , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[24]  Sébastien Vérel,et al.  ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms , 2013, J. Heuristics.

[25]  Jose A. Lozano,et al.  Anatomy of the Attraction Basins: Breaking with the Intuition , 2019, Evolutionary Computation.