Solving the Graphical Steiner Tree Problem Using Genetic Algorithms

DOI10.1057/JORS.1993.69MaRDI QIDQ5289351zbMATH OpenOpenAlexFDO

Authors A. Kapsalis, V. J. Rayward-Smith, Gareth Smith

Publication date 23 August 1993

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1993.69

zbMATH Keywords

genetic algorithmSteiner minimal tree problem in graphs

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Programming involving graphs or networks (90C35)

Recommendations

• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• A hybridised GA for the Steiner minimal tree problem
• scientific article; zbMATH DE number 5670036
• scientific article; zbMATH DE number 1163723
• A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem

Cited in

(24)

• Combinatorial optimization in system configuration design
• Digital data networks design using genetic algorithms
• Hybrid genetic algorithms for bin-packing and related problems
• Metaheuristics: A bibliography
• Genetic operators of an evolutionary model for the Steiner flow problem
• A genetic algorithm for the picture maze generation problem
• A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem
• The pilot method: a strategy for heuristic repetition with application to the Steiner problem in graphs
• scientific article; zbMATH DE number 5670036 (Why is no real title available?)
• A Genetic Algorithm for Solving the Euclidean Non-Uniform Steiner Tree Problem
• scientific article; zbMATH DE number 1163723 (Why is no real title available?)
• A hybridised GA for the Steiner minimal tree problem
• scientific article; zbMATH DE number 1791676 (Why is no real title available?)
• scientific article; zbMATH DE number 1852707 (Why is no real title available?)
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• scientific article; zbMATH DE number 5269238 (Why is no real title available?)
• An adaptive genetic algorithm for the minimal switching graph problem
• A grid enabled parallel hybrid genetic algorithm for SPN
• Solving Steiner trees: Recent advances, challenges, and perspectives
• NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
• A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
• Summarizing a set of time series by averaging: from Steiner sequence to compact multiple alignment
• Comparison and hybridization of crossover operators for the nurse scheduling problem
• A hybrid scatter search heuristic for personalized crew rostering in the airline industry

This page was built for publication: Solving the Graphical Steiner Tree Problem Using Genetic Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5289351)