Tabu search for the linear ordering problem with cumulative costs

Computational Optimization and Applications

Volumn 48, Issue 3, 2011, Pages 697-715

  Duarte, Abraham ^a   Laguna, Manuel ^b   Martí, Rafael ^c  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSITY OF COLORADO   (United States)

^c UNIVERSITY OF VALENCIA   (Spain)

Author keywords

Combinatorial optimization; Linear ordering problem; Metaheuristics

Indexed keywords

CUMULATIVE COST; LINEAR ORDERING PROBLEM; LINEAR ORDERINGS; LONG TERM MEMORY; MATRIX; META HEURISTICS; NON-LINEAR; NP COMPLETE PROBLEMS; SOLUTION QUALITY; WEIGHTED GRAPH;

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; HEURISTIC ALGORITHMS; HEURISTIC METHODS; SET THEORY;

TABU SEARCH;

EID: 79955949067     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-009-9270-5     Document Type: Article

References (17)

1. Adenso-Díaz, B., Laguna, M.: Fine-tuning of algorithms using partial experimental designs and local search. Oper. Res. 54(1), 99-114 (2006)
2. Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: TTTPLOTS: A Perl program to create time-to-target plots. Optim. Lett. 1, 355-366 (2008) (Pubitemid 47519609)
3. Becker, O.: Das Helmstädtersche Reihenfolgeproblem - die Effizienz verschiedener Näherungsver-fahren. In: Computer Uses in the Social Sciences. Bericht einer Working Conference, Wien, January 1967
4. Benvenuto, N., Carnevale, G., Tomasin, S.: Optimum power control and ordering in SIC receivers for uplink CDMA systems. In: IEEE-ICC 2005, Seoul, Korea, 2005
5. Bertacco, L., Brunetta, L., Fischetti, M.: The linear ordering problem with cumulative costs. Eur. J. Oper. Res. 189(3), 1345-1357 (2008) (Pubitemid 351400571)
6. Campos, V., Glover, F., Laguna, M., Martí, R.: An experimental evaluation of a scatter search for the linear ordering problem. J. Glob. Optim. 21, 397-414 (2001) (Pubitemid 33672376)
7. Chanas, S., Kobylanski, P.: A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl. 6, 191-205 (1996) (Pubitemid 126706907)
8. Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized search procedure for maximum independence set. Oper. Res. 42, 860-878 (1994)
9. García, C., Pérez, D., Campos, V., Martí, R.: Variable neighborhood search for the linear ordering problem. Comput. Oper. Res. 33, 3549-3565 (2006)
10. Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) Artificial Evolution. Lecture Notes in Computer Science, vol. 1363, pp. 13-54. Springer, Berlin (1998) (Pubitemid 128044715)
11. Grotschel, M., Junger, M., Reinelt, G.: A cutting plane algorithm for the linear ordering problem. Oper. Res. 32(6), 1195-1220 (1984) (Pubitemid 15457477)
12. Hoos, H.H., Stútzle, T.: Evaluating Las Vegas algorithms - pitfalls and remedies. In: Proc. of the 14th Conf. on Uncertainty in Artificial Intelligence, pp. 238-245 (1998)
13. Laguna, M., Martí, R.: Scatter Search - Methodology and Implementations. Kluwer Academic, Boston (2003)
14. Laguna, M., Martí, R., Campos, V.: Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26, 1217-1230 (1999) (Pubitemid 30024494)
15. Martí, R., Reinelt, G., Duarte, A.: Linear ordering LIBrary. http://heur.uv.es/optsicom/LOLIB (2009)
16. Proakis, J.G.: Digital Communications, 4th edn. McGraw-Hill, New York (2004)
17. Reinelt, G.: The linear ordering problem: Algorithms and applications. In: Hofmann, H.H., Wille, R. (eds.) Research and Exposition in Mathematics, vol. 8. Heldermann, Berlin (1985)