Knowledge

Traveling purchaser problem

Source 📝

39:. Given a list of marketplaces, the cost of travelling between different marketplaces, and a list of available goods together with the price of each such good at each marketplace, the task is to find, for a given list of articles, the route with the minimum combined cost of purchases and traveling. The 55:
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.
100: 124: 148: 117: 182: 107: 177: 36: 40: 131: 141: 81: 125:"A Dynamic Programming Approach for a Travelling Purchaser Problem With Additional Constraints" 155: 8: 65: 32: 171: 93: 44: 69: 149:"A Tabu Search Approach for solving the Travelling Purchase Problem" 28: 64:
Approaches for solving the traveling purchaser problem include
50: 169: 101:"Heuristics for the traveling purchaser problem" 51:Relation to traveling salesman problem (TSP) 170: 16:Problem in combinatorial optimization 13: 14: 194: 59: 1: 87: 37:theoretical computer science 7: 183:Travelling salesman problem 75: 21:traveling purchaser problem 10: 199: 41:traveling salesman problem 82:Vehicle routing problem 178:NP-complete problems 66:dynamic programming 33:Operations research 31:problem studied in 47:of this problem. 190: 163: 162: 160: 154:. Archived from 153: 145: 139: 138: 136: 130:. Archived from 129: 121: 115: 114: 112: 106:. Archived from 105: 97: 198: 197: 193: 192: 191: 189: 188: 187: 168: 167: 166: 158: 151: 147: 146: 142: 134: 127: 123: 122: 118: 110: 103: 99: 98: 94: 90: 78: 62: 53: 17: 12: 11: 5: 196: 186: 185: 180: 165: 164: 161:on 2016-06-10. 140: 137:on 2019-09-29. 116: 113:on 2015-09-24. 91: 89: 86: 85: 84: 77: 74: 61: 58: 52: 49: 15: 9: 6: 4: 3: 2: 195: 184: 181: 179: 176: 175: 173: 157: 150: 144: 133: 126: 120: 109: 102: 96: 92: 83: 80: 79: 73: 71: 67: 57: 48: 46: 42: 38: 34: 30: 26: 22: 156:the original 143: 132:the original 119: 108:the original 95: 72:algorithms. 63: 54: 45:special case 24: 20: 18: 70:tabu search 60:Solving TPP 43:(TSP) is a 172:Categories 88:References 76:See also 27:) is an 29:NP-hard 159:(PDF) 152:(PDF) 135:(PDF) 128:(PDF) 111:(PDF) 104:(PDF) 35:and 68:and 19:The 25:TPP 174:: 23:(

Index

NP-hard
Operations research
theoretical computer science
traveling salesman problem
special case
dynamic programming
tabu search
Vehicle routing problem
"Heuristics for the traveling purchaser problem"
the original
"A Dynamic Programming Approach for a Travelling Purchaser Problem With Additional Constraints"
the original
"A Tabu Search Approach for solving the Travelling Purchase Problem"
the original
Categories
NP-complete problems
Travelling salesman problem

Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.