Refinery scheduling of incoming crude oil using a genetic algorithm

• US 6,785,662 B1
• Filed: 04/03/2002
• Issued: 08/31/2004
• Est. Priority Date: 05/04/2001
• Status: Expired due to Fees

• Current Assignee: UOP Llc (Honeywell International Inc.)
• Original Assignee: UOP Llc (Honeywell International Inc.)
• Inventors: Nelson, E. Cole Jr., Guy, R. Kirk
• Primary Examiner(s): Davis, George B.
• Application Number:
  US10/116,617
• Time in Patent Office: 881 Days
• Field of Search: 706/13, 702/13
• US Class Current: 706/13
• CPC Class Codes: G06N 3/126 Evolutionary algorithms, e.g. genetic algorithms or genetic programming

Abstract

A method of forming a schedule of crude oil shipments being received at a refinery facility using a genetic algorithm has been developed. A period of time, T, within which the crude oil shipment schedule is to be formed is determined. A first generation of chromosomes is generated and a fitness function value calculated for each chromosome. A succeeding generation of chromosomes is created using a genetic algorithm and the fitness function value for each chromosome is determined. The steps of producing a succeeding generation of chromosomes using a genetic algorithm and determining a fitness function value for each chromosome are repeated for time T. The chromosome having the highest fitness function value within time T is identified to generate the schedule.

Claims

1. A method of forming a schedule of crude oil shipments being received at a refinery facility comprising the steps of:

a) determining a period of time, T, within which the crude oil shipment schedule is to be formed;

b) identifying the goals of the crude oil shipment schedule;

c) identifying the variable parameters associated with the crude oil shipments to the refinery facility;

d) identifying the constraints associated with the crude oil shipments to the refinery facility;

e) determining a fitness function in accordance with the goals of the schedule, the variable parameters and the constraints;

f) randomly generating a first generation of chromosomes, each chromosome in the generation representing a possible solution;

g) determining a fitness function value for each of the chromosomes using the fitness function;

h) producing a succeeding generation of chromosomes using a genetic algorithm and determining a fitness function value for each of the chromosomes using the fitness function;

i) repeating the acts of producing a succeeding generation of chromosomes using a genetic algorithms and determining a fitness function value for each of the chromosomes in the succeeding generation, and

j) identifying the chromosome having the highest fitness function value within time T to form the schedule of crude oil shipments.

2. The method of claim 1 wherein the goals are selected from the group consisting of maximizing efficiency, maximizing product value, minimizing costs, or a combination thereof.

3. The method of claim 1 wherein the variable parameters are selected from the group consisting of which berth is selected, the amount of time for unloading the crude oil, the length of time to keep a vessel moored, which storage location to route the crude oil to, and combinations thereof.

4. The method of claim 1 wherein the constraints are selected from the group consisting of number of berths, size of the vessels, amount of crude oil in the vessel, type of crude oil in the vessel, equipment available at each mooring site, the storage facilities available, the product quality of the refinery product, contaminate limits in the crude oil, demurrage charges associated with a vessel, and combinations thereof.