Digital data networks design using genetic algorithms

DOI10.1016/S0377-2217(99)00329-XMaRDI QIDQ1590811zbMATH OpenOpenAlexFDO

Authors Chao-Hsien Chu, G. Premkumar, Hsinghua Chou

Publication date 1 May 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(99)00329-x

zbMATH Keywords

genetic algorithmsnetwork designtabu searchtelecommunications

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Communication networks in operations research (90B18)

Recommendations

• Network design techniques using adapted genetic algorithms
• An approach to a problem in network design using genetic algorithms
• Genetic algorithms and network ring design
• A genetic algorithm approach on tree-like telecommunication network design problem
• Genetic algorithm for the discrete network design problem with equilibrium constraints
• An effective genetic algorithm for network coding

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1082103 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• scientific article; zbMATH DE number 960162 (Why is no real title available?)
• A faster approximation algorithm for the Steiner tree problem in graphs
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• An O(n logn) heuristic for steiner minimal tree problems on the euclidean metric
• An approach to a problem in network design using genetic algorithms
• Bandwidth Packing: A Tabu Search Approach
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• Euclidean Steiner minimum trees: An improved exact algorithm
• Genetic algorithms and tabu search: Hybrids for optimization
• Least-cost network topology design for a new service: An application of tabu search
• Network flows. Theory, algorithms, and applications.
• On tabu search for the location of interacting hub facilities
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Optimal network partitioning for fault-tolerant network management using evolutionary programming
• Optimized Crossover for the Independent Set Problem
• Path assignment for call routing: An application of tabu search
• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
• Sonet ring sizing with genetic algorithms
• Steiner problem in networks: A survey
• Tabu Search Applied to the Quadratic Assignment Problem
• Tabu Search—Part I
• The Steiner tree problem

Cited in

(6)

• Egonet: A Genetic Algorithm Model For The Optimisation Of Telephone Networks
• Neural Network and Genetic Algorithms for Topology Optimization of the CCS7 Network
• A cross entropy approach to design of reliable networks
• An algorithmic framework for the exact solution of tree-star problems
• Network design techniques using adapted genetic algorithms
• ON THE BEHAVIOR OF PARALLEL GENETIC ALGORITHMS FOR OPTIMAL PLACEMENT OF ANTENNAE IN TELECOMMUNICATIONS

Describes a project that uses

Uses Software

• Tabu search
• OR-Library

This page was built for publication: Digital data networks design using genetic algorithms

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