𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and bound algorithm for the traveling purchaser problem

✍ Scribed by Kashi N. Singh; Dirk L. van Oudheusden

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
616 KB
Volume
97
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

✦ Synopsis

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm provide the evidence that moderate size problems of upto 25 cities and 100 commodities can be solved in reasonable computation time. The problem is shown to have applications in the areas of scheduling, warehousing and routing.

πŸ“œ SIMILAR VOLUMES

A branch-and-cut algorithm for the undir
A branch-and-cut algorithm for the undirected selective traveling salesman problem
✍ Gendreau, Michel; Laporte, Gilbert; Semet, FrοΏ½dοΏ½ric πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 120 KB πŸ‘ 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p