|
About construction of realizability arias of salesman strategies in dynamic salesmen problem
Anastasiya V. Gavrilovaa, Yaroslavna B. Pankratovab a Foresight, Beloostrovskaya St.,17- 2, Saint-Petersburg 197342, Russia
b St. Petersburg State University, 7/9 Universitetskaya nab., Saint Petersburg 199034, Russia
Abstract:
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.
Keywords:
dynamic travelling salesman problem, non-zero sum game, Nash equilibrium, realizability areas.
Citation:
Anastasiya V. Gavrilova, Yaroslavna B. Pankratova, “About construction of realizability arias of salesman strategies in dynamic salesmen problem”, Contributions to Game Theory and Management, 14 (2021), 113–121
Linking options:
https://www.mathnet.ru/eng/cgtm392 https://www.mathnet.ru/eng/cgtm/v14/p113
|
|