Journal
ANNALS OF OPERATIONS RESEARCH
Volume 289, Issue 2, Pages 449-458Publisher
SPRINGER
DOI: 10.1007/s10479-019-03412-x
Keywords
Traveling salesman problem; Moving target; Release times; Dynamic programing
Categories
Ask authors/readers for more resources
We define and study a variant of the Moving Target Traveling Salesman Problem, with all targets confined to a line and moving at the same speed. Target may appear at different times and the agent's (salesman's) objective is to intercept all targets in a minimum of time. We present a polynomial time algorithm to solve this problem.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available