{"title":"选择性广义旅行商问题","authors":"Tusan Derya, Esra Dinler, Barış Keçeci","doi":"10.1080/13873954.2019.1705496","DOIUrl":null,"url":null,"abstract":"ABSTRACT This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour’s duration, which consists of a subset of clusters and a subset of nodes in each cluster visited on the tour. This problem is a combination of cluster and node selection and determining the shortest path between the selected nodes. We propose eight mixed integer programming (MIP) formulations for SGTSP. All of the given MIP formulations are completely new, which is one of the major novelties of the study. The performance of the proposed formulations is evaluated on a set of test instances by conducting 4608 experimental runs. Overall, 4138 out of 4608 (~90%) test instances were solved optimally by using all formulations.","PeriodicalId":49871,"journal":{"name":"Mathematical and Computer Modelling of Dynamical Systems","volume":"26 1","pages":"118 - 80"},"PeriodicalIF":1.8000,"publicationDate":"2020-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/13873954.2019.1705496","citationCount":"6","resultStr":"{\"title\":\"Selective generalized travelling salesman problem\",\"authors\":\"Tusan Derya, Esra Dinler, Barış Keçeci\",\"doi\":\"10.1080/13873954.2019.1705496\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"ABSTRACT This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour’s duration, which consists of a subset of clusters and a subset of nodes in each cluster visited on the tour. This problem is a combination of cluster and node selection and determining the shortest path between the selected nodes. We propose eight mixed integer programming (MIP) formulations for SGTSP. All of the given MIP formulations are completely new, which is one of the major novelties of the study. The performance of the proposed formulations is evaluated on a set of test instances by conducting 4608 experimental runs. Overall, 4138 out of 4608 (~90%) test instances were solved optimally by using all formulations.\",\"PeriodicalId\":49871,\"journal\":{\"name\":\"Mathematical and Computer Modelling of Dynamical Systems\",\"volume\":\"26 1\",\"pages\":\"118 - 80\"},\"PeriodicalIF\":1.8000,\"publicationDate\":\"2020-01-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1080/13873954.2019.1705496\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Mathematical and Computer Modelling of Dynamical Systems\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1080/13873954.2019.1705496\",\"RegionNum\":4,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Mathematical and Computer Modelling of Dynamical Systems","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1080/13873954.2019.1705496","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
ABSTRACT This paper introduces the Selective Generalized Traveling Salesman Problem (SGTSP). In SGTSP, the goal is to determine the maximum profitable tour within the given threshold of the tour’s duration, which consists of a subset of clusters and a subset of nodes in each cluster visited on the tour. This problem is a combination of cluster and node selection and determining the shortest path between the selected nodes. We propose eight mixed integer programming (MIP) formulations for SGTSP. All of the given MIP formulations are completely new, which is one of the major novelties of the study. The performance of the proposed formulations is evaluated on a set of test instances by conducting 4608 experimental runs. Overall, 4138 out of 4608 (~90%) test instances were solved optimally by using all formulations.
期刊介绍：
Mathematical and Computer Modelling of Dynamical Systems (MCMDS) publishes high quality international research that presents new ideas and approaches in the derivation, simplification, and validation of models and sub-models of relevance to complex (real-world) dynamical systems.
The journal brings together engineers and scientists working in different areas of application and/or theory where researchers can learn about recent developments across engineering, environmental systems, and biotechnology amongst other fields. As MCMDS covers a wide range of application areas, papers aim to be accessible to readers who are not necessarily experts in the specific area of application.
MCMDS welcomes original articles on a range of topics including:
-methods of modelling and simulation-
automation of modelling-
qualitative and modular modelling-
data-based and learning-based modelling-
uncertainties and the effects of modelling errors on system performance-
application of modelling to complex real-world systems.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
