A survey of very large-scale neighborhood search techniques

Discrete Applied Mathematics

Volumn 123, Issue 1-3, 2002, Pages 75-102

  Ahuja, Ravindra K ^a   Ergun, Özlem ^b   Orlin, James B ^c   Punnen, Abraham P ^d  

^a University of Florida   (United States)

^b Georgia Institute of Technology   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^d UNIVERSITY OF NEW BRUNSWICK   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; HEURISTIC ALGORITHMS; LEARNING ALGORITHMS; OPTIMAL SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SURVEYS;

FEASIBLE SOLUTION; LARGE NEIGHBORHOOD; LOCAL SEARCH ALGORITHM; NEIGHBORHOOD SEARCH ALGORITHMS; NEIGHBORHOOD STRUCTURE; NETWORK FLOW TECHNIQUES; OPTIMIZATION PROBLEMS; VERY LARGE-SCALE NEIGHBORHOOD SEARCH;

ITERATIVE METHODS;

EID: 84867980790     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(01)00338-9     Document Type: Article

References (83)

1. E. Aarts, and J.K. Lenstra Local Search in Combinatorial Optimization 1997 Wiley New York
2. R.K. Ahuja, J.B. Orlin, D. Sharma, New neighborhood search structures for the capacitated minimum spanning tree problem, Research Report 99-2, Department of Industrial & Systems Engineering, University of Florida, 1999.
3. V. Aggarwal, V.G. Tikekar, and Lie-Fer Hsu Bottleneck assignment problem under categorization Comput. Oper. Res. 13 1986 11 26
4. D. Applegate, R. Bixby, V. Chvatal, and W. Cook On the solution of traveling salesman problems Documenta Math. ICM 1998 645 656
5. S. Arnborg, and A. Proskurowski Linear time algorithms for NP-hard problems restricted to partial k-trees Discrete Appl. Math. 23 1989 11 24
6. R.E. Burkard, and V.G. Deineko Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood Computing 54 1995 191 211
7. R.E. Burkard, V.G. Deineko, G.J. Woeginger, The travelling salesman problem and the PQ-tree, Mathematics of Operations Reserach 23 (1998) 613-623.
8. J. Carlier, and P. Villon A new heuristic for the traveling salesman problem RAIRO Oper. Res. 24 1990 245 253
9. R.K. Congram, C.N. Potts, S.L. van de Velde, An iterated dynasearch algorithm for the single machine total weighted tardiness scheduling problem, 1998, paper in preparation.
10. G. Cornuejols, D. Naddef, and W.R. Pulleyblank Halin graphs and the traveling salesman problem Math. Programming 26 1983 287 294
11. G.A. Croes A method for solving traveling-salesman problems Oper. Res. 6 1958 791 812
12. V. Deineko, G.J. Woeginger, A study of exponential neighborhoods for the traveling salesman problem and the quadratic assignment problem, Report Woe-05, Technical University Graz, 1997.
13. U. Dorndorf, and E. Pesch Fast clustering algorithms ORSA J. Comput. 6 1994 141 153
14. K.A. Dowsland Nurse scheduling with tabu search and strategic oscillation European J. Oper. Res. 106 1998 393 407
15. M. Dror, and L. Levy A vehicle routing improvement algorithm comparison of a "greedy" and a "matching" implementation for inventory routing Comput. Oper. Res. 13 1986 33 45
16. A.E. Dunlop, and B.W. Kernighan A procedure for placement of standard cell VLSI circuits IEEE Trans. Comput.-Aided Design 4 1985 92 98
17. M. Duque-Anton Constructing efficient simulated annealing algorithms Discrete Appl. Math. 77 1997 139 159
18. E.S. El-Mallah, and C.J. Colbourn Optimum communication spanning trees in series parallel networks SIAM J. Comput. 14 1985 915 925
19. R. Fahrion, and M. Wrede On a principle of chain exchange for vehicle routing problems (I-VRP) J. Oper. Res. Soc. 1990 821 827
20. C.M. Fiduccia, R.M. Mattheyses, A linear time heuristic for improving network partitions, in: ACM IEEE Nineteenth Design Automation Conference Proceedings, IEEE Computer Society, Los Alamitos, CA, 1982, pp. 175-181.
21. R.T. Firla, B. Spille, R. Weismantel, A primal analogue of cutting plane algorithms, Department of Mathematics, Otto-von-Guericke-University Magdeburg, 1999.
22. R.T. Firla, B. Spille, R. Weismantel, personal communication.
23. A. Frangioni, E. Necciari, M.G. Scutella, Multi-exchange algorithms for the minimum makespan machine scheduling problem, Dipartimento di Informatica, University of Pisa, 2000, paper in preparation.
24. M.L. Fredman, D.S. Johnson, and L.A. McGeoch Data structures for traveling salesman J. Algorithms 16 1995 432 479
25. M. Gendreau, F. Guertin, J.Y. Potvin, R. Seguin, Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries, CRT-98-10, 1998.
26. F. Glover, Ejection chains, reference structures, and alternating path algorithms for the traveling salesman problem, Research report, University of Colorado-Boulder, Graduate School of Business, 1992. {A short version appeared in Discrete Appl. Math. 65 (1996) 223-253.}
27. F. Glover Finding the best traveling salesman 4-opt move in the same time as a best 2-opt move J. Heuristics 2 1996 169 179
28. F. Glover, G.M. Gutin, A. Yeo, Zverovich, Construction heuristics and domination analysis for the asymmetric TSP, Research Report, Brunel University, 1999.
29. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Dordrecht
30. F. Glover, and A.P. Punnen The traveling salesman problem: new solvable cases and linkages with the development of approximation algorithms J. Oper. Res. Soc. 48 1997 502 510
31. G.M. Gutin On the efficiency of a local algorithm for solving the traveling salesman problem Automat. Remote Control 11 part 2 1988 1514 1519
32. G.M. Gutin Exponential neighborhood local search for the traveling salesman problem Comput. Oper. Res. 26 1999 313 320
33. G.M. Gutin, A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial domination number, Manuscript, Brunel University, UK, 1998.
34. G.M. Gutin, A. Yeo, TSP heuristics with large domination number, Report 12/98, Department of Mathematics and Statistics, Brunel University, UK, 1998.
35. G.M. Gutin, and A. Yeo Small diameter neighborhood graphs for the traveling salesman problem Comput. Oper. Res. 26 1999 321 327
36. G.M. Gutin, A. Yeo, TSP tour domination and Hamiltonian cycle decomposition of regular digraphs, Manuscript, Brunel University, UK, 1999.
37. K. Helsgaun, An effective implementation of the Lin-Kernighan traveling salesman heuristic, Manuscript, Roskilde University, Denmark, 1999.
38. J. Hurink, An exponential neighborhood for a one machine batching problem, OR Spektrum 21 (1999) 461-476.
39. D.S. Johnson, Local search and the traveling salesman problem, in: Proceedings of 17th International Colloquium on Automata Languages and Programming, Lecture Notes in Computer Science, Springer, Berlin, 1990, pp. 443-460.
40. D.S. Johnson, L.A. McGeoch, The travelling salesman problem: a case study in local optimization, in: E.H.L. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997, pp. 215-310.
41. R.M. Karp A patching algorithm for the non-symmetric traveling salesman problem SIAM J. Comput. 8 1979 561 573
42. B.W. Kernighan, and S. Lin An efficient heuristic procedure for partitioning graphs Bell System Tech. J. 49 1970 291 307
43. P.S. Klyaus, The structure of the optimal solution of certain classes of the traveling salesman problems, Vestsi Akad. Nauk BSSR, Phys. Math. Sci., Minsk, (1976) 95-98 (in Russian).
44. S. Knust Optimality conditions and exact neighborhoods for sequencing problems, Universitat Osnabruck, Fachbereich Mathematik/Informatik 1997 Osnabruck Germany
45. M Laguna, J. Kelly, J.L. Gonzales-Velarde, and F. Glover Tabu search for multilevel generalized assignment problem European J. Oper. Res. 82 1995 176 189
46. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys The Traveling Salesman Problem 1985 Wiley New York
47. S. Lin Computer solutions to the traveling salesman problem Bell System Tech. J. 44 1965 2245 2269
48. S. Lin, and B. Kernighan An effective heuristic algorithm for the traveling salesman problem Oper. Res. 21 1973 498 516
49. K. Mak, and A. Morton A modified Lin-Kernighan traveling salesman heuristic ORSA J. Comput. 13 1992 127 132
50. I.I. Melamed, S.I. Sergeev, and I.K. Sigal The traveling salesman problem: approximation algorithms Avtomati Telemekh 11 1989 3 26
51. C.H. Papadimitriou, The complexity of Lin-Kernighan algorithm, SIAM J. Comput. (1992) 450-465.
52. C.H. Papadimitriou, and K. Steiglitz Combinatorial Optimization: Algorithms and Complexity 1982 Prentice-Hall Englewood Cliffs, NJ
53. E. Pesch, and F. Glover TSP ejection chains Discrete Appl. Math. 76 1997 165 181
54. J.M. Phillips, A.P. Punnen, and S.N. Kabadi A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph Inform. Process. Lett. 67 1998 105 110
55. C.N. Potts, S.L. van de Velde, Dynasearch - Iterative local improvement by dynamic programming. part I. The traveling salesman problem, Technical Report, University of Twente, The Netherlands, 1995.
56. A.P. Punnen, The traveling salesman problem: new polynomial approximation algorithms and domination analysis, J. Inform. Optim. Sci., to appear.
57. A.P. Punnen, F. Glover, Ejection chains with combinatorial leverage for the TSP, Research Report, University of Colorado-Boulder, 1996.
58. A.P. Punnen, S.N. Kabadi, Domination analysis of heuristics for the asymmetric traveling salesman problem, Manuscript, University of New Brunswick, 1998.
59. C. Rego Relaxed tours and path ejections for the traveling salesman problem European J. Oper. Res. 106 1998 522 538
60. C. Rego A subpath ejection method for the vehicle routing problem Management Sci. 44 1998 1447 1459
61. C. Rego, and C. Roucairol A parallel tabu search algorithm using ejection chains for the vehicle routing problem I.H. Osman, J.P. Kelly, Meta-Heuristics: Theory and Applications 1996 Kluwer Academic Publishers Dordrecht
62. G. Reinelt The traveling salesman computational solutions for TSP application Lecture Notes in Computer Science Vol. 840 1994 Springer Berlin
63. R.T. Rockafellar Network Flows and Monotropic Optimization 1984 Wiley New York
64. V.I. Sarvanov, N.N. Doroshko, Approximate solution of the traveling salesman problem by a local algorithm with scanning neighborhoods of factorial cardinality in cubic time, Software: Algorithms and Programs, Vol. 31, Mathematics Institute of the Belorussia Academy of Science, Minsk, 1981, pp. 11-13 (in Russian).
65. A. Satyanarayana, and R.K. Wood A linear time algorithm for computing k-terminal reliability in series parallel networks SIAM J. Comput. 14 1985 818 832
66. R.R. Schneur, and J.B. Orlin A scaling algorithm for multicommodity flow problems Oper. Res. 46 1998
67. N. Simonetti, E. Balas, Implementation of a linear time algorithm for certain generalized traveling salesman problems, in: Proceedings of the IPCO V, Lecture Notes in Computer Science, Vol. 1084, Springer, Berlin, 1996, pp. 316-329.
68. F. Sourd, Scheduling tasks on unrelated machines: large neighborhood improvement procedures, J. Heuristics, submitted for publication.
69. E.D. Taillard Parallel iterative search methods for vehicle routing problems Network 23 1993 661 673
70. E.D. Taillard, Heuristic methods for large centroid clustering problems, Technical Report IDSIA-96-96, Lugano, 1996.
71. T. Takamizawa, T. Nishizeki, and N. Sato Linear time computability of combinatorial problems on series-parallel graphs J. ACM 29 1982 623 641
72. K.T. Talluri Swapping applications in a daily airline fleet assignment Transportation Sci. 30 1996 237 248
73. P.M. Thompson, Local search algorithms for vehicle routing and other combinatorial problems, Ph.D. Thesis, Operations Research Center, MIT, Cambridge, MA, 1988.
74. P.M. Thompson, J.B. Orlin, The theory of cyclic transfers, Operations Research Center Working Paper, MIT, Cambridge MA, August 1989.
75. P.M. Thompson, and H.N. Psaraftis Cyclic transfer algorithms for multivehicle routing and scheduling problems Oper. Res. 41 1993
76. M. Yagiura, T. Ibaraki, F. Glover, An ejection chain approach for the generalized assignment problem, Technical Report #99013, Department of Applied Mathematics and Physics, Kyoto University, 1999.
77. M. Yagiura, T. Yamaguchi, and T. Ibaraki A variable-depth search algorithm for the generalized assignment problem S. Voss, S. Martello, I.H. Osman, Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization 1999 Kluwer Academic Publishers Boston 459 471
78. A. Yeo, Large exponential neighborhoods for the traveling salesman problem, Preprint no. 47, Department of Mathematics and Computer Science, Odense University, 1997.
79. K. Wayne, A polynomial combinatorial algorithm for generalized minimum cost flow, STOC 1999.
80. P. Winter Steiner problem in Halin networks Discrete Appl. Math. 17 1987 281 294
81. M. Zachariasen, and M. Dam Tabu search on the geometric traveling salesman problem I.H. Osman, J.P. Kelly, Meta-Heuristics: Theory and Applications 1996 Kluwer Academic Publishers Dordrecht
82. P.C. Gilmore, E.L. Lawler, D.B. Shmoys, Well-solved special cases, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York, 1985, pp. 87-143.
83. G.M. Gutin, On approach to solving the traveling salesman problem, in: Theory, Methodology, and Practice of System Research, Mathematical Methods of Systems Analysis, VNIIST, Moscow, 1984, pp. 184-186.