The Capacitated m -Ring-Star Problem

R. Baldacci (), M. Dell'Amico () and J. Salazar González ()
Additional contact information
R. Baldacci: Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, 47023 Cesena, Italy
M. Dell'Amico: Dipartimento di Scienze e Metodi dell'Ingegneria, University of Modena and Reggio Emilia, 42100 Reggio Emilia, Italy
J. Salazar González: Departamento de Estadistica, Investigacíon Operativa y Computacíon, Facultad de Matemáticas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain

Operations Research, 2007, vol. 55, issue 6, 1147-1162

Abstract: The Capacitated m -Ring-Star Problem (C m RSP) 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 C m RSP. 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: networks/graphs; optical network design; programming; integer; cutting plane; branch-and-cut algorithm (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (22)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1070.0432 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:55:y:2007:i:6:p:1147-1162

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().