Digital data networks design using genetic algorithms

DOI10.1016/S0377-2217(99)00329-XzbMath0979.90015OpenAlexW2030895630MaRDI QIDQ1590811

G. Premkumar, Hsinghua Chou, Chao-Hsien Chu

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

tabu searchgenetic algorithmsnetwork designtelecommunications

Mathematics Subject Classification ID

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

Related Items (3)

ON THE BEHAVIOR OF PARALLEL GENETIC ALGORITHMS FOR OPTIMAL PLACEMENT OF ANTENNAE IN TELECOMMUNICATIONS ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ A cross entropy approach to design of reliable networks

Uses Software

• OR-Library
• Tabu search

Cites Work

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

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