Abstract
Symmetric traveling salesman problem (STSP), a difficult combinatorial problem is formulated as a multistage insertion (MI) decision problem in Arthanari and Usha (2000). MI formulation is a compact 0-1 formulation for STSP. MI has given rise to the definition of a combinatorial object called pedigree. Arthanari (2008) contains a necessary condition for a MI-relaxation solution to be expressible as a convex combination of pedigrees. The existence of a multicommodity flow with the optimum value equal to unity over some layered network is checked for this purpose. This paper walks through an illustrative example to show the construction of such a network and the procedures involved in checking the necessary condition. Another important feature of this example is it brings out the need for discarding some arcs from the network called dummy arcs, for the correctness of the necessary condition for membership.
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
Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows Theory: Algorithms and Applications. Prentice Hall, Englewood Cliffs (1993)
Applegate, D., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)
Arthanari, T.S.: On the Membership Problem of Pedigree Polytope. In: Neogy, S.K., Bapat, R.B., Das, A.K., Parthasarathy, T. (eds.) Mathematical Programming and Game Theory for Decision Making, pp. 61–98. World Scientific, Singapore (2008)
Arthanari, T.S.: A Comparison of the Pedigree Polytope with the Symmetric Traveling Salesman Polytope. In: The Fourteenth International Conference of the FIM, Chennai, India, pp. 6–8 (2007)
Arthanari, T.S.: On Pedigree Polytopes and Hamiltonian Cycles. Discrete Mathematics 306, 1474–1492 (2006)
Arthanari, T.S.: Pedigree Polytope is a Combinatorial Polytope. In: Mohan, S.R., Neogy, S.K. (eds.) Operations Research with Economic and Industrial Applications: Emerging Trends, pp. 1–17. Anamaya Publishers, New Delhi (2005)
Arthanari, T.S., Usha, M.: On the Equivalence of the Multistage-Insertion and Cycle Shrink Formulations of the Symmetric Traveling Salesman Problem. Operations Research Letters 29, 129–139 (2001)
Arthanari, T.S., Usha, M.: An Alternate Formulation of the Symmetric Traveling Salesman Problem and Its Properties. Discrete Applied Mathematics 98, 173–190 (2000)
Arthanari, T.S.: On the Traveling Salesman Problem. In: Bachem, A., et al. (eds.) Mathematical Programming- The State of the Art, p. 638. Springer, New York (1983)
Claus, A.: A New Formulation for the Traveling Salesman Problem. SIAM Journal of Algebraic Discrete Methods 5, 21–25 (1984)
Concorde Home, http://www.tsp.gatech.edu/concorde/index.htm
Dantzig, G., Fulkerson, D., Johnson, S.: Solution of a Large Scale Traveling Salesman Problem. Operations Research 2, 393–410 (1954)
Fox, K., Gavish, B., Graves, S.: An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem. Operations Research 28, 1018–1021 (1980)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Berlin (1988)
Junger, M., Reinelt, G., Giovanni, R.: The Traveling Salesman Problem. Network Models. In: Ball, M.O., Magnanti, T.L., Monma, C.L. (eds.) Handbook in Operations Research and Management Science, vol. 7. Elsevier Science, Amsterdam (1995)
Lawler, E., Lenstra, J.K., Rinooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley, New York (1985)
Miller, C., Tucker, A., Zemlin, R.: Integer Programming Formulations and Traveling Salesman Problems. Journal of the Association for Computing Machinery 7, 326–329 (1960)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley Interscience, Chichester (1999)
Orman, A.J., Williams, H.P.: A Survey of Different Integer Programming Formulations of the Traveling Salesman Problem. In: Kontoghiorghes, E.J., Gatu, C. (eds.) Optimization Econometrics and Financial Analysis. Springer, Heidelberg (2007)
Padberg, M., Sung, T.: An Analytical Comparison of Different Formulations of the Traveling Salesman Problem. Mathematical Programming 52, 315–357 (1991)
Papadimitriou, C.H.: The Adjacency Relation on the Traveling Salesman Polytope Is NP-Complete. Math. Programming 14, 312–324 (1978)
Reinelt, G.: The Traveling Salesman: Computational Solutions for TSP Applications. Springer, Heidelberg (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Haerian Ardekani, L., Subramanian Arthanari, T. (2008). Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration. In: Le Thi, H.A., Bouvry, P., Pham Dinh, T. (eds) Modelling, Computation and Optimization in Information Systems and Management Sciences. MCO 2008. Communications in Computer and Information Science, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87477-5_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-87477-5_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87476-8
Online ISBN: 978-3-540-87477-5
eBook Packages: Computer ScienceComputer Science (R0)