An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization

Volumn 21, Issue 4, 2001, Pages 397-414

  Campos, Vicente ^a   Glover, Fred ^b   Laguna, Manuel ^b   Martí, Rafael ^a  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035576458     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1012793906010     Document Type: Article

References (14)

1. Becker, O. (1967), Das Helmstädtersche Reihenfolgeproblem - die Effizienz verschiedener Näherungsverfahren in Computer uses in the Social Sciences, Berichteiner Working Conference, Wien, January 1967.
2. Chanas, S. and Kobylanski, P. (1996), A new heuristic algorithm solving the linear ordering problem, Computational Optimization and Applications, 6, 191-205.
3. Crowston, W. B., Glover, F., Thompson, G. L. and Trawick, J. D., (1963), Probabilistic and Parametric Learning Combinations of Local Job Shop Scheduling Rules, ONR Research Memorandum No. 117, GSIA, Carnegie Mellon University, Pittsburgh, PA.
4. Feo, T. and Resende, M. G. C. (1995), Greedy randomized adaptive search procedures, Journal of Global Optimization, 2, 1-27.
5. Fisher, H. and Thompson, G. L. (1963), Probabilistic learning combinations of local job-shop scheduling rules, in Industrial Scheduling, J. F. Muth and G. L. Thompson (eds.) Prentice-Hall, pp. 225-251.
6. Glover, F. (1965), A multiphase dual algorithm for the zero-one integer programming problem, Operations Research 13(6), 879-919.
7. Glover, F. (1968), Surrogate constraints, Operations Research 16, 741-749.
8. Glover, F. (1998), A template for scatter search and path relinking, in Artificial Evolution, Lecture Notes in Computer Science 1363, J.-K. Hao, E. Lutton, E. Ronald , M. Schoenauer and D. Snyers (Eds.), Springer, Berlin, pp. 13-54.
9. Glover, F. and Laguna, M. (1997), Tabu Search, Kluwer Academic Publishers, Boston, MA.
10. Grotschel, M., Junger, M. and Reinelt, G. (1984), A cutting plane algorithm for the linear ordering problem, Operations Research 32(6), 1195-1220.
11. Knuth, D. E. (1993), The Stanford GraphBase: A Platform for Combinatorial Computing, Addison-Wesley, New York.
12. Laguna, M. and Glover, F. (1993), Integrating target analysis and tabu search for improved scheduling systems, Expert Systems with Applications 6, 287-297.
13. Laguna, M., Martí, R. and Campos, V. (1998), Intensification and diversification with elite tabu search solutions for the linear ordering problem, to appear in Computers and Operations Research. LOLIB (1997), http://www.iwr.uni-heidelberg.de/iwr/comopt/soft.LOLIB/LOLIB.html.
14. Reinelt, G. (1985) The Linear Ordering Problem: Algorithms and Applications, Research and Exposition in Mathematics, Vol. 8, H. H. Hofmann and R. Wille (Eds.), Heldermann, Berlin.