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

الملخص EN

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.