Abstract
The traveling purchaser problem (TPP), a generalization of the traveling salesman problem, is to determine a tour of suppliers and purchase needed products from suppliers while minimizing the traveling and purchasing cost. This problem finds applications in the routing and scheduling contexts and its variants with different constraints have been widely studied. Motivated by the phenomenon that most real-world instances of TPP have a small parameter (such as the number of suppliers, the number of products to purchase, and others), we study TPP and its variants from the view of parameterized complexity. We show that TPP and some variants are fixed-parameter tractable by taking the number k of products or the number m of suppliers as the parameter, and W[2]-hard by taking the number q of visited suppliers as the parameter. Furthermore, we implement some of our fixed-parameter tractable algorithms to show that they are practically effective when the parameters are not very large.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ahuja RK, Orlin JB, Stein C (1994) Improved algorithms for bipartite network flow. SIAM J Comput 23(5):906–933
Alon N, Yuster R, Zwick U (1995) Color-coding. J ACM 42(4):844–856
Angelelli E, Mansini R, Vindigni M (2008) Exploring greedy criteria for the dynamic traveling purchaser problem. Central Eur J Oper Res 17(2):141–158
Angelelli E, Mansini R, Vindigni M (2016) The stochastic and dynamic traveling purchaser problem. Transp Sci 50(2):642–658
Angelelli E, Gendreau M, Mansini R, Vindigni M (2017) The traveling purchaser problem with time-dependent quantities. Comput Oper Res 82:15–26
Bellman R (1962) Dynamic programming treatment of the travelling salesman problem. J ACM 9(1):61–63
Bianchessi N, Mansini R, Speranza MG (2014) The distance constrained multiple vehicle traveling purchaser problem. Eur J Oper Res 235(1):73–87
Cambazard H, Penz B (2012) A constraint programming approach for the traveling purchaser problem. In: Milano M (eds) Principles and practice of constraint programming. CP 2012. Lecture notes in computer science, vol 7514, pp 735–749. Springer, Berlin
Choi MJ, Lee SH (2011) The multiple traveling purchaser problem for maximizing system’s reliability with budget constraints. Expert Syst Appl 38(8):9848–9853
Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179–192
Downey RG, Fellows MR (1992) Fixed-parameter tractability and completeness. Mathematical Sciences Institute, Cornell University, Ithaca
Downey RG, Fellows MR (1995) Fixed-parameter tractability and completeness II: on completeness for W[1]. Theor Comput Sci 141(1):109–131
Gouveia L, Paias A, Voß S (2011) Models for a traveling purchaser problem with additional side-constraints. Comput Oper Res 38(2):550–558
Hamdan S, Larbi R, Cheaitou A, Alsyouf I (2017) Green traveling purchaser problem model: A bi-objective optimization approach. In: Proceedings of the 7th international conference on modeling, simulation, and applied optimization (ICM-SAO), pp 1–6
Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196–210
Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31(12):1947–1964
Kang S, Ouyang Y (2011) The traveling purchaser problem with stochastic prices: exact and approximate algorithms. Eur J Oper Res 209(3):265–272
Laporte G, Riera-Ledesma J, Salazar-González JJ (2003) A branch-and-cut algorithm for the undirected traveling purchaser problem. Oper Res 51(6):940–951
Manerba D, Mansini R (2015) A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2):139–154
Manerba D, Gendreau M, Mansini R (2016) The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach. Eur J Oper Res 148:59–71
Manerba D, Mansini R, Riera-Ledesma J (2017) The traveling purchaser problem and its variants. Eur J Oper Res 259(1):1–18
Mansini R, Tocchella B (2009) The traveling purchaser problem with budget constraint. Comput Oper Res 36(7):2263–2274
Narayanaswamy N, Raman V, Ramanujan M, Saurabh S (2012) LP can be a cure for parameterized problems. In: STACS’12 (29th symposium on theoretical aspects of computer science), vol 14. LIPIcs, pp 338–349
Palomo-Martínez PJ, Salazar-Aguilar MA (2019) The bi-objective traveling purchaser problem with deliveries. Eur J Oper Res 273(2):608–622
Ramesh T (1981) Traveling purchaser problem. Opsearch 18(1–3):78–91
Ravi R, Salman FS (1999) Approximation algorithms for the traveling purchaser problem and its variants in network design. In: Algorithms-ESA’99, pp 29–40
Riera-Ledesma J, Salazar-González JJ (2006) Solving the asymmetric traveling purchaser problem. Ann Oper Res 144(1):83–97
Singh KN, van Oudheusden DL (1997) A branch and bound algorithm for the traveling purchaser problem. Eur J Oper Res 97(3):571–579
Acknowledgements
This work was supported by the National Natural Science Foundation of China, under grants 61972070 and 61772115.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Xiao, M., Zhang, J. & Lin, W. Parameterized algorithms and complexity for the traveling purchaser problem and its variants. J Comb Optim 44, 2269–2285 (2022). https://doi.org/10.1007/s10878-020-00608-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-020-00608-x