automatically produced algorithms for the generalized minimum spanning tree problem
Clicks: 179
ID: 135285
2016
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
179 views
28 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #53 of 121 articles by views in environmental pollution
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 121 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
The generalized minimum spanning tree problem consists of finding a minimum cost spanning tree in an undirected graph for which the vertices are divided into clusters. Such spanning tree includes only one vertex from each cluster. Despite the diverse practical applications for this problem, the NP-hardness continues to be a computational challenge. Good quality solutions for some instances of the problem have been found by combining specific heuristics or by including them within a metaheuristic. However studied combinations correspond to a subset of all possible combinations. In this study a technique based on a genotype-phenotype genetic algorithm to automatically construct new algorithms for the problem, which contain combinations of heuristics, is presented. The produced algorithms are competitive in terms of the quality of the solution obtained. This emerges from the comparison of the performance with problem-specific heuristics and with metaheuristic approaches.
| Reference Key |
contreras-bolton2016scientificautomatically
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Carlos Contreras-Bolton;Carlos Rey;Sergio Ramos-Cossio;Claudio Rodríguez;Felipe Gatica;Victor Parada |
| Journal | environmental pollution |
| Year | 2016 |
| DOI |
10.1155/2016/1682925
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.