The single line moving target traveling salesman problem with release times

Michael Hassoun (), Shraga Shoval, Eran Simchon and Liron Yedidsion
Additional contact information
Michael Hassoun: Ariel University
Shraga Shoval: Ariel University
Eran Simchon: Technion - Israel Institute of Technology
Liron Yedidsion: Amazon Logistics

Annals of Operations Research, 2020, vol. 289, issue 2, No 16, 449-458

Abstract: Abstract 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.

Keywords: Traveling salesman problem; Moving target; Release times; Dynamic programing (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10479-019-03412-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:289:y:2020:i:2:d:10.1007_s10479-019-03412-x

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-019-03412-x

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().