Shaik Mastan, U. Balakrishnan, G. Sankar Sekhar Raju
{"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}
引用次数: 2
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
