旅行推销员问题的启发式设计

Transportation Science eJournal Pub Date : 2019-05-03 DOI:10.2139/ssrn.3497478

Shaik Mastan, U. Balakrishnan, G. Sankar Sekhar Raju

{"title":"旅行推销员问题的启发式设计","authors":"Shaik Mastan, U. Balakrishnan, G. Sankar Sekhar Raju","doi":"10.2139/ssrn.3497478","DOIUrl":null,"url":null,"abstract":"The voyaging sales rep issue is a fit perceived enhancement issue. Ideal answers for humble cases can be found in sensible time by straight programming. Be that as it may, since the TSP is NP-hard, it will be very tedious to determine bigger occurrences with ensured optimality. Circumstance optimality aside, there's a lot of calculations opening equivalently quick activity time and still delicate close ideal arrangements.","PeriodicalId":432405,"journal":{"name":"Transportation Science eJournal","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Heuristics Designed For the Traveling Salesman Problem\",\"authors\":\"Shaik Mastan, U. Balakrishnan, G. Sankar Sekhar Raju\",\"doi\":\"10.2139/ssrn.3497478\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The voyaging sales rep issue is a fit perceived enhancement issue. Ideal answers for humble cases can be found in sensible time by straight programming. Be that as it may, since the TSP is NP-hard, it will be very tedious to determine bigger occurrences with ensured optimality. Circumstance optimality aside, there's a lot of calculations opening equivalently quick activity time and still delicate close ideal arrangements.\",\"PeriodicalId\":432405,\"journal\":{\"name\":\"Transportation Science eJournal\",\"volume\":\"32 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-05-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Transportation Science eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2139/ssrn.3497478\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportation Science eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2139/ssrn.3497478","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

旅行销售代表问题是一个合适的感知增强问题。通过直接编程，可以在合理的时间内找到简单情况的理想答案。尽管如此，由于TSP是NP-hard的，在确保最优性的情况下确定更大的事件将是非常繁琐的。除了环境最优之外，还有很多计算，比如快速的活动时间和微妙的理想安排。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Heuristics Designed For the Traveling Salesman Problem

The voyaging sales rep issue is a fit perceived enhancement issue. Ideal answers for humble cases can be found in sensible time by straight programming. Be that as it may, since the TSP is NP-hard, it will be very tedious to determine bigger occurrences with ensured optimality. Circumstance optimality aside, there's a lot of calculations opening equivalently quick activity time and still delicate close ideal arrangements.

求助全文

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

来源期刊

Transportation Science eJournal

自引率

0.00%

发文量