A chunking based genetic algorithm for the
                    Steiner tree problem in graphs

Voß, Stefan; Gutenschwager, Kai

doi:10.1090/dimacs/040/20

Cited by 14 publications

(10 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The key concept of bottleneck distance allowed Duin and Volgenant [5] to propose strong reduction tests, generalizing some ideas which appeared earlier in the literature [2,1,18]. The most important such tests, in terms of graph reductions obtained, are the SD and the NTD-3 tests.…”

Section: Reduction Tests For the Spgmentioning

confidence: 98%

See 1 more Smart Citation

Reduction tests for the prize-collecting Steiner problem

Uchôa

2006

Operations Research Letters

View full text Add to dashboard Cite

show abstract

Section: Reduction Tests For the Spgmentioning

confidence: 98%

“…The first reduction tests for the SPG were introduced by Beasley [2], Balakrishnan and Patel [1] and Voss [18]. They were generalized by Duin and Volgenant [5] in a work that established a set of reduction tests widely used in the 1990's decade.…”

Section: Prize-collecting Steiner Problem (Pcsp) Consists Of Given a mentioning

confidence: 99%

Reduction tests for the prize-collecting Steiner problem

Uchôa

2006

Operations Research Letters

View full text Add to dashboard Cite

show abstract

“…Also, metaheuristics have been applied to the Steiner problem successfully. Gendreau et al [21] for Tabu Search, as well as the Genetic Algorithms from Esbensen [22], and Voss and Gutenschwager [23] are three of the most notable approaches.…”

Section: An Application Example For Viral Systems: the Steiner Problemmentioning

confidence: 99%

“…Gutenschwager [23] (GA-V). Finally, we also show the results obtained for the Minimum Path Heuristic (MPH)…”

Section: Tablementioning

confidence: 99%

Viral systems: A new bio-inspired optimisation approach

Cortés

García

Muñuzuri

et al. 2008

Computers & Operations Research

View full text Add to dashboard Cite

Abstract.-The paper presents a new approach to deal with combinatorial problems. It makes use of a biological analogy inspired by the performance of viruses. The replication mechanism, as well as the hosts' infection processes is used to generate a metaheuristic that allows the obtention of valuable results. The Viral System (VS) theoretical context is described and it is applied to a library of medium-to-large-sized cases of the Steiner problem for which the optimal solution is known. The method is compared with the metaheuristics that have provided the best results for the Steiner problem. The Viral System provides better solutions than genetic algorithms and certain tabu search approaches. For the most sophisticated tabu search approaches (the best metaheuristic approximations to the Steiner problem solution) VS provides solutions of similar quality.

show abstract

“…The downside of GA is the CPU time required to solve a problem. Voss and Gutenschwager [37] proposed a chunking-based genetic algorithm (GAC) which is much faster than is GA but at the cost of a small decrease in the average solution quality.…”

Section: Introductionmentioning

confidence: 99%