Solving the asymmetric traveling purchaser problem
- 135 Downloads
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the Asymmetric Traveling Salesman Problem with several applications in the routing and the scheduling contexts. This problem is defined as follows. Let us consider a set of products and a set of markets. Each market is provided with a limited amount of each product at a known price. The ATPP consists in selecting a subset of markets such that a given demand of each product can be purchased, minimizing the routing cost and the purchasing cost. The aim of this article is to evaluate the effectiveness of a branch-and-cut algorithm based on new valid inequalities. It also proposes a transformation of the ATPP into its symmetric version, so a second exact method is also presented. An extensive computational analysis on several classes of instances from literature evaluates the proposed approaches. A previous work () solves instances with up to 25 markets and 100 products, while the here-presented approaches prove optimality on instances with up to 200 markets and 200 products.
KeywordsTraveling purchaser problem Traveling salesman problem Branch-and-cut Heuristics
Unable to display preview. Download preview PDF.
- Fischetti, M., A. Lodi, and P. Toth. (2002). Exact Methods for the Asymmetric Traveling Salesman Problem.” Kluwer Academic Publishers, Dordrecht, chapter 4, 169–206.Google Scholar
- Fischetti, M., J.J. Salazar, and P. Toth. (1997). “A Branch-and-Cut Algorithms for the Symmetric Generalized Traveling Salesman Problem.” Operations Research, 45, 378–394.Google Scholar
- Fischetti, M. and P. Toth. (1997). “A Polyhedral Approach to the Asymmetric Traveling Salesman Problem.” Management Science, 43, 1520–1536.Google Scholar
- Grötschel, M. and M.W. Padberg. (1985). Polyhedral Theory. Wyley, Chichester. chapter 8, pp. 251–305.Google Scholar
- Jünger, M., G. Reinelt, and G. Rinaldi (1995). The Traveling Salesman Problem. North–Holland, Amsterdam chapter 4.Google Scholar
- Karp, R.M. (1972). “Reducibility Among Combinatorial Problems.” In Miller, R.E. and J.W. Thatcher. (ed.), Complexity of Computer Computations. New York: Plenum Press, pp. 85–103.Google Scholar
- Ong, H.L. (1982). “Approximate Algorithms for the Traveling Purchaser Problem.” Approximate Algorithms for the Traveling Purchaser Problem 1, 201–205.Google Scholar
- Padberg, M.W. (1975). “A Note on Zero-One Programming.” Operations Research, 23, 833–837.Google Scholar
- Ramesh, T. (1981). “Traveling Purchaser Problem.” Opsearch, 18, 78–91.Google Scholar
- Riera-Ledesma, J. (2002). The Traveling Purchaser Problem. PhD thesis, DEIOC, Universidad de La Laguna.Google Scholar