The single line moving target traveling salesman problem with release times

Michael Hassoun, Shraga Shoval, Eran Simchon, Liron Yedidsion

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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.

Original languageEnglish
Pages (from-to)449-458
Number of pages10
JournalAnnals of Operations Research
Volume289
Issue number2
DOIs
StatePublished - 1 Jun 2020
Externally publishedYes

Keywords

  • Dynamic programing
  • Moving target
  • Release times
  • Traveling salesman problem

ASJC Scopus subject areas

  • General Decision Sciences
  • Management Science and Operations Research

Fingerprint

Dive into the research topics of 'The single line moving target traveling salesman problem with release times'. Together they form a unique fingerprint.

Cite this