Abstract
This note considers a variant of the traveling salesman problem in which we seek a route that minimizes the total of the vertex arrival times. This problem is called the deliverly man problem. The traveling salesman problem is NP-complete on a general network and trivial on a tree network. The delivery man problem is also NP-complete on a general network but far from trivial on a tree network. Various characteristics of the delivery man problem for tree networks are explored and a pseudo-polynomial time solution algorithm is proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S.M. Hedetniemi, E.J. Cockayne and S.T. Hedetniemi, Linear algorithms for finding the Jordan center and path center of a tree, Trans. Sci. 15 (1981) 98.
W.A. Horn, Single-machine job sequencing with treelike precedence ordering and linear delay penalties, SIAM J. Math. Appl. 23 (1972) 189.
M.R. Garey and D.S. Johnson,Computer and Intractability, A Guide to the Theory of NP-Completeness (W.H. Freeman, San Francisco, 1979) 340 pp.
A. Meir and J. Moon, Cutting down recursive trees, Math. Biosci. 21 (1974) 173.
S. Sahni and T. Gonzalez,P-complete approximation problems, J. Assoc. Comp. Mach. 23 (1976) 555.
Author information
Authors and Affiliations
Additional information
This research was sponsored by NSF Grant #ECS-8104647.
Rights and permissions
About this article
Cite this article
Minieka, E. The delivery man problem on a tree network. Ann Oper Res 18, 261–266 (1989). https://doi.org/10.1007/BF02097807
Issue Date:
DOI: https://doi.org/10.1007/BF02097807