{"title":"动态推销员问题中推销员策略可实现性咏调的构建","authors":"Anastasiya V. Gavrilova, Y. Pankratova","doi":"10.21638/11701/spbu31.2021.10","DOIUrl":null,"url":null,"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.","PeriodicalId":235627,"journal":{"name":"Contributions to Game Theory and Management","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem\",\"authors\":\"Anastasiya V. Gavrilova, Y. Pankratova\",\"doi\":\"10.21638/11701/spbu31.2021.10\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":235627,\"journal\":{\"name\":\"Contributions to Game Theory and Management\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Contributions to Game Theory and Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21638/11701/spbu31.2021.10\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Contributions to Game Theory and Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21638/11701/spbu31.2021.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
About Construction of Realizability Arias of Salesman Strategies in Dynamic Salesmen Problem
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.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
