设计多中心树状网络的并行节约启发式方法

[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track Pub Date : 1989-01-03 DOI:10.1109/HICSS.1989.49195

K. Altinkemer

{"title":"设计多中心树状网络的并行节约启发式方法","authors":"K. Altinkemer","doi":"10.1109/HICSS.1989.49195","DOIUrl":null,"url":null,"abstract":"Parallel savings heuristics are presented for the multicenter tree-network design problem, where the objective is to find the least cost connection between a given set of user and backbone nodes (centers). Each subtree has to satisfy the capacity restriction of the backbone nodes. This approach combines the savings method with the matching problem, and is compared to L.R. Esau and K.C. Williams' (1966) heuristic modified to handle the multicenter case. This parallel savings heuristic allows one to decide how many backbone nodes to open and how to connect the user nodes to these backbone nodes. The performance of the parallel savings algorithms is demonstrated on a very large set of test problems.<<ETX>>","PeriodicalId":384442,"journal":{"name":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","volume":"63 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Parallel savings heuristics for designing multi-center tree networks\",\"authors\":\"K. Altinkemer\",\"doi\":\"10.1109/HICSS.1989.49195\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Parallel savings heuristics are presented for the multicenter tree-network design problem, where the objective is to find the least cost connection between a given set of user and backbone nodes (centers). Each subtree has to satisfy the capacity restriction of the backbone nodes. This approach combines the savings method with the matching problem, and is compared to L.R. Esau and K.C. Williams' (1966) heuristic modified to handle the multicenter case. This parallel savings heuristic allows one to decide how many backbone nodes to open and how to connect the user nodes to these backbone nodes. The performance of the parallel savings algorithms is demonstrated on a very large set of test problems.<<ETX>>\",\"PeriodicalId\":384442,\"journal\":{\"name\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track\",\"volume\":\"63 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-01-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HICSS.1989.49195\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HICSS.1989.49195","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

针对多中心树状网络设计问题，提出了并行节约启发式算法，其目标是在给定用户集和骨干节点(中心)之间找到成本最低的连接。每个子树必须满足骨干节点的容量限制。该方法将储蓄方法与匹配问题相结合，并与L.R. Esau和K.C. Williams(1966)的启发式改进方法进行了比较，以处理多中心情况。这种并行节省启发式方法允许决定打开多少骨干节点以及如何将用户节点连接到这些骨干节点。并行存储算法的性能在一组非常大的测试问题上得到了验证。

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

查看原文本刊更多论文

Parallel savings heuristics for designing multi-center tree networks

Parallel savings heuristics are presented for the multicenter tree-network design problem, where the objective is to find the least cost connection between a given set of user and backbone nodes (centers). Each subtree has to satisfy the capacity restriction of the backbone nodes. This approach combines the savings method with the matching problem, and is compared to L.R. Esau and K.C. Williams' (1966) heuristic modified to handle the multicenter case. This parallel savings heuristic allows one to decide how many backbone nodes to open and how to connect the user nodes to these backbone nodes. The performance of the parallel savings algorithms is demonstrated on a very large set of test problems.<>

求助全文

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

来源期刊

[1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track

自引率

0.00%

发文量