{"title":"逃避解决方案停滞不前。蚁群系统求解TSP的研究","authors":"C. Pintea, B. Iantovics, P. Pop, M. Dehmer","doi":"10.37193/cmi.2019.01.11","DOIUrl":null,"url":null,"abstract":"Nowadays, routing problems arise in different contexts of distribution of goods, transportation of commodities and people. Routing problems deals with traveling along a given network in an optimal way. One of the major goals in optimization, including optimization of routing problems, is to reduce the time of stagnation by finding an exit state. The current work is a study about the ability of ants to escape from solution stagnation on a particular routing problem, the Traveling Salesman Problem.","PeriodicalId":112946,"journal":{"name":"Creative Mathematics and Informatics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Escape from solutions stagnation. A Study on Ant System solving TSP\",\"authors\":\"C. Pintea, B. Iantovics, P. Pop, M. Dehmer\",\"doi\":\"10.37193/cmi.2019.01.11\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, routing problems arise in different contexts of distribution of goods, transportation of commodities and people. Routing problems deals with traveling along a given network in an optimal way. One of the major goals in optimization, including optimization of routing problems, is to reduce the time of stagnation by finding an exit state. The current work is a study about the ability of ants to escape from solution stagnation on a particular routing problem, the Traveling Salesman Problem.\",\"PeriodicalId\":112946,\"journal\":{\"name\":\"Creative Mathematics and Informatics\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Creative Mathematics and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37193/cmi.2019.01.11\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Creative Mathematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37193/cmi.2019.01.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Escape from solutions stagnation. A Study on Ant System solving TSP
Nowadays, routing problems arise in different contexts of distribution of goods, transportation of commodities and people. Routing problems deals with traveling along a given network in an optimal way. One of the major goals in optimization, including optimization of routing problems, is to reduce the time of stagnation by finding an exit state. The current work is a study about the ability of ants to escape from solution stagnation on a particular routing problem, the Traveling Salesman Problem.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
