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 non-visited 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 objec-tive 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 within appropriated separation procedures 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 proposal is demonstrated.

The Capacitated m-Ring Star Problem / R., Baldacci; Dell'Amico, Mauro; J. J., Salazar. - In: OPERATIONS RESEARCH. - ISSN 0030-364X. - STAMPA. - 55:(2007), pp. 1147-1167.

The Capacitated m-Ring Star Problem

DELL'AMICO, Mauro;
2007

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 non-visited 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 objec-tive 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 within appropriated separation procedures 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 proposal is demonstrated.
55
1147
1167
The Capacitated m-Ring Star Problem / R., Baldacci; Dell'Amico, Mauro; J. J., Salazar. - In: OPERATIONS RESEARCH. - ISSN 0030-364X. - STAMPA. - 55:(2007), pp. 1147-1167.
R., Baldacci; Dell'Amico, Mauro; J. J., Salazar
File in questo prodotto:
File Dimensione Formato  
dellamico.pdf

non disponibili

Tipologia: Pre-print dell'autore (bozza pre referaggio)
Dimensione 362.7 kB
Formato Adobe PDF
362.7 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Pubblicazioni consigliate

Caricamento pubblicazioni consigliate

Licenza Creative Commons
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11380/610536
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 105
  • ???jsp.display-item.citation.isi??? 88
social impact