http://scholars.ntou.edu.tw/handle/123456789/6834
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Chun-Chao Yeh | en_US |
dc.contributor.author | Chien, Y. C. | en_US |
dc.date.accessioned | 2020-11-20T06:16:41Z | - |
dc.date.available | 2020-11-20T06:16:41Z | - |
dc.date.issued | 2014-06-01 | - |
dc.identifier.issn | 1023-2796 | - |
dc.identifier.uri | http://scholars.ntou.edu.tw/handle/123456789/6834 | - |
dc.description.abstract | Previous studies have discussed various constrained minimal spanning tree (MST) problems. In this paper, we propose an efficient algorithm for solving a class of constrained MST problems. The proposed PSO (Particle Swarm Optimization)-like strategy for solving constrained MST problems identifies optimal MSTs under degree and delay constraints. The solution quality and computation time of the proposed PLCMST (PSO-Like algorithm for Constrained MST problems) algorithm is compared with two other algorithms: one based on ant colony optimization, and the other based on a genetic algorithm strategy. Our experimental results show that the PLCMST outperforms the other two approaches, particularly when using dense graphs. | en_US |
dc.language.iso | en | en_US |
dc.publisher | National Taiwan Ocean University | en_US |
dc.relation.ispartof | Journal of Marine Science and Technology-Taiwan | en_US |
dc.subject | evolutionary algorithm | en_US |
dc.subject | ant colony optimization | en_US |
dc.subject | genetic algorithm | en_US |
dc.subject | constrained minimal spanning tree | en_US |
dc.title | A PARTICLE SWARM OPTIMIZATION-LIKE ALGORITHM FOR CONSTRAINED MINIMAL SPANNING TREE PROBLEMS | en_US |
dc.type | journal article | en_US |
dc.identifier.doi | <Go to ISI>://WOS:000342604400009 | - |
dc.identifier.doi | <Go to ISI>://WOS:000342604400009 | - |
dc.identifier.doi | 10.6119/jmst-013-1119-2 | - |
dc.identifier.doi | <Go to ISI>://WOS:000342604400009 | - |
dc.identifier.doi | <Go to ISI>://WOS:000342604400009 | - |
dc.identifier.url | <Go to ISI>://WOS:000342604400009 | |
dc.relation.journalvolume | 22 | en_US |
dc.relation.journalissue | 3 | en_US |
dc.relation.pages | 341 - 351 | en_US |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | journal article | - |
item.openairecristype | http://purl.org/coar/resource_type/c_6501 | - |
item.fulltext | no fulltext | - |
item.languageiso639-1 | en | - |
crisitem.author.dept | College of Electrical Engineering and Computer Science | - |
crisitem.author.dept | Department of Computer Science and Engineering | - |
crisitem.author.dept | National Taiwan Ocean University,NTOU | - |
crisitem.author.parentorg | National Taiwan Ocean University,NTOU | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
顯示於: | 資訊工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。