论文信息 - A Variable Neighborhood Search for Solving the Linear Ordering Problem

A Variable Neighborhood Search for Solving the Linear Ordering Problem

A Systematic change of Neighborhood within a possibly randomized local search algorithm yields asimple and eﬀective metaheuristic for combinatorial and global optimization. In this paper we presenta VariableNeighborhoodSearch implementation designed to ﬁnd high quality solutionsfor the NP-hardLinear Ordering Problem, which has a signiﬁcant number of application in practice, such triangulationof input-output matrices, archeological seriation, minimizing total weighted completion time in one-machine scheduling, and aggregation of individual preferences.We perform our implementation on theset of 49 instances in LOLIB, in order to compare our results with the Tabu Search of Laguna, et al.

Carlos Garc | Dionisio Pérez-Brito

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

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

[3] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.

[4] Silvano Martello,et al. Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization , 2012 .

[5] Fred Glover,et al. Tabu Search - Part II , 1989, INFORMS J. Comput..

[6] Gerhard Reinelt,et al. The linear ordering problem: algorithms and applications , 1985 .

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

[8] Nenad Mladenović,et al. An Introduction to Variable Neighborhood Search , 1997 .

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

[10] Fred W. Glover,et al. Tabu Search - Part I , 1989, INFORMS J. Comput..