Abstract
In this paper, a generalization of a recently proposed optimal path problem concerning decisions for improving connectivity is considered [see 6]. Each node in the given network is associated with a connection delay which can be reduced by implementing upgrading actions. For each upgrading action a cost must be paid, and the sum must satisfy a budget constraint. Given a fixed budget, the goal is to choose a set of upgrading actions such that the total delay of establishing paths among predefined node pairs is minimized. This model has applications in areas like multicast communication planning and wildlife reserve design.
A novel formulation is provided along with an ad-hoc branch-and-cut and a stabilized Benders decomposition algorithm. These strategies exploit connections of the considered problem with other well-known network design problems. Computational results on a large set of instances show the efficacy of the proposed preprocessing methods and optimization algorithms with respect to existing alternatives for the problem. Complementary, the scalability of the models and the corresponding algorithms is investigated with the aim of answering questions raised by [6].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Álvarez-Miranda, E., Ljubić, I., Mutzel, P.: The rooted maximum node-weight connected subgraph problem. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 300–315. Springer, Heidelberg (2013)
Ben-Ameur, W., Neto, J.: Acceleration of cutting-plane and column generation algorithms: applications to network design. Networks 49(1), 3–17 (2007)
Campbell, A., Lowe, T., Zhang, L.: Upgrading arcs to minimize the maximum travel time in a network. Networks 47(2), 72–80 (2006)
Costa, A.: A survey on benders decomposition applied to fixed-charge network design problems. Comput. OR 32(6), 1429–1450 (2005)
Dilkina, B., Gomes, C.P.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 102–116. Springer, Heidelberg (2010)
Dilkina, B., Lai, K.J., Gomes, C.P.: Upgrading shortest paths in networks. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 76–91. Springer, Heidelberg (2011)
Fischetti, M., Leitner, M., Ljubić, I., Luipersbeck, M., Monaci, M., Resch, M., Salvagnin, D., Sinnl, M.: Thinning out steiner trees: a node-based model for uniform edge costs. In: Workshop of the 11th DIMACS Implementation Challenge (2014)
Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1–3), 23–47 (2003)
Fischetti, M., Salvagnin, D.: An in-out approach to disjunctive optimization. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 136–140. Springer, Heidelberg (2010)
Fournier, J.: Optimal paths, pp. 119–147. ISTE (2010)
Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI (1), pp. 607–615 (1995)
Krumke, S., Marathe, M., Noltemeier, H., Ravi, R., Ravi, S., Sundaram, R., Wirth, H.: Improving minimum cost spanning trees by upgrading nodes. J. Algorithms 33(1), 92–111 (1999)
Magnanti, T., Mireault, P., Wong, R.: Tailoring benders decomposition for uncapacitated network design. In: Gallo, G., Sandi, C. (eds.) Netflow at Pisa, Mathematical Programming Studies, vol. 26, pp. 112–154. Springer, Heidelberg (1986)
Paik, D., Sahni, S.: Network upgrading problems. Networks 26(1), 45–58 (1995)
Polzin, T.: Algorithms for the Steiner problem in networks. Ph.D. thesis, Universitätsbibliothek (2003)
Vassilevska, V.: Efficient algorithms for path problems in weighted graphs. Ph.D. thesis, Carnegie Mellon University, August 2008
Acknowledgements
E. Álvarez-Miranda is supported by the Chilean Council of Scientific and Technological Research through the grant FONDECYT N.11140060 and through the Complex Engineering Systems Institute (ICM:P-05-004-F, CONICYT:FBO16). M. Sinnl is supported by the Austrian Research Fund (FWF, Project P 26755-N19). M. Luipersbeck acknowledges the support of the University of Vienna through the uni:docs fellowship programme.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Álvarez-Miranda, E., Luipersbeck, M., Sinnl, M. (2016). Optimal Upgrading Schemes for Effective Shortest Paths in Networks. In: Quimper, CG. (eds) Integration of AI and OR Techniques in Constraint Programming. CPAIOR 2016. Lecture Notes in Computer Science(), vol 9676. Springer, Cham. https://doi.org/10.1007/978-3-319-33954-2_29
Download citation
DOI: https://doi.org/10.1007/978-3-319-33954-2_29
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-33953-5
Online ISBN: 978-3-319-33954-2
eBook Packages: Computer ScienceComputer Science (R0)