Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems

@inproceedings{Bompadre2005UsingGT,
  title={Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems},
  author={Agust{\'i}n Bompadre and James B. Orlin},
  booktitle={IPCO},
  year={2005}
}
Local search heuristics are among the most popular approaches to solve hard optimization problems. Among them, Very Large Scale Neighborhood Search techniques present a good balance between the quality of local optima and the time to search a neighborhood. We develop a language to generate exponentially large neighborhoods for sequencing problems using grammars. We develop efficient generic dynamic programming solvers that determine the optimal neighbor in a neighborhood generated by a grammar… CONTINUE READING
8 Citations
20 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 20 references

A study of exponential neighborhoods for the Traveling Salesman Problem and for the Quadratic Assignment Problem

  • V. G. Děıneko, G. J. Woeginger
  • Mathematical Programming, Ser. A,
  • 2000
Highly Influential
9 Excerpts

The traveling salesman probem and the PQ-tree

  • R. E. Burkard, V. G. Děıneko, G. J. Woeginger
  • Mathematics of Operations Research
  • 1998
Highly Influential
12 Excerpts

Dynasearch–Iterative local improvement by dynamic programming

  • C. N. Potts, S. L. van de Velde
  • Part I. The traveling salesman problem”,
  • 1995
Highly Influential
3 Excerpts

Polynomially searchable exponential neighborhoods for sequencing problems in combinatorial optimisation

  • R K.
  • Congram
  • 2000

Similar Papers

Loading similar papers…