Standard

On a dynamic traveling salesman problem. / Tarashnina, S.I.; Pankratova, Ya.B,; Purtyan, A.

In: Contributions to Game Theory and Management, Vol. 10, 2017, p. 326-338.

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

Harvard

Tarashnina, SI, Pankratova, YB & Purtyan, A 2017, 'On a dynamic traveling salesman problem', Contributions to Game Theory and Management, vol. 10, pp. 326-338.

APA

Tarashnina, S. I., Pankratova, Y. B., & Purtyan, A. (2017). On a dynamic traveling salesman problem. Contributions to Game Theory and Management, 10, 326-338.

Vancouver

Tarashnina SI, Pankratova YB, Purtyan A. On a dynamic traveling salesman problem. Contributions to Game Theory and Management. 2017;10:326-338.

Author

Tarashnina, S.I. ; Pankratova, Ya.B, ; Purtyan, A. / On a dynamic traveling salesman problem. In: Contributions to Game Theory and Management. 2017 ; Vol. 10. pp. 326-338.

BibTeX

@article{3fa9a3b2ecc1448b9041ced9bd6d4cb9,
title = "On a dynamic traveling salesman problem",
abstract = "In this paper we consider a dynamic traveling salesman problem (DTSP) in which n objects (the salesman and m customers) move on a plane with constant velocities. Each customer aims to meet the salesman as soon as possible. In turn, the salesman aspires to meet all customers for the minimal time. We formalize this problem as non-zero sum game of pursuit and find its solution as a Nash equilibrium. Finally, we give some examples to illustrate the obtained results.",
keywords = "DYNAMICTRAVELING SALESMAN PROBLEM, NON-ZERO SUM GAME, NASH EQUILIBRIUM",
author = "S.I. Tarashnina and Ya.B, Pankratova and A. Purtyan",
year = "2017",
language = "English",
volume = "10",
pages = "326--338",
journal = "Contributions to Game Theory and Management",
issn = "2310-2608",

}

RIS

TY - JOUR

T1 - On a dynamic traveling salesman problem

AU - Tarashnina, S.I.

AU - Pankratova, Ya.B,

AU - Purtyan, A.

PY - 2017

Y1 - 2017

N2 - In this paper we consider a dynamic traveling salesman problem (DTSP) in which n objects (the salesman and m customers) move on a plane with constant velocities. Each customer aims to meet the salesman as soon as possible. In turn, the salesman aspires to meet all customers for the minimal time. We formalize this problem as non-zero sum game of pursuit and find its solution as a Nash equilibrium. Finally, we give some examples to illustrate the obtained results.

AB - In this paper we consider a dynamic traveling salesman problem (DTSP) in which n objects (the salesman and m customers) move on a plane with constant velocities. Each customer aims to meet the salesman as soon as possible. In turn, the salesman aspires to meet all customers for the minimal time. We formalize this problem as non-zero sum game of pursuit and find its solution as a Nash equilibrium. Finally, we give some examples to illustrate the obtained results.

KW - DYNAMICTRAVELING SALESMAN PROBLEM

KW - NON-ZERO SUM GAME

KW - NASH EQUILIBRIUM

UR - http://www.mathnet.ru/links/522eecf61a0b12ddc09780f12fdbfb4e/cgtm313.pdf

UR - https://elibrary.ru/item.asp?id=29655338

M3 - Article

VL - 10

SP - 326

EP - 338

JO - Contributions to Game Theory and Management

JF - Contributions to Game Theory and Management

SN - 2310-2608

ER -

ID: 17535616