Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 5040513, 8 pages
http://dx.doi.org/10.1155/2016/5040513
Research Article

Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

1School of Business Administration, The Southwestern University of Finance and Economics, Chengdu 611130, China
2Department of Economics Mathematics, The Southwestern University of Finance and Economics, Chengdu 611130, China

Received 4 January 2016; Revised 19 April 2016; Accepted 28 June 2016

Academic Editor: Fei Liu

Copyright © 2016 Liang Xu et al. 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. I. F. A. Vis, “Survey of research in the design and control of automated guided vehicle systems,” European Journal of Operational Research, vol. 170, no. 3, pp. 677–709, 2006. View at Publisher · View at Google Scholar · View at Scopus
  2. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, WH Freeman and Company, New York, NY, USA, 1979. View at MathSciNet
  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
  4. F. Focacci, A. Lodi, and M. Milano, “A hybrid exact algorithm for the TSPTW,” INFORMS Journal on Computing, vol. 14, no. 4, pp. 403–417, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  5. A. Mingozzi, L. Bianco, and S. Ricciardelli, “Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints,” Operations Research, vol. 45, no. 3, pp. 365–377, 1997. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, Chichester, UK, 1985.
  7. R. E. Burkard, V. G. Deineko, R. van Dal, J. A. van der Veen, and G. Woeginger, “Well-solvable special cases of the traveling salesman problem: a survey,” SIAM Review, vol. 40, no. 3, pp. 496–546, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. A. Sanjeev, “Polynomial time approximation schemes for Euclidean TSP and other geometric problems,” in Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 2–11, 1996.
  9. V. G. Deĭneko and G. J. Woeginger, “The convex-hull-and-k-line travelling salesman problem,” Information Processing Letters, vol. 59, no. 6, pp. 295–301, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. R. E. Burkard, V. G. Deineko, and G. J. Woeginger, “The travelling salesman problem on permuted Monge matrices,” Journal of Combinatorial Optimization, vol. 2, no. 4, pp. 333–350, 1998. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. S. Rathinam, R. Sengupta, and S. Darbha, “A resource allocation algorithm for multivehicle systems with nonholonomic constraints,” IEEE Transactions on Automation Science and Engineering, vol. 4, no. 1, pp. 98–104, 2007. View at Publisher · View at Google Scholar · View at Scopus
  12. Z. Xu, L. Xu, and B. Rodrigues, “An analysis of the extended Christofides heuristic for the k-depot TSP,” Operations Research Letters, vol. 39, no. 3, pp. 218–223, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Z. Xu and B. Rodrigues, “A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots,” INFORMS Journal on Computing, vol. 27, no. 4, pp. 636–645, 2015. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. C. Moon, J. Kim, G. Choi, and Y. Seo, “An efficient genetic algorithm for the traveling salesman problem with precedence constraints,” European Journal of Operational Research, vol. 140, no. 3, pp. 606–617, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus