Abstract
The Steiner problem in graphs is concerned with finding the shortest tree containing a subset of nodes, called terminal nodes, in an undirected graph. In this article, we propose a two-step procedure to solve large-scale versions of the problem. In the first step, reduction rules are used to decrease the size of original graph. The second step is based on the ant colony algorithm which attempts to generate improved trees iteratively by adjusting edges' pheromone values until an optimal or near-optimal solution is generated.
| Original language | English (US) |
|---|---|
| State | Published - 2006 |
| Event | 2006 IIE Annual Conference and Exposition - Orlando, FL, United States Duration: May 20 2006 → May 24 2006 |
Other
| Other | 2006 IIE Annual Conference and Exposition |
|---|---|
| Country/Territory | United States |
| City | Orlando, FL |
| Period | 5/20/06 → 5/24/06 |
All Science Journal Classification (ASJC) codes
- Industrial and Manufacturing Engineering