LaRisa Sergent Jeff Sorenson University of Oklahoma School of Chemical, Biological, and Materials Engineering April 29 th, 2008.

Slides:



Advertisements
Similar presentations
© Negnevitsky, Pearson Education, Lecture 9 Evolutionary Computation: Genetic algorithms Introduction, or can evolution be intelligent? Introduction,
Advertisements

Operations Management Maintenance and Reliability Chapter 17
New Micro Genetic Algorithm for multi-user detection in WCDMA AZMI BIN AHMAD Borhanuddin Mohd Ali, Sabira Khatun, Azmi Hassan Dept of Computer and Communication.
Operations Management
Simulation-based Optimization for Supply Chain Design INRIA Team April 7, 2004 Torino-Italy.
1 SMS – Spares Management Software Overview and Case Studies.
Maintenance Planning and Control : Modeling and Analysis
Operations Management
MA Metal Finishing Forum Tools and Techniques for Optimizing Metal Finishing Process/Environmental MA Metal Finishing Forum Kevin L. Klink, P.E.
Reliability McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Genetic Algorithms Genetic algorithms imitate natural optimization process, natural selection in evolution. Developed by John Holland at the University.
Von Karman Institute for Fluid Dynamics RTO, AVT 167, October, R.A. Van den Braembussche von Karman Institute for Fluid Dynamics Tuning of Optimization.
Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Managing Capacity.
Capacity and Constraint Management
Local Search Algorithms
10b.1 Van Horne and Wachowicz, Fundamentals of Financial Management, 13th edition. © Pearson Education Limited Created by Gregory Kuhlemeyer. Chapter.
Chapter 15: Quantitatve Methods in Health Care Management Yasar A. Ozcan 1 Chapter 15. Simulation.
9. Two Functions of Two Random Variables
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Constraint Optimization We are interested in the general non-linear programming problem like the following Find x which optimizes f(x) subject to gi(x)
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Exact and heuristics algorithms
Student : Mateja Saković 3015/2011.  Genetic algorithms are based on evolution and natural selection  Evolution is any change across successive generations.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
SMJ 4812 Project Mgmt and Maintenance Eng.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Maintenance Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill.
S. Mohsen Sadatiyan A., Samuel Dustin Stanley, Donald V. Chase, Carol J. Miller, Shawn P. McElmurry Optimizing Pumping System for Sustainable Water Distribution.
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Universidad de los Andes-CODENSA The Continuous Genetic Algorithm.
Cristian Urs and Ben Riveira. Introduction The article we chose focuses on improving the performance of Genetic Algorithms by: Use of predictive models.
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
Genetic Algorithms Michael J. Watts
Boltzmann Machine (BM) (§6.4) Hopfield model + hidden nodes + simulated annealing BM Architecture –a set of visible nodes: nodes can be accessed from outside.
Presentation on Preventive Maintenance
GENETIC ALGORITHM A biologically inspired model of intelligence and the principles of biological evolution are applied to find solutions to difficult problems.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
Maintenance McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
CS 8625 High Performance Computing Dr. Hoganson Copyright © 2003, Dr. Ken Hoganson CS8625 Class Will Start Momentarily… CS8625 High Performance.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Maintainance and Reliability Pertemuan 26 Mata kuliah: J Manajemen Operasional Tahun: 2010.
1 Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations Genetic Algorithm (GA)
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Genetic Algorithm Dr. Md. Al-amin Bhuiyan Professor, Dept. of CSE Jahangirnagar University.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
►Search and optimization method that mimics the natural selection ►Terms to define ٭ Chromosome – a set of numbers representing one possible solution ٭
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
Genetic Algorithm(GA)
Genetic Algorithm. Outline Motivation Genetic algorithms An illustrative example Hypothesis space search.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Hirophysics.com The Genetic Algorithm vs. Simulated Annealing Charles Barnes PHY 327.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Maintenance strategies
MAINTENANCE ENGINEERING
PREVENTIVE MAINTENANCE By: Mary Solomon Inyang. DEFINITIONS Preventive maintenance refers to regular, routine maintenance to help keep equipment up and.
Operations Management
Operations Management
Boltzmann Machine (BM) (§6.4)
Operations Management
Definitions Cumulative time to failure (T): Mean life:
Presentation transcript:

LaRisa Sergent Jeff Sorenson University of Oklahoma School of Chemical, Biological, and Materials Engineering April 29 th, 2008

Systematic inspection, detection, and correction of failures either before they occur or before they develop into major defects. Preventative maintenance (PM) - tests, measurements, adjustments, and parts replacements which prevent faults from occurring. Corrective maintenance (CM) - care and servicing of failed or damaged equipment to return to satisfactory operating condition.

Favors constant preventative maintenance. Economic trade-offs Cost of labor Loss of product Replacement costs Downtime for PM How much preventative maintenance is economically optimal? 30%-50% of a plants operating budget Goals of maintenance scheduling maximize safety minimize total cost

Parameters to be manipulated Spare parts policy Frequency of preventative maintenance Labor resources Objective function to be minimized: Total maintenance costs (PM + CM) Total economic loss

PM takes place on regular intervals (fraction of MTBF) Time to complete diagnosis of failure negligible All workers perform every maintenance task Equipment failures prioritized by severity Emergencies take precedence over scheduled maintenance Parts not on hand arrive in no more than a week Repaired equipment is deemed as good as new

Samples failure rate of the equipment and the probability of each failure mode (i.e. electrical, mechanical, etc.) Associated cost of each failure is calculated Man hours are assigned first to each needed CM, then to scheduled PM When the man hours for the week are expended, no more maintenance takes place Average total cost is determined for a large number of samples (10,000)

