A viral system massive infection algorithm to solve the Steiner tree problem in graphs with medium terminal density
by Pablo Cortes, Jose M. Garcia, Jesus Munuzuri, Jose Guadix
International Journal of Bio-Inspired Computation (IJBIC), Vol. 2, No. 2, 2010

Abstract: The Steiner tree problem in graphs presents highest difficulties in case of graphs with a medium density of terminals. In fact, most of the efficient algorithms that have been developed to deal with the Steiner tree problem show their worse behaviour for a terminal density between 15 and 30%. Here we present a new bio-inspired approach based on a biological virus infection called viral system (VS) that emulates a massive infection in an organism (representing a massive exploration of the feasibility region). The approach is tested in a large-sized library of problems for which the optimal solution is known, and it is compared to other very efficient soft computing methodologies such as Tabu search and genetic algorithms that have been developed for this specific problem. The VS massive infection algorithm improves the results provided by such approaches.

Online publication date: Wed, 10-Mar-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Bio-Inspired Computation (IJBIC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com