Table of Contents Author Guidelines Submit a Manuscript
Journal of Optimization
Volume 2016, Article ID 4786268, 15 pages
Research Article

Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem

1School of Mathematical and Computer Sciences, Heriot Watt University, Edinburgh EH14 4AS, UK
2Route Monkey Ltd., Livingston EH54 5DW, UK

Received 22 March 2016; Revised 23 May 2016; Accepted 8 June 2016

Academic Editor: Ling Wang

Copyright © 2016 Ziauddin Ursani and David W. Corne. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. L. Applegate, R. E. Bixby, V. Chvátal, and W. J. Cook, The Traveling Salesman Problem, Princeton University Press, 2007. View at MathSciNet
  2. J. K. Lenstra and A. H. G. R. Kan, “Some simple applications of the travelling salesman problem,” Operational Research Quarterly, vol. 26, no. 4, pp. 717–733, 1975. View at Publisher · View at Google Scholar
  3. S. Lin and B. W. Kernighan, “An effective heuristic algorithm for the traveling-salesman problem,” Operations Research, vol. 21, no. 2, pp. 498–516, 1973. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. J. Perttunen, “On the significance of the initial solution in travelling salesman heuristics,” The Journal of the Operational Research Society, vol. 45, no. 10, pp. 1131–1140, 1994. View at Publisher · View at Google Scholar · View at Scopus
  6. D. J. Rosenkrantz, R. E. Stearns, and I. Lewis, “An analysis of several heuristics for the traveling salesman problem,” SIAM Journal on Computing, vol. 6, no. 3, pp. 563–581, 1977. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. D. S. Johnson and L. A. McGeoch, “Experimental analysis of heuristics for the STSP,” in The Traveling Salesman Problem and Its Variations, G. Gutin and A. P. Punnen, Eds., vol. 12 of Combinatorial Optimization, chapter 9, pp. 369–443, Kulwer Academic Publishers, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  8. J. J. Bently, “Fast algorithms for the geometric travelling salesman problem,” ORSA Journal on Computing, vol. 4, no. 4, pp. 387–411, 1992. View at Publisher · View at Google Scholar
  9. D. S. Johnson and L. A. McGeoch, “The traveling salesman problem: a case study in local optimization,” in Local Search in Combinatorial Optimization, vol. 1, pp. 215–310, John Wiley & Sons, 1997. View at Google Scholar
  10. T. A. J. Nicholson, “A sequential method for discrete optimization problems and its application to the assignment, travelling salesman, and three machine scheduling problems,” IMA Journal of Applied Mathematics, vol. 3, no. 4, pp. 362–375, 1967. View at Publisher · View at Google Scholar · View at Scopus
  11. G. Righini, The Largest Insertion algorithm for the Traveling Salesman Problem, 2000,
  12. T. W. Tunnel and L. Heath, Development of new heuristics for the Euclidean travelling salesman problem [M.S. thesis], Virginia Polytechnic Institute and State University, Blacksburg, Va, USA, 1989,
  13. G. Reinelt, The Traveling Salesman Problem: Computational Solutions for TSP Applications, vol. 840 of Lecture Notes in Computer Science, Springer, Berlin, Germany, 1994. View at MathSciNet
  14. B. L. Golden and W. Stewart Jr., “Empirical analysis of heuristics,” in The Travelling Salesman Problem, E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan, and D. B. Shimoys, Eds., John Wiley & Sons, London, UK, 1985. View at Google Scholar