Using grammars to generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and other sequencing problems

Lecture Notes in Computer Science

Volumn 3509, Issue , 2005, Pages 437-451

  Bompadre, Agustin ^a   Orlin, James B ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT FREE GRAMMARS; DYNAMIC PROGRAMMING; FORMAL LANGUAGES; HEURISTIC METHODS; PROBLEM SOLVING; SEARCH ENGINES;

EXPONENTIAL FUNCTIONS; GENERIC DYNAMIC PROGRAMMING; LOCAL SEARCH HEURISTICS; VERY LARGE SCALE NEIGHBORHOODS;

TRAVELING SALESMAN PROBLEM;

EID: 24944445037     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496915_32     Document Type: Conference Paper

References (20)

1. R. K. Ahuja, O. Ergun, J. B. Orlin, A. P. Punnen (2002). "A survey of very large-scale neighborhood search techniques". Discrete Applied Mathematics 123, 75-102.
2. F. Aurenhammer (1998). "On-line sorting of twisted sequences in linear time". BIT 28, 194-204.
3. E. Balas (1996). "New classes of efficiently solvable generalized traveling salesman problem". Annals of Operations Research 86, 529-558.
4. E. Balas, N. Simonetti (2001). "Linear Time Dynamic Programming Algorithms for New Classes of Restricted TSPs: A Computational Study". INFORMS Journal on Computing 13:1, 56-75.
5. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, M. Sudan (1994). "The minimum latency problem". STOC '94: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, 163-171.
6. K. S. Booth, G. S. Lueker (1976). "Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms". J. Comput. Syst. Sci. 13, 335-379.
7. R. E. Burkard, V. G. Deǐneko, R. van Dal, J. A. A. van der Veen, G. J. Woeginger (1998). "Well-Solvable Special Cases of the Traveling Salesman Problem: A Survey". SIAM Review 40, 3 496-546.
8. R. E. Burkard, V. G. Deǐneko, G. J. Woeginger (1998). "The traveling salesman probem and the PQ-tree". Mathematics of Operations Research 23, 613-623.
9. J. Carlier, P. Villon (1990). "A new heuristic for the traveling salesman problem". RAIRO - Oper. Res. 24, 245-253.
10. R. K. Congram (2000). "Polynomially searchable exponential neighborhoods for sequencing problems in combinatorial optimisation". Ph.D. thesis, University of Southampton, UK.
11. R. K. Congram, C. N. Potts, S. L. van de Velde (2002). "An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem". INFORMS Journal on Computing 14, 52-67.
12. V. G, Deǐneko, G. J. Woeginger (2000). "A study of exponential neighborhoods for the Traveling Salesman Problem and for the Quadratic Assignment Problem". Mathematical Programming, Ser. A, 78, 519-542.
13. Ö. Ergun and J. B. Orlin (2003). "Dynamic Programming Methodologies in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem". MIT Sloan Working Paper No. 4463-03.
14. P. C. Gilmore, E. L. Lawler, D. B. Schmoys (1985). "Well solved special cases". Chapter 4 in The traveling salesman problem. John Wiley, Chichester.
15. J. E. Hopcroft, J. D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Publishing Company, 1979.
16. P. S. Klyaus (1976). "The structure of the optimal solution of certain classes of traveling salesman problems". Vestsi Akad. Nauk BSSR, Phys. Math. Sci., Minsk, 95-98 (in Russian).
17. C. N. Potts, S. L. van de Velde (1995). "Dynasearch-Iterative local improvement by dynamic programming. Part I. The traveling salesman problem", Technical Report, University of Twente, The Netherlands.
18. V. I. Sarvanov, N. N. Doroshko (1981). "The approximate solution of the traveling salesman problem by a local algorithm that searches neighborhoods of exponential cardinality in quadratic time". Software: Algorithms and Programs 31, Mathematical Institute of the Belorrusian Academy of Sciences, Minsk, 8-11 (in Russian).
19. J. T. Schwartz (1980). "Fast Probabilistic Algorithms for Verification of Polynomial Identities", Journal of the ACM (JACM) 27, Issue 4, 701 - 717.
20. H.M.M. ten Eikelder, R.J. Willemen (2001). "Some Complexity Aspects of Secondary School Timetabling Problems", Proceedings of PATAT 2000, 87:18-27.