The linear ordering problem: Instances, search space analysis and algorithms

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 4, 2004, Pages 367-402

  Schiavinotto, Tommaso ^a   Stützle, Thomas ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

Benchmark instances; Iterated local search; Linear ordering problem; Memetic algorithms; Search space analysis

Indexed keywords

EID: 20944447228     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000049426.06305.d8     Document Type: Article

References (33)

1. Angel, E. and Zissimopoulos, V.: Autocorrelation coefficient for the graph bipartitioning problem, Theoret. Comput. Sci. 191(1-2) (1998), 229-243.
2. Angel, E. and Zissimopoulos, V.: On the classification of NP-complete problems in terms of their correlation coefficient, Discrete Appl. Math. 99(1-3) (2000), 261-277.
3. Becker, O.: Das Helmstädtersche Reihenfolgeproblem - die Effizienz verschiedener Näherungsverfahren, in Computer Uses in the Social Science, Wien, January 1967.
4. Birattari, M., Stützle, T., Paquete, L. and Varrentrapp, K.: A racing algorithm for configuring metaheuristics, in W. B. Langdon et al. (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2002), Morgan Kaufmann Publishers, San Francisco, CA, 2002, pp. 11-18.
5. Boese, K. D.: Models for iterative global optimization, PhD thesis, University of California, Computer Science Department, Los Angeles, CA, 1996.
6. Campos, V., Glover, F., Laguna, M. and Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem, J. Global Optim. 21(4) (2001), 397-414.
7. Campos, V., Laguna, M. and Martí, R.: Scatter search for the linear ordering problem, in D. Corne, M. Dorigo and F. Glover (eds), New Ideas in Optimization, McGraw-Hill, London, UK, 1999, pp. 331-339.
8. Ghanas, S. and Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem, Comput. Optim. Appl. 6 (1996), 191-205.
9. Congram, R. K.: Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation, PhD thesis, University of Southampton, Faculty of Mathematical Studies, UK, 2000.
10. Grötschel, M., Jünger, M. and Reinelt, G.: A cutting plane algorithm for the linear ordering problem, Oper. Res. 32(6) (1984), 1195-1220.
11. Grötschel, M., Jünger, M. and Reinelt, G.: Optimal triangulation of large real world input-output matrices, Statistische Hefte 25 (1984), 261-295.
12. Hoos, H. H. and Stützle, T.: Evaluating Las Vegas algorithms -pitfalls and remedies, in G. F. Cooper and S. Moral (eds), Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence, Morgan Kaufmann Publishers, San Francisco, CA, 1998, pp. 238-245.
13. Huang, G. and Lim, A.: Designing a hybrid genetic algorithm for the linear ordering problem, in E. Cantú-Paz et al. (eds), Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2003), Lecture Notes in Comput. Sci. 2723, Springer-Verlag, Berlin, 2003, pp. 1053-1064.
14. Jones, T. and Forrest, S.: Fitness distance correlation as a measure of problem difficulty for genetic algorithms, in L. J. Eshelman (ed.), Proceedings of the Sixth International Conference on Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, CA, 1995, pp. 184-192.
15. Kaas, R.: A branch and bound algorithm for the acyclic subgraph problem, European J. Oper. Res. 8(1981), 355-362.
16. Kirkpatrick, S., Gelatt, C. D., Jr. and Vecchi, M. P.: Optimization by simulated annealing, Science 220 (1983), 671-680.
17. Knuth, D. E.: The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, New York, 1993.
18. Laguna, M., Martí, R. and Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem, Comput. Oper. Res. 26(12) (1999), 1217-1230.
19. Lourenço, H. R., Martin, O. and Stützle, T.: Iterated local search, in F. Glover and G. Kochenberger (eds), Handbook of Metaheuristics, International Series in Operations Research & Management Science 57, Kluwer Academic Publishers, Norwell, MA, 2002, pp. 321-353.
20. Merz, P.: Memetic algorithms for combinatorial optimization problems: Fitness landscapes and effective search strategies, PhD thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany, 2000.
21. Merz, P. and Freisleben, B.: Fitness landscapes and memetic algorithm design, in D. Corne, M. Dorigo and F. Glover (eds), New Ideas in Optimization, McGraw-Hill, London, UK, 1999, pp. 245-260.
22. Merz, P. and Freisleben, B.: Fitness landscape analysis and memetic algorithms for the quadratic assignment problem, IEEE Trans. Evolut. Comput. 4(4) (2000), 337-352.
23. Mitchell, J. E. and Borchers, B.: Solving linear ordering problems with a combined interior point/simplex cutting plane algorithm, in H. L. Frenk, K. Roos, T. Terlaky and S. Zhang (eds), High Performance Optimization, Kluwer Academic Publishers, Dordrecht, The Netherlands, 2000, pp. 349-366.
24. Moscato, P. and Cotta, C.: A gentle introduction to memetic algorithms, in F. Glover and G. Kochenberger (eds), Handbook of Metaheuristics, International Series in Operations Research & Management Science 57, Kluwer Academic Publishers, Norwell, MA, 2002, pp. 105-144.
25. Schiavinotto, T. and Stützle, T.: Search space analysis of the linear ordering problem, in G. R. Raidl et al. (eds), Applications of Evolutionary Computing, Lecture Notes in Comput. Sci. 2611, Springer-Verlag, Berlin, 2003, pp. 322-333.
26. Stadler, P. F.: Towards a theory of landscapes, in R. Lopéz-Peña, R. Capovilla, R. García-Pelayo, H. Waelbroeck and F. Zertuche (eds), Complex Systems and Binary Networks, Lecture Notes in Phys. 461, Springer-Verlag, Berlin, 1995, pp. 77-163.
27. Stadler, P. F.: Landscapes and their correlation functions, J. Math. Chemistry 20(1) (1996), 1-45.
28. Stadler, P. F. and Schnabl, W.: The landscape of the travelling salesman problem, Phys. Lett. A 161 (1992), 337-344.
29. Standard Performance Evaluation Corporation: SPEC CPU95 and CPU2000 Benchmarks, http://www.spec.org/, November 2002.
30. Stützle, T. and Hoos, H. H.: ℳscript A signscript X sign-ℳscript l signscript N ant system, Future Generation Computer Systems 16(8) (2000), 889-914.
31. Stützle, T. and Hoos, H. H.: Analysing the run-time behaviour of iterated local search for the travelling salesman problem, in P. Hansen and C. C. Ribeiro (eds), Essays and Surveys on Metaheuristics, Kluwer Academic Publishers, Boston, MA, 2001, pp. 589-611.
32. Syswerda, G.: Schedule optimization using genetic algorithms, in L. Davis (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1990.
33. Weinberger, E. D.: Correlated and uncorrelated fitness landscapes and how to tell the difference, Biological Cybernetics 63(5) (1990), 325-336.