ALGORITHMS FOR MINIMIZING TOTAL COST, BOTTLENECK TIME AND BOTTLENECK SHIPMENT IN TRANSPORTATION PROBLEMS

The paper considers the transportation problem of determining nonnegative shipments from a set of m warehouses with given availabilities to a set of n markets with given requirements. Three objectives are defined for each solution: total cost, TC; bottleneck time, BT (i.e. maximum transportation time for a positive shipment); and bottleneck shipment, SB (i.e., total shipment over routes with bottleneck time). An algorithm is given for determining all efficient (pareto-optimal or nondominated) (TC, BT) solution pairs. The special case of this algorithm when all the unit cost coefficients are zero is shown to be the same as the algorithms for minimizing BT provided by Szwarc and Hammer. The algorithm is extended to provide not only all the efficient (TC, SB) solution pairs but also, for each such BT, all the efficient (TC, SB) solution pairs.

• Corporate Authors:

  Office of Naval Research

  Department of the Navy, 800 North Quincy Street
  Arlington, VA  United States  22217
• Authors:
  • Srinivasan, V
  • Thompson, G L
• Publication Date: 1976-12

Media Info

• Features: References;
• Pagination: p. 567-595
• Serial:
  • Naval Research Logistics Quarterly
  • Volume: 23
  • Issue Number: 4
  • Publisher: Department of the Navy

Subject/Index Terms

• TRT Terms: Algorithms; Analysis; Costs; Linear programming; Management science; Mathematical models; Operations; Physical distribution; Planning; Programming (Mathematics); Transportation; Transportation planning
• Uncontrolled Terms: Assignment problems; Cost analysis; Transportation problems
• Old TRIS Terms: Operations planning
• Subject Areas: Administration and Management; Planning and Forecasting; Transportation (General);

Filing Info

• Accession Number: 00156908
• Record Type: Publication
• Source Agency: Engineering Index
• Files: TRIS
• Created Date: Aug 4 1977 12:00AM