Context-independent scatter and tabu search for permutation problems

INFORMS Journal on Computing

Volumn 17, Issue 1, 2005, Pages 111-122

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

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF COLORADO   (United States)

Author keywords

Analysis of algorithms; Heuristic; Software

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONTEXT FREE GRAMMARS; FUNCTION EVALUATION; HEURISTIC METHODS; PROBLEM SOLVING; STATISTICAL METHODS;

ANALYSIS OF ALGORITHMS; CONTEXT-INDEPENDENT SCATTER; OBJECTIVE-FUNCTION EVALUATOR; PERMUTATION ALGORITHMS;

ONLINE SEARCHING;

EID: 14644398507     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0057     Document Type: Article

References (19)

1. Barnes, J. W., L. K. Vanston. 1981. Scheduling jobs with linear delay penalties and sequence dependent setup costs. Oper. Res. 29 146-160.
2. Campos, V., M. Laguna, R. Martí. 1999. Scatter search for the linear ordering problem. D. Corne, M. Dorigo, F. Glover, eds. New Ideas in Optimization. McGraw-Hill, New York, 331-339.
3. Campos, V., F. Glover, M. Laguna, R. Marti. 2001. An experimental evaluation of a scatter search for the linear ordering problem. J. Global Optim. 21 397-414.
4. Chanas, S., P. Kobylanski. 1996. A new heuristic algorithm solving the linear ordering problem. Comput. Optim. Appl. 6 191-205.
5. Croes, G. A. 1958. A method for solving traveling salesman problems. Oper. Res. 6 791-812.
6. Dueck, G. H., J. Jeffs. 1995. A heuristic bandwidth reduction algorithm. J. Combin. Math. Comput. 18 97-108.
7. Glover, F. 1994. Tabu search for nonlinear and parametric optimization with links to genetic algorithms. Discrete Appl. Math. 49 231-255.
8. Glover, F. 1998. A template for scatter search and path relinking. J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer, D. Snyers, eds. Artificial Evolution, LNCS, Vol. 1363. Springer, Berlin, Germany, 13-54.
9. Glover, F., M. Laguna, R. Martí. 2000. Scatter search. A. Ghosh, S. Tsutsui, eds. Theory and Applications of Evolutionary Computation: Recent Trends. Springer-Verlag, Berlin, Germany. Forthcoming.
10. Grötschel, M., M. Jünger, G. Reinelt. 1984. A cutting plane algorithm for the linear ordering problem. Oper. Res. 32 1195-1220.
11. Laguna, M., V. A. Armentano. 2001. Lessons from applying and experimenting with scatter search. C. Rego, B. Alidaee, eds. Adaptive Memory and Evolution: Tabu Search and Scatter Search. Kluwer Academic Publishers, Boston, MA. Forthcoming.
12. Laguna, M., R. Martí. 2000. Experimental testing of advanced scatter search designs for global optimization of multimodal functions. Technical report TR11-2000, Departamento de Estadística e I.O., University of Valencia, Valencia, Spain.
13. Laguna, M., J. W. Barnes, F. Glover. 1993. Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence dependent setup costs and times. J. Appl. Intelligence 3 159-172.
14. Laguna, M., R. Martí, V. Campos. 1999. Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26 1217-1230.
15. Lawler, E. L., J. K. Lenstra, A. H. G. Rinnoy Kan, D. B. Shmoys. 1985. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, New York.
16. Martí, R., M. Laguna, F. Glover, V. Campos. 2001. Reducing the bandwidth of a sparse matrix with tabu search. Eur. J. Oper. Res. 135 450-459.
17. Michalewicz, Z. 1994. Genetic Algorithms+Data Structures=Evolution Programs. Springer Verlag, Berlin, Germany.
18. Reinelt, G. 1985. The linear ordering problem: Algorithm and applications. K.-H. Hofman, R. Wille, eds. Research and Exposition in Mathematics, No. 8. Heldermann Verlag, Berlin, Germany.
19. Reinelt, G. 1994. The Traveling Salesman: Computational Solutions for TSP Applications. LNCS, Vol. 840. Springer Verlag, Berlin, Germany.