The traveling purchaser problem with budget constraint
Computers and Operations Research
Look-ahead heuristics for the dynamic traveling purchaser problem
Computers and Operations Research
Computers and Operations Research
A column generation approach for a school bus routing problem with resource constraints
Computers and Operations Research
A constraint programming approach for the traveling purchaser problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
Computers and Operations Research
Hi-index | 0.00 |
The purpose of this paper is to present a branch-and-cut algorithm for the undirectedTraveling Purchaser Problem which consists of determining a minimum-cost route through a subset of markets, where the cost is the sum of travel and purchase costs. The problem is formulated as an integer linear program, and several families of valid inequalities are derived to strengthen the linear relaxation. The polyhedral structure of the formulation is analyzed and several classes of valid inequalities are proved to be facet defining. A branch-and-cut procedure is developed and tested over four classes of randomly generated instances. Results show that the proposed algorithm outperforms all previous approaches and can optimally solve instances containing up to 200 markets.