The problem can be seen as a generalization of the traveling salesman problem, which can be viewed as the special case of TPP where each article is available at one market only and each market sells only one item. Since TSP is NP-hard, TPP is NP-hard.1
Approaches for solving the traveling purchaser problem include dynamic programming2 and tabu search algorithms.3
"Heuristics for the traveling purchaser problem" (PDF). Archived from the original (PDF) on 2015-09-24. https://web.archive.org/web/20150924015724/http://www.fsa.ulaval.ca/personnel/renaudj/pdf/Recherche/tpp(purchaser)%20COR.pdf ↩
"A Dynamic Programming Approach for a Travelling Purchaser Problem With Additional Constraints" (PDF). Archived from the original (PDF) on 2019-09-29. https://web.archive.org/web/20190929213713/http://www.di.unipi.it/optimize/Events/proceedings/T/C/4/TC4-1.pdf ↩
"A Tabu Search Approach for solving the Travelling Purchase Problem" (PDF). Archived from the original (PDF) on 2016-06-10. https://web.archive.org/web/20160610114059/http://infos2008.fci.cu.edu.eg/infos/DSS_04_P024-030.pdf ↩