TY - JOUR

T1 - ABOUT CONSTRUCTION OF REALIZABILITY ARIAS OF SALESMAN STRATEGIES IN DYNAMIC SALESMEN PROBLEM

AU - Gavrilova, Anastasiya V.

AU - Pankratova, Yaroslavna B.

PY - 2021

Y1 - 2021

N2 - The dynamic travelling salesman problem, where we assume that all objects can move with constant velocity, is considered. To solve this NP-hard problem we use a game-theoretic approach and well-known solution concepts of pursuit games. We identify the realizability areas of salesman strategies depending on the initial positions of customers and their velocities. We present different cases of realizability areas of salesman strategies constructing in Python program with several numbers of customers.

AB - The dynamic travelling salesman problem, where we assume that all objects can move with constant velocity, is considered. To solve this NP-hard problem we use a game-theoretic approach and well-known solution concepts of pursuit games. We identify the realizability areas of salesman strategies depending on the initial positions of customers and their velocities. We present different cases of realizability areas of salesman strategies constructing in Python program with several numbers of customers.

KW - DYNAMIC TRAVELLING SALESMAN PROBLEM

KW - NON-ZERO SUM GAME

KW - NASH EQUILIBRIUM

KW - REALIZABILITY AREAS

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

M3 - Article

VL - 14

SP - 113

EP - 121

JO - Contributions to Game Theory and Management

JF - Contributions to Game Theory and Management

SN - 2310-2608

ER -