{"title":"求解有界直径最小生成树问题的遗传算法新组合算子","authors":"N. D. Nghia, Huynh Thi Thanh Binh","doi":"10.1109/RIVF.2007.369143","DOIUrl":null,"url":null,"abstract":"Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.","PeriodicalId":158887,"journal":{"name":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem\",\"authors\":\"N. D. Nghia, Huynh Thi Thanh Binh\",\"doi\":\"10.1109/RIVF.2007.369143\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.\",\"PeriodicalId\":158887,\"journal\":{\"name\":\"2007 IEEE International Conference on Research, Innovation and Vision for the Future\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 IEEE International Conference on Research, Innovation and Vision for the Future\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF.2007.369143\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 IEEE International Conference on Research, Innovation and Vision for the Future","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF.2007.369143","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
New Recombination Operator in Genetic Algorithm For Solving the Bounded Diameter Minimum Spanning Tree Problem
Given a connected, weighted, undirected graph G=(V, E) and a bound D, Bounded Diameter Minimum Spanning Tree problem (BDMST) seeks spanning tree on G with smallest weight in which no path between two vertices contains more than D edges. This problem is NP-hard for 4 les D les |V|i - 1. In present paper a new randomized greedy heuristic algorithm and a new recombination method in genetic algorithm for solving BDMST are developed. Results of computational experiments are reported to show the efficiency of these algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
