Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
478819 | European Journal of Operational Research | 2008 | 11 Pages |
Abstract
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method which obtains good approximations in short computational times is proposed. This initial solution is then improved by means of a destroy-and-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte,