Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints

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 destroyand-repair method or a tabu search algorithm. Computational results compare the three methods in terms of accuracy and speed.

• Type: Journal
• Year: 2008
• Where: EOR
• Authors: Alysson M. Costa, Jean-François Cordeau, Gilbert Laporte
• Keywords: EOR 2008, Short Computational Times, Steiner Tree Problem, Tabu Search Algorithm