The Capacitated m-Ring-Star Problem
- 1 December 2007
- journal article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 55 (6) , 1147-1162
Abstract
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.Keywords
This publication has 15 references indexed in Scilit:
- Projection results for vehicle routingMathematical Programming, 2005
- Locating median cycles in networksEuropean Journal of Operational Research, 2005
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow FormulationOperations Research, 2004
- The Ring Star Problem: Polyhedral analysis and exact algorithmNetworks, 2004
- An exact algorithm for the Traveling Salesman Problem with Deliveries and CollectionsNetworks, 2003
- Multistars, partial multistars and the capacitated vehicle routing problemMathematical Programming, 2002
- Telecommunication and Location2002
- Separating capacity constraints in the CVRP using tabu searchEuropean Journal of Operational Research, 1998
- A result on projection for the vehicle routing problemEuropean Journal of Operational Research, 1995
- A branch-and-cut algorithm for vehicle routing problemsAnnals of Operations Research, 1994