Column Generation Algorithms for the Capacitated m-Ring-Star Problem
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem
Computers and Operations Research
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
An IPTV service delivery model using novel virtual network topology
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
Computers and Operations Research
Designing Steiner Networks with Unicyclic Connected Components: An Easy Problem
SIAM Journal on Discrete Mathematics
A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
An integer programming-based local search for the covering salesman problem
Computers and Operations Research
The non-disjoint m-ring-star problem: polyhedral results and SDH/SONET network design
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
A branch-and-cut-and-price approach for the capacitated m-ring-star problem
Discrete Applied Mathematics
Variable neighborhood search and GRASP for three-layer hierarchical ring network design
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
A Branch-and-Cut Algorithm for the Symmetric Two-Echelon Capacitated Vehicle Routing Problem
Transportation Science
A memetic algorithm for the capacitated m-ring-star problem
Applied Intelligence
| Hi-index | 0.00 |
The Capacitated m-Ring-Star Problem (CmRSP) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each nonvisited customer to a visited point or customer. The number of customers visited and assigned to a ring is bounded by an upper limit: the capacity of the ring. The objective is to minimize the total routing cost plus assignment costs. The problem has practical applications in the design of urban optical telecommunication networks. This paper presents and discusses two integer programming formulations for the CmRSP. Valid inequalities are proposed to strengthen the linear programming relaxation and are used as cutting planes in a branch-and-cut approach. The procedure is implemented and tested on a large family of instances, including real-world instances, and the good performance of the proposed approach is demonstrated.