The single line moving target traveling salesman problem with release times

Michael Hassoun; Shraga Shoval; Eran Simchon; Liron Yedidsion

doi:10.1007/s10479-019-03412-x

The single line moving target traveling salesman problem with release times

Michael Hassoun, Shraga Shoval, Eran Simchon, Liron Yedidsion

Research output: Contribution to journal › Article › peer-review

6 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 language	English
Pages (from-to)	449-458
Number of pages	10
Journal	Annals of Operations Research
Volume	289
Issue number	2
DOIs	https://doi.org/10.1007/s10479-019-03412-x
State	Published - 1 Jun 2020
Externally published	Yes

Keywords

Dynamic programing
Moving target
Release times
Traveling salesman problem

ASJC Scopus subject areas

General Decision Sciences
Management Science and Operations Research

Access to Document

10.1007/s10479-019-03412-x

Cite this

@article{61c1b5b75ab84fac8082870740c274c8,

title = "The single line moving target traveling salesman problem with release times",

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{\textquoteright}s (salesman{\textquoteright}s) objective is to intercept all targets in a minimum of time. We present a polynomial time algorithm to solve this problem.",

keywords = "Dynamic programing, Moving target, Release times, Traveling salesman problem",

author = "Michael Hassoun and Shraga Shoval and Eran Simchon and Liron Yedidsion",

note = "Publisher Copyright: {\textcopyright} 2019, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2020",

month = jun,

day = "1",

doi = "10.1007/s10479-019-03412-x",

language = "English",

volume = "289",

pages = "449--458",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "2",

}

TY - JOUR

T1 - The single line moving target traveling salesman problem with release times

AU - Hassoun, Michael

AU - Shoval, Shraga

AU - Simchon, Eran

AU - Yedidsion, Liron

PY - 2020/6/1

Y1 - 2020/6/1

N2 - 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.

AB - 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.

KW - Dynamic programing

KW - Moving target

KW - Release times

KW - Traveling salesman problem

UR - http://www.scopus.com/inward/record.url?scp=85074601861&partnerID=8YFLogxK

U2 - 10.1007/s10479-019-03412-x

DO - 10.1007/s10479-019-03412-x

M3 - Article

AN - SCOPUS:85074601861

SN - 0254-5330

VL - 289

SP - 449

EP - 458

JO - Annals of Operations Research

JF - Annals of Operations Research

IS - 2

ER -

The single line moving target traveling salesman problem with release times

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this