{"title":"加权多目标旅行商问题的求解","authors":"M. Ahmed, F. Ali, Wakkas Khalaf, ,. M. Al-Safi","doi":"10.24086/icafs2023/paper.899","DOIUrl":null,"url":null,"abstract":"The Multiobjective Travelling Salesman Problem with Weighted is studied in this article, we used the exact Branch and Bound (BAB) method to find the optimal solution and we proposed two heuristic methods MDA and MDTM to find the best solution. Finally, we compared the proposed methods MDA and MDTM with BAB to show the efficiency of these methods. The results prove the good performance of these methods.","PeriodicalId":342173,"journal":{"name":"4th International Conference on Administrative & Financial Sciences","volume":"39 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Solving Weighted Multiobjective Travelling Salesman Problem\",\"authors\":\"M. Ahmed, F. Ali, Wakkas Khalaf, ,. M. Al-Safi\",\"doi\":\"10.24086/icafs2023/paper.899\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Multiobjective Travelling Salesman Problem with Weighted is studied in this article, we used the exact Branch and Bound (BAB) method to find the optimal solution and we proposed two heuristic methods MDA and MDTM to find the best solution. Finally, we compared the proposed methods MDA and MDTM with BAB to show the efficiency of these methods. The results prove the good performance of these methods.\",\"PeriodicalId\":342173,\"journal\":{\"name\":\"4th International Conference on Administrative & Financial Sciences\",\"volume\":\"39 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\":\"4th International Conference on Administrative & Financial Sciences\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24086/icafs2023/paper.899\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"4th International Conference on Administrative & Financial Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24086/icafs2023/paper.899","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Solving Weighted Multiobjective Travelling Salesman Problem
The Multiobjective Travelling Salesman Problem with Weighted is studied in this article, we used the exact Branch and Bound (BAB) method to find the optimal solution and we proposed two heuristic methods MDA and MDTM to find the best solution. Finally, we compared the proposed methods MDA and MDTM with BAB to show the efficiency of these methods. The results prove the good performance of these methods.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
