We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The Traveling Salesman Subset-tour Problem with One Additional Constraint (TSSP + 1).
- Authors
Pillai, Rekha
- Abstract
The basic, capacity-constrained vehicle routing problem (VRP) is to determine a set of capacity-feasible vehicle routes with minimum total travel cost so that all customers are visited by exactly one vehicle. In this article it introduces a new decomposition strategy for the VRP which separates the decisions of a dispatcher from those of the individual drivers. The dispatcher is responsible for assigning a reward value to each of the customer cities so that each customer will be visited by exactly one vehicle. Based on the assigned reward values together with the given travel costs, each vehicle driver is responsible for choosing which customers to visit and determining an individual feasible route.
- Subjects
TRAVELING salesman problem; TRAVEL costs; TRANSPORTATION problems (Programming); MATHEMATICAL optimization; SELLING; OPERATING costs; PER diem allowances; CONSUMERS
- Publication
Transportation Science, 1994, Vol 28, Issue 1, p84
- ISSN
0041-1655
- Publication type
Article