COST ALLOCATION : THE TRAVELING SALESMAN, BINPACKING, AND THE KNAPSACK

The traveling salesman problem (tsp) has been defined as follows: a salesman starts from a home city and visits each city on a given list while minimizing the total distance traveled. This paper considers a number of methodologies for determining cost allocation in the traveling salesman problem. Cost allocation schemes are also evaluated as they relate to the binpacking and knapsack problems. (a)

• Corporate Authors:

  University of Montreal

  Center for Research on Transportation (CRT)/CIRRELT
  P.O. Box 6128, Station Centre-ville
  Montreal, Quebec  Canada  H3C 3J7
• Authors:
  • Dror, M
• Publication Date: 1988-6

Language

• Undetermined

Media Info

• Pagination: 13 p.
• Serial:
  • Issue Number: 577

Subject/Index Terms

• TRT Terms: Costs; Intercity transportation; Length; Mathematical models; Minimization; Networks; Physical distribution
• Uncontrolled Terms: Minimum; Transportation networks
• Subject Areas: Finance; Freight Transportation;

Filing Info

• Accession Number: 00498568
• Record Type: Publication
• Source Agency: Transport and Road Research Laboratory (TRRL)
• Files: ITRD, TRIS
• Created Date: Sep 30 1990 12:00AM