Models for a Steiner multi-ring network design problem with revenues
- 191 Downloads
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.
KeywordsNetwork design Integer linear programming Valid inequalities
Mathematics Subject Classification90C11
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.
- 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
- Gouveia L, Pires J (2001a) Models for a Steiner ring network design problem with revenues. Eur J Oper Res 133:21–31Google Scholar
- 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
- 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
- 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