, Volume 24, Issue 2, pp 360–380 | Cite as

Models for a Steiner multi-ring network design problem with revenues

  • Ana Bautzer
  • Luís Gouveia
  • Ana Paias
  • José Manuel Pires
Original Paper


The Steiner multi-ring network design problem with revenues consists of designing node-disjoint multiple rings connected by a specific node (hub) and passing through all the nodes with high priority of service and some of the nodes with low priority of service. The number of nodes in each ring has an upper bound to assure a certain level of service. Besides the usual arc link costs, we also consider revenues between each pair of nodes in the same ring, even when they are not connected by a direct link. The objective is to minimize the difference between the total connection cost and total revenue. The problem is a generalization of the problem studied in Gouveia and Pires (Eur J Oper Res 133:21–31, 2001a) and it can also be seen as a combination of variants of two NP-Hard problems, the vehicle routing problem and the maximum edge-weighted clique problem. We introduce and discuss two types of integer linear programming formulations and propose some valid inequalities to strengthen the linear programming relaxation. Computational results are presented to evaluate the quality of the linear programming relaxation bounds associated with these formulations as well as efficiency of the models to obtain the optimal integer solutions.


Network design Integer linear programming Valid inequalities 

Mathematics Subject Classification




This work is supported by National Funding from FCT - Fundação para a Ciência e a Tecnologia, under the project: PEst-OE/MAT/UI0152. The authors would like to thank the anonymous referees for the helpful comments.


  1. Baldacci R, Dell’Amico M (2010) Heuristic algorithms for the multi-depot ring-star problem. Eur J Oper Res 203:270–281CrossRefGoogle Scholar
  2. Baldacci R, Dell’Amico M, Salazar González J (2007) The capacitated M-ring-star problem. Ope Res 55:1147–1162CrossRefGoogle Scholar
  3. Berinsky H, Zabala P (2011) An integer linear programming formulation and branch-and-cut algorithm for the capacitated M-ring-star problem. Electr Notes Discret Math 37:273–278CrossRefGoogle Scholar
  4. Carroll P, Fortz B, Labbé M, McGarraghy S (2013) A branch-and-cut algorithm for the ring spur assignment problem. Networks 61(2):89–103CrossRefGoogle Scholar
  5. Carroll P, Fortz B, Labbé M, McGarraghy S (2011) Improved formulations for the ring spur assignment problem. In: Pahl J, Reiners T, Voss S (eds) Network optimization, vol 6701 of Lecture notes in computer science. Springer, Berlin, pp 24–36Google Scholar
  6. Câmpelo M, Campos VA, Corrêa RC (2008) On the asymmetric representatives formulations for the vertex coloring problem. Discret Appl Math 156:1097–1111. doi: 10.1016//j.dam.2007.05.058 CrossRefGoogle Scholar
  7. Desrochers M, Laporte G (1991) Improvements to the Miller–Tucker–Zemlin subtour elimination constraints. Oper Res Lett 10:27–36CrossRefGoogle Scholar
  8. Gendreau M, Labbé M, Laporte G (1995) Efficient heuristics for the design of ring networks. Telecommun Syst 4:177–188CrossRefGoogle Scholar
  9. Gouveia L, Pesneau P (2006) On extend formulations for the precedence constrained asymmetric travelling salesman problem. Networks 48:77–89CrossRefGoogle Scholar
  10. Gouveia L, Pires J (2001a) Models for a Steiner ring network design problem with revenues. Eur J Oper Res 133:21–31Google Scholar
  11. Gouveia L, Pires J (2001b) The Asymmetric travelling salesman problem: on generalizations of disaggregated of Miller–Tucker–Zemlin constraints. Discret Appl Math 112:129–145Google Scholar
  12. Gouveia L, Pires J (1999) The asymmetric travelling salesman problem and a reformulation of the Miller–Tucker–Zemlin constraints. Eur J Oper Res 112:134–146CrossRefGoogle Scholar
  13. Klincewicz J, Luss H, Yan D (1998) Designing tributary networks with multiple ring families. Comput Oper Res 25:1145–1157CrossRefGoogle Scholar
  14. Labbé M, Laporte G, Rodríguez Martín I, Salazar González J (2004) The ring star problem: polyhedral analysis and exact algorithm. Networks 43:177–189CrossRefGoogle Scholar
  15. Naji-Azimi Z, Salari M, Toth P (2012) An integer linear programming based heuristic for the capacitated M-ring-star problem. Eur J Oper Res 217:17–25CrossRefGoogle Scholar
  16. Naji-Azimi Z, Salari M, Toth P (2010) A heuristic procedure for the capacitated M-ring-star problem. Eur J Oper Res 207:1227–1234CrossRefGoogle Scholar
  17. Pires JM (2001) Formulações Para O Problema Do Caixeiro Viajante Assimétrico E Sua Aplicação a Um Problema De Desenho De Redes Com Topologia Em Forma De Anel. Faculdade de Ciências da Universidade de Lisboa, Departamento de Estatística e Investigação OperacionalGoogle Scholar
  18. Sarin SC, Sherali HD, Bhootra A (2005) New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints. Oper Res Lett 33:62–70CrossRefGoogle Scholar
  19. Sherali H, Sarin S, Tsai P (2006) A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints. Discret Optim 3:20–32CrossRefGoogle Scholar
  20. Toth P, Vigo D (eds) (2002) The vehicle routing problem, vol 9 of SIAM monographs on discrete mathematics and applications, chapter 1. SIAM, Philadelphia, pp 1–26Google Scholar

Copyright information

© Sociedad de Estadística e Investigación Operativa 2015

Authors and Affiliations

  1. 1.ISCALLisbonPortugal
  2. 2.DEIO, Faculdade de CiênciasULisboaLisbonPortugal
  3. 3.Centro de Matemática Aplicações Fundamentais e Investigação OperacionalLisbonPortugal

Personalised recommendations