Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://hdl.handle.net/11701/33692
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Gavrilova, Anastasiya V. | - |
dc.contributor.author | Pankratova, Yaroslavna B. | - |
dc.date.accessioned | 2021-11-26T18:47:40Z | - |
dc.date.available | 2021-11-26T18:47:40Z | - |
dc.date.issued | 2021-10 | - |
dc.identifier.citation | Gavrilova A. V., Pankratova Ya V. About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem. Contributions to Game Theory and Management, XIV, 113-121. | en_GB |
dc.identifier.other | https://doi.org/10.21638/11701/spbu31.2021.10 | - |
dc.identifier.uri | http://hdl.handle.net/11701/33692 | - |
dc.description.abstract | The dynamic travelling salesman problem, where we assume that all objects can move with constant velocity, is considered. To solve this NPhard 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. | en_GB |
dc.language.iso | en | en_GB |
dc.publisher | St Petersburg State University | en_GB |
dc.relation.ispartofseries | Contributions to Game Theory and Management;Volume 14 | - |
dc.subject | dynamic travelling salesman problem | en_GB |
dc.subject | non-zero sum game | en_GB |
dc.subject | Nash equilibrium | en_GB |
dc.subject | realizability areas | en_GB |
dc.title | About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem | en_GB |
dc.type | Article | en_GB |
Располагается в коллекциях: | 2021 |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
113-121.pdf | 1,13 MB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.