In the study, an ocean shipping problem in fuel transportation is formulated mathematically as a two-stage cost minimization problem. Linear programming methods are used in the first stage to find the cheapest way to ship the ( p )th type product from the ( i )th source to the ( j )th destination in the ( t )th period by a ship of type s. In the second stage, a tanker cargo algorithm is developed to satisfy cargo composition requirements and routing considerations. In the model, the objective is to minimize, subject to constraints, the purchase and shipping costs of all the fuels transported from all the sources to all the destinations in all of the time periods. Product requirements of all types at all destinations must be fulfilled. The amount of the ( p )th product shipped to all destinations in all time periods on all types of ships cannot exceed the amount available at the ( i )th source. There are three sets of shipping restrictions: (1) Shipments of type s to all destinations of all products cannot exceed the shipping capacity of that type available at source i in time period t; (2) the shipments in (1) in all time periods cannot exceed the shipping capacity of types s at source i (available in all time periods); and (3) the shipments in (2) originating from all sources cannot exceed the available shipping capacity of type s. exceed the available shipping capacity of type s.

  • Corporate Authors:

    Texas A&M University, College Station

    College Station, TX  United States  77840
  • Authors:
    • HARTLEY, H O
    • George, M D
    • Thompson, Russell G
    • McKay, M D
  • Publication Date: 1970-1

Media Info

  • Pagination: 37 p.

Subject/Index Terms

Filing Info

  • Accession Number: 00007009
  • Record Type: Publication
  • Source Agency: National Technical Information Service
  • Files: TRIS
  • Created Date: Nov 25 1971 12:00AM