ACS-SOP:一种求解集合定向问题的新方法

2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2020-10-29 DOI:10.1109/ICCKE50421.2020.9303697

Maryam Asadi Golmankhaneh, M. Keshtkaran

{"title":"ACS-SOP:一种求解集合定向问题的新方法","authors":"Maryam Asadi Golmankhaneh, M. Keshtkaran","doi":"10.1109/ICCKE50421.2020.9303697","DOIUrl":null,"url":null,"abstract":"The Set Orienteering Problem (SOP) is one of the generalizations of the well-known Orienteering Problem (OP), where the nodes are grouped in clusters and each cluster has a profit and if at least one of the nodes in the cluster is seen the profit of it, is collected. The objective is to find a path that maximizes the profit in a limited time. Our proposed method is a simple modification and combination of the Ant Colony System (ACS) for the Generalized Travelling Salesman Problem and the OP and a local search that improves the results obtained from ACS. Being able to improve the solution of 16 available benchmark instances, our method is a promising method for solving the SOP.","PeriodicalId":402043,"journal":{"name":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"ACS-SOP: A new solution method to the Set Orienteering Problem\",\"authors\":\"Maryam Asadi Golmankhaneh, M. Keshtkaran\",\"doi\":\"10.1109/ICCKE50421.2020.9303697\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Set Orienteering Problem (SOP) is one of the generalizations of the well-known Orienteering Problem (OP), where the nodes are grouped in clusters and each cluster has a profit and if at least one of the nodes in the cluster is seen the profit of it, is collected. The objective is to find a path that maximizes the profit in a limited time. Our proposed method is a simple modification and combination of the Ant Colony System (ACS) for the Generalized Travelling Salesman Problem and the OP and a local search that improves the results obtained from ACS. Being able to improve the solution of 16 available benchmark instances, our method is a promising method for solving the SOP.\",\"PeriodicalId\":402043,\"journal\":{\"name\":\"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-10-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCKE50421.2020.9303697\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCKE50421.2020.9303697","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

Set Orienteering Problem (SOP)是著名的Orienteering Problem (OP)的推广之一，其中节点被分组到集群中，每个集群都有一个利润，如果集群中至少有一个节点被看到，则收集它的利润。目标是在有限的时间内找到一条利润最大化的路径。我们提出的方法是对广义旅行商问题的蚁群系统(ACS)和OP的简单修改和组合，以及改进了ACS结果的局部搜索。我们的方法能够改进16个可用基准实例的解决方案，是一种很有前途的解决SOP的方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

ACS-SOP: A new solution method to the Set Orienteering Problem

The Set Orienteering Problem (SOP) is one of the generalizations of the well-known Orienteering Problem (OP), where the nodes are grouped in clusters and each cluster has a profit and if at least one of the nodes in the cluster is seen the profit of it, is collected. The objective is to find a path that maximizes the profit in a limited time. Our proposed method is a simple modification and combination of the Ant Colony System (ACS) for the Generalized Travelling Salesman Problem and the OP and a local search that improves the results obtained from ACS. Being able to improve the solution of 16 available benchmark instances, our method is a promising method for solving the SOP.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2020 10th International Conference on Computer and Knowledge Engineering (ICCKE)

自引率

0.00%

发文量