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

MoreLess

Year of publication:	2008
Authors:	Costa, Alysson M. ; Cordeau, Jean-François ; Laporte, Gilbert
Published in:	European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 190.2008, 1, p. 68-78
Publisher:	Elsevier

More details

Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005355102