Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
From MaRDI portal
Publication:3116642
DOI10.1287/mnsc.45.3.330zbMath1231.90122MaRDI QIDQ3116642
Fred Glover, Steve Y. Chiu, Jie-Feng Xu
Publication date: 12 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a0e2f92f12a36dc7d2baf0106a6530deb98c7a50
traveling salesman problem; telecommunications network design; tabu search heuristic; digital data service
90B18: Communication networks in operations research
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
The Ring Star Problem: Polyhedral analysis and exact algorithm, Multiple depot ring star problem: a polyhedral study and an exact algorithm, The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm, Heuristic algorithms for the multi-depot ring-star problem, Locating median cycles in networks, General network design: a unified view of combined location and network design problems, Algorithms for the design of network topologies with balanced disjoint rings, The minimum flow cost Hamiltonian cycle problem: a comparison of formulations, Scatter search for the vehicle routing problem with time windows, A dynamic neighborhood based tabu search algorithm for real-world flight instructor scheduling problems, Metaheuristics and cooperative approaches for the bi-objective ring star problem, Upper and lower bounding procedures for the minimum caterpillar spanning problem, Cost-effective designs of fault-tolerant access networks in communication systems
Uses Software
