Solving the generalized minimum spanning tree problem with swarm intelligence and hybrid heuristic algorithms
The generalized minimum spanning tree problem (GMSTP), widely used in facility network planning, is an NP-hard problem. In this thesis, we review the formulation, complexity, and applications of this problem. We present the k-means method for preparing the data and two kinds of heuristic algorithms:...
| Published: |
|
|---|---|
| Online Access: | http://hdl.handle.net/2047/D20410379 |