Extending evolutionary algorithms to discover tri-criterion and non-supported solutions for the minimum spanning tree problem.
The study of multi-criterion minimum spanning trees is important as many optimization problems in networks, such as communication, transport and utilities can be represented by this model. Conventional evolutionary approaches struggle to discover near-optimal solutions due to the combinatorial searc...
| Main Authors: | , , |
|---|---|
| Other Authors: | |
| Format: | Journal article |
| Language: | English |
| Published: |
ACM
2009
|