Tennessee Eastman plant – 19 pieces of equipment Time horizon – 2 years Results of optimization Labor: 3 Inventory: some PM frequency: 1 x MTBF Average objective value for no PM and no resource limitations was $1.66 million

Risk analysis Total cost versus probability of incidence Consider Value at Risk in addition to Average Total Cost Model applied to larger process New values determined for: Optimal labor force Optimal PM interval Genetic algorithm applied to larger process All variables manipulated simultaneously

FCC– 153 pieces of equipment 31 pumps (29 with spares) 2 compressors 4 heaters 87 heat exchangers 15 vessels (drums, accumulators, etc.) 1 catalytic reactor and associated regenerator 12 separation columns Auxiliary systems not considered in the optimization: cooling water system, waste system, steam system, etc. Time horizon – 10 years

Pumps Those with spares do not incur economic loss upon failing. PM is done on spare following CM on main pump, and the cost is included in the CM cost. The TNCM includes time for PM on the spare. Columns Two main columns – if one fails, the other begins running at max capacity.

Vessels and tanks Failure results in loss of throughput for that tank only; rest of the product throughput is not lost. Heat exchangers Failure reduces efficiency of the process. Being repaired HE can be bypassed. Bypassed HE causes loss in product relative to the portion of heat duty lost. Reactors and compressors Failure results in total throughput lost.

Monte Carlo simulation data (aka. The woes and misfortunes of Excel)

Cost of labor: $40,000/year/worker

Less risk of high costs Higher average total cost

Distribution (i.e. shape of the curves) doesnt change. No trade-off between risk and average total cost.

Try another type of risk analysis… If at first you don't succeed… ENGINEER

Objective – Establish a fitness function to consider value at risk (VAR) in addition to average total cost. Purpose – Determine optimal PM conditions that balance trade-off between Low average total cost Lower probability of high economic loss Form: f = ATC + xVAR, 0 x 1 VAR is the difference between ATC and the cost defining 95% or less probability.

Changes in VAR are insignificant compared to magnitude of ATC. Result: fitness function parallels ATC.

Optimal labor force: 5 workers Actual number employed by refinery for FCC: 5 Optimal PM interval 1.7x MTBF Fitness function Same results weighing VAR in with ATC Average objective function with no PM $6.34 million per year

Evaluate a specific component at varied PM interval by simulations with all other PM schedules constant. Determine optimal PM frequency for the chosen component. Lower average cost Lower probability of high economic loss Run optimized simulation using optimal value for each specific component. Compare values of economic loss to those obtained using a single x-factor to vary overall PM frequency.

Evaluates multiple variables simultaneously. Each variable becomes a gene on the maintenance model chromosome. A population of chromosomes is randomly generated. Each chromosome (model) is evaluated to determine its fitness in comparison to others in the population. More fit chromosomes more likely to reproduce and continue to exist in new generations. Crossover and mutation exist.

Parents chosen randomly from reproduction pool Offspring are identical to parents UNLESS Crossover occurs: offspring swap one gene. (random) Mutation occurs: offspring has one gene (random) replaced with a new value. Crossover and mutation prevent premature convergence Reduce likelihood of optimizing to a local minimum. Fitness of parents and offspring evaluated. Best chromosome automatically enters new generation

Operation of Genetic Algorithm Define range of values for parameter generation. PM intervals set between 0.5 and 1.6 for non-interfering pieces of equipment. PM intervals set between 0.3 and 1.1 for interfering pieces of equipment. Specify population size, crossover probability, mutation probability, and number of generations. Complication: Each generation takes minutes to evaluate. Running the algorithm literally takes days.

Genetic Algorithm Conditions: 8 parameters (7 equipment groups, labor) 2 variables per parameter (PM interval, initial PM time) Population size: 40 Iterations (# of generations): 40 ( ~2 day run time ) Crossover probability: 100% Mutation probability: 30%

Variable Category Run 1Run 2 initial time PM frequency initial time PM frequency Group 1 (pumps) Group 2 (compressors) Group 3 (heaters) Group 4 (exchangers) Group 5 (vessels) Group 6 (reactor/regenerator) Group 7 (columns) Labor54 Average Total Cost$5,403,620$5,590,003 Issues with Results: Different optimal values No common terms between optimal solutions Greater Convergence Required!

Improving the Algorithm: Reduce number of equipment groups Combine similar equipments in same groups Fewer groups (5 instead of 7) Change range of PM intervals for parameters Remove low values shown to be inefficient in Monte Carlo Simulations Change Labor Cost to $100,000/unit Information provided by plant w/ FCC unit. Faster evaluation and convergence Allow for more generations (200, max.)

Variable Category Run 1Run 2Run 3 initial time PM frequency initial time PM frequency initial time PM frequency Group 1 (pumps) Group 2 (compressors) Group 3 (heaters & exchangers) Group 4 (vessels) Group 5 (reactors & columns) Labor454 Iterations to Convergence* Average Total Cost$5,767,811$5,786,233$5,756,541 Average Value: $5,770,195 Standard Deviation: $14989 (0.26%) * GA is considered to converged after 50 iterations without finding a more optimal value

Separate equipment groups for more optimal PM interval of each component. Longer computation time required for each generation Slower convergence to optimal PM policy Modify mutation and crossover probability to reduce risk of local minimums being found as optimal solutions. More generations required for convergence to optimal policy Refine data used in analysis More accurate, process-specific data will increase value of PM solutions obtained by algorithm.

Optimal Preventative Maintenance Scheduling in Process Plants Thank you.