Loading...
Please wait, while we are loading the content...
Similar Documents
A Particle Swarm Optimization-like Algorithm for Constrained Minimal Spanning Tree Problems
| Content Provider | Semantic Scholar |
|---|---|
| Author | Yeh, Chun-Chao |
| Copyright Year | 2014 |
| 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://jmst.ntou.edu.tw/marine/22-3/341-351.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Algorithmic efficiency Analysis of algorithms Anatomic Node Ant colony optimization algorithms Computation Computation (action) Display Data Channel File spanning Genetic algorithm Graph - visual representation Linear programming Lingo (programming language) Mathematical optimization Metaheuristic Minimum spanning tree Next-generation access Nonlinear programming Nonlinear system Nut Hypersensitivity Particle swarm optimization Run time (program lifecycle phase) Simulation Software release life cycle Solutions Time complexity Trees (plant) Zalcitabine cyclophosphamide/doxorubicin/vincristine protocol |
| Content Type | Text |
| Resource Type | Article |