双目标旅行贼问题的变邻域搜索

2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO) Pub Date : 2020-06-01 DOI:10.1109/ICRITO48877.2020.9198016

R. Kumari, K. Srivastava

{"title":"双目标旅行贼问题的变邻域搜索","authors":"R. Kumari, K. Srivastava","doi":"10.1109/ICRITO48877.2020.9198016","DOIUrl":null,"url":null,"abstract":"In this paper, Travelling Thief Problem (TTP) which is a hybridization of two well-known hard optimization problems-namely Travelling salesman problem and Knapsack Problem, is dealt using metaheuristic approach. We have designed and implemented Variable Neighbourhood Search, a widely used metaheuristic, to tackle TTP. The results indicate comparable performance with the available best-known work for TTP.","PeriodicalId":141265,"journal":{"name":"2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Variable Neighbourhood Search for Bi-Objective Travelling Thief Problem\",\"authors\":\"R. Kumari, K. Srivastava\",\"doi\":\"10.1109/ICRITO48877.2020.9198016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, Travelling Thief Problem (TTP) which is a hybridization of two well-known hard optimization problems-namely Travelling salesman problem and Knapsack Problem, is dealt using metaheuristic approach. We have designed and implemented Variable Neighbourhood Search, a widely used metaheuristic, to tackle TTP. The results indicate comparable performance with the available best-known work for TTP.\",\"PeriodicalId\":141265,\"journal\":{\"name\":\"2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)\",\"volume\":\"116 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICRITO48877.2020.9198016\",\"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 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICRITO48877.2020.9198016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文用元启发式方法研究了旅行贼问题(TTP)，它是旅行推销员问题和背包问题这两个著名的难优化问题的混合。我们设计并实现了可变邻域搜索，一种广泛使用的元启发式算法，以解决TTP问题。结果表明，其性能可与TTP中最知名的可用工作相媲美。

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

查看原文本刊更多论文

Variable Neighbourhood Search for Bi-Objective Travelling Thief Problem

In this paper, Travelling Thief Problem (TTP) which is a hybridization of two well-known hard optimization problems-namely Travelling salesman problem and Knapsack Problem, is dealt using metaheuristic approach. We have designed and implemented Variable Neighbourhood Search, a widely used metaheuristic, to tackle TTP. The results indicate comparable performance with the available best-known work for TTP.

求助全文

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

来源期刊

2020 8th International Conference on Reliability, Infocom Technologies and Optimization (Trends and Future Directions) (ICRITO)

自引率

0.00%

发文量