容量最小生成树问题的模拟退火方法

Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300) Pub Date : 1999-09-23 DOI:10.1109/ICCIMA.1999.798569

J. Torres-Jiménez, Raúl Pinto Elías, A. García-Romero

{"title":"容量最小生成树问题的模拟退火方法","authors":"J. Torres-Jiménez, Raúl Pinto Elías, A. García-Romero","doi":"10.1109/ICCIMA.1999.798569","DOIUrl":null,"url":null,"abstract":"Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.","PeriodicalId":110736,"journal":{"name":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A simulated annealing approach for the capacitated minimum spanning tree problem\",\"authors\":\"J. Torres-Jiménez, Raúl Pinto Elías, A. García-Romero\",\"doi\":\"10.1109/ICCIMA.1999.798569\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.\",\"PeriodicalId\":110736,\"journal\":{\"name\":\"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)\",\"volume\":\"107 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-09-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIMA.1999.798569\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIMA.1999.798569","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

提出了一种解决np完全问题的新方法，即容量最小生成树(CMST)问题，该问题具有重要的理论和实践意义。该方法具有以下特点:(a)基于模拟退火(SA)算法;(b)用N-2个整数表示有N条边的树;(c)定义了可行树和不可行树之间的一致排序。我们的SA实现针对CMST的大多数参考算法进行了测试:Essau-Williams(1966)算法，Prim(1957)算法和Kruskal(1993)算法。结果表明，我们的新方法非常有希望解决CMST问题实例，因为它始终获得最佳结果(对于测试用例)，但需要更多的时间。

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

查看原文本刊更多论文

A simulated annealing approach for the capacitated minimum spanning tree problem

Presents a novel approach to solve an NP-complete problem that is very important from the theoretical and practical point of view, namely the capacitated minimum spanning tree (CMST) problem. This approach has the following features: (a) it is based on the simulated annealing (SA) algorithm; (b) it represents a tree with N edges using N-2 integers; and (c) it defines a consistent ordering between feasible and infeasible trees. Our SA implementation was tested against the most referenced algorithms for the CMST: the Essau-Williams (1966) algorithm, the Prim (1957) algorithm and the Kruskal (1993) algorithm. The results indicate that our novel approach is very promising for solving CMST problem instances, because it consistently obtains the best results (for the tested cases) but it takes more time.

求助全文

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

来源期刊

Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300)

自引率

0.00%

发文量