Abstract
The black and white traveling salesman problem (BWTSP) is a new class of NP-hard problem arising from work on airline scheduling and telecommunication fiber networks. The existing Ghiani LP for the undirected BWTSP contains an exponential number of constraints. For a special case of the directed BWTSP whose L = + ∞, the LP with polynomial number of constraints could be obtained by transforming it to an asymmetric traveling salesman problem with replenishment arcs (RATSP), whereas there exists no LP for the directed BWTSP in its general form. This paper proposes a LP with 3n 2 + 2n constraints only for the directed BWTSP in such a way that, by reducing the problem to an asymmetric traveling salesman problem (ATSP), we add n 2 cardinality constraints and n 2 length constraints to the existing Gavish-Grave LP for the ATSP. The new LP is also valid for the undirected BWTSP when viewed as a special case of the directed BWTSP.
Chapter PDF
Similar content being viewed by others
References
Wasem, O.J.: An algorithm for designing rings in survivable fiber networks. IEEE Transactions on Reliability 40, 428–432 (1991)
Cosares, S., Deutsch, D.N., Saniee, I., Wasem, O.J.: SONET toolkit: a decision support system for designing robust and cost-effective fiber-optic networks. Interfaces 25(1), 20–40 (1995)
Talluri, K.T.: The four-day aircraft maintenance routing problem. Transportation Science 32, 43–53 (1998)
Mak, V., Boland, N.: Heuristic approaches to the asymmetric traveling salesman problem with replenishment arcs. International Transactions in Operation Research 7, 431–447 (2000)
Orman, A.J., Williams, H.P.: A survey of different integer programming formulations of the travelling salesman problem. Working Paper No: LSEOR 04.67, The London School of Economics and Political Science (2004)
Dantzig, G.G., Fulkerson, D.R., Johnson, S.M.: Solutions of a large scale traveling salesman problem. Operations. Research 2, 393–410 (1954)
Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problem. Journal of ACM 3, 326–329 (1960)
Gavish, B., Graves, S.C.: The traveling salesman problem and related problems. Working Paper OR-078-78, Operations Research Center, MIT, Cambridge, MA (1978)
Finke, K.R., Gavish, B., Graves, S.C.: A two-commodity network flow approach to the traveling salesman problem. In: Combinatorics, Graph Theory and Computing, Proc. 14th South Eastern Conf., Atlantic University, Florida (1983)
Wong, R.T.: Integer programming formulations of the traveling salesman problem. In: Proc. IEEE Conf. On Circuits and Computers, pp. 149–152 (1980)
Claus, A.: A new formulation for the traveling salesman problem. SIAM Journal of Algorithm and Discrete Mathematics 5, 21–25 (1984)
Vajda, S.: Mathematical Programming. Addison-Wesley, London (1961)
Fox, K.R., Gavish, B., Graves, S.C.: An n-constraint formulation of the (time-dependent) traveling salesman problem. Operations Research 28, 1018–1021 (1980)
Zhu, Z.: The aircraft rotation problem. PhD thesis, Georgia Institute of Technology (1994)
Boland, N.L., Clarke, L.W., Nemhauser, G.L.: The asymmetric traveling salesman problem with replenishment arcs. European Journal of Operations Research 123, 408–427 (2000)
Vicky, M.: On the asymmetric traveling salesman problem with replenishment arcs. PhD thesis, Department of Mathematics and Statistics, University of Melbourne (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Jiang, H., Zhang, X., Li, M., Che, H. (2007). Using Gavish-Grave LP to Formulate the Directed Black and White Traveling Salesman Problem. In: Shi, Y., van Albada, G.D., Dongarra, J., Sloot, P.M.A. (eds) Computational Science – ICCS 2007. ICCS 2007. Lecture Notes in Computer Science, vol 4489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72588-6_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-72588-6_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72587-9
Online ISBN: 978-3-540-72588-6
eBook Packages: Computer ScienceComputer Science (R0)