Context-Independent Scatter and Tabu Search for Permutation Problems

References

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