Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2016, Article ID 5040513, 8 pages
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.


A new problem arises when an automated guided vehicle (AGV) is dispatched to visit a set of customers, which are usually located along a fixed wire transmitting signal to navigate the AGV. An optimal visiting sequence is desired with the objective of minimizing the total travelling distance (or time). When precedence constraints are restricted on customers, the problem is referred to as traveling salesman problem on path with precedence constraints (TSPP-PC). Whether or not it is NP-complete has no answer in the literature. In this paper, we design dynamic programming for the TSPP-PC, which is the first polynomial-time exact algorithm when the number of precedence constraints is a constant. For the problem with number of precedence constraints, part of the input can be arbitrarily large, so we provide an efficient heuristic based on the exact algorithm.