A TENTATIVE PROPOSAL FOR A SHIPPING PLAN OF BULK PETROLEUM PRODUCTS BY SEA-GOING TANKERS.
Themis optimization research program,
TEXAS A AND M UNIV COLLEGE STATION INST OF STATISTICS
Pagination or Media Count:
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 pth type product from the ith source to the jth destination in the tth 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 pth product shipped to all destinations in all time periods on all types of ships cannot exceed the amount available at the ith 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 type 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.
- Operations Research
- Marine Engineering
- Logistics, Military Facilities and Supplies