Abstract
The Hamiltonian p-median problem (HpMP) was introduced by [Branco90]. It is closely related to two well-known problems, namely the Travelling Salesman problem (TSP) and the Vehicle Routing problem (VRP). The HpMP is to find exactly p node-disjoint cycles of minimum edge cost, such that each node of the graph is contained in exactly one cycle. We present three new models for the HpMP problem which differ with regard to the constraints that enforce a maximum number of cycles. We demonstrate that one of the models (SEC) is dominated by another model (PCON) with regard to the LP relaxation. Further, we introduce a class of symmetry breaking constraints. We present results regarding the quality of the lower bounds provided by the respective LP relaxations for two of the models, and provide computational results that demonstrate the computational efficiency.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bauer, P., Linderoth, J., Savelsbergh, M.: A branch and cut approach to the cardinality constrained circuit problem. Mathematical Programming 91(2), 307–348 (2002)
Branco, I., Coelho, J.: The Hamiltonian p-median problem. European Journal of Operational Research 47(1), 86–95 (1990)
Cerdeira, J.: The hamiltonian k-median problem for any given k is NP-complete. Tech. rep., Centro de Estatistica e Aplicacoes, nota no. 14/86 (1986)
Egawa, Y., Hagita, M., Kawarabayashi, K.I., Wang, H.: Covering vertices of a graph by k disjoint cycles. Discrete Mathematics 270(1-3), 115–125 (2003)
Glaab, H., Löfflad, S., Pott, A.: Rundreiseprobleme beim halb-automatischen Lederzuschnitt. In: Proceedings of Operations Research 1997, pp. 86–101. Springer, Heidelberg (1998)
Glaab, H., Pott, A.: The Hamiltonian p-median problem. The Electronic Journal of Combinatorics 7(R42), 2 (2000)
Laporte, G., Nobert, Y., Pelletier, P.: Hamiltonian location problems. European Journal of Operational Research 12(1), 82–89 (1983)
Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. European Journal of Operational Research 177(2), 649–672 (2007)
Nemhauser, G., Wolsey, L.: Integer and combinatorial optimization. Wiley, New York (1999)
Zohrehbandian, M.: A New Formulation of the Hamiltonian p-Median Problem. Applied Mathematical Sciences 1(8), 355–361 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gollowitzer, S., Pereira, D.L., Wojciechowski, A. (2011). New Models for and Numerical Tests of the Hamiltonian p-Median Problem. In: Pahl, J., Reiners, T., Voß, S. (eds) Network Optimization. INOC 2011. Lecture Notes in Computer Science, vol 6701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21527-8_43
Download citation
DOI: https://doi.org/10.1007/978-3-642-21527-8_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21526-1
Online ISBN: 978-3-642-21527-8
eBook Packages: Computer ScienceComputer Science (R0)