Ville Mattila and Kai Virtanen Systems Analysis Laboratory,

Slides:



Advertisements
Similar presentations
Crew Pairing Optimization with Genetic Algorithms
Advertisements

Hadi Goudarzi and Massoud Pedram
Unit III Module 6 - Developing Age Exploration Tasks
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
1 Research Topics Group: Professor Raimo P. Hämäläinen Graduate School Seminar University of Jyväskylä.
 1  Outline  Model  problem statement  detailed ARENA model  model technique  Output Analysis.
1 S ystems Analysis Laboratory Helsinki University of Technology A Simulation Model for Aircraft Maintenance in an Uncertain Operational Environment Ville.
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
1 Lecture 8: Genetic Algorithms Contents : Miming nature The steps of the algorithm –Coosing parents –Reproduction –Mutation Deeper in GA –Stochastic Universal.
Regression Analysis. Unscheduled Maintenance Issue: l 36 flight squadrons l Each experiences unscheduled maintenance actions (UMAs) l UMAs costs $1000.
Case Injected Genetic Algorithms Sushil J. Louis Genetic Algorithm Systems Lab (gaslab) University of Nevada, Reno
INDUSTRIAL & SYSTEMS ENGINEERING
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Artificial Intelligence Genetic Algorithms and Applications of Genetic Algorithms in Compilers Prasad A. Kulkarni.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
SYSTEMS ANALYSIS LABORATORY HELSINKI UNIVERSITY OF TECHNOLOGY A Simulation Model for Military Aircraft Maintenance and Availability Tuomas Raivio, Eemeli.
Slide - 1 Dr Terry Hinton 6/9/05UniS - Based on Slides by Micro Analysis & Design An example of a Simulation Simulation of a bank: Three tasks or processes:
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Package Transportation Scheduling Albert Lee Robert Z. Lee.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Tuomas Raivio, and Raimo P. Hämäläinen Systems Analysis Laboratory (SAL)
Operations Management Maintenance and Reliability 保養維護與可靠程度 Chapter 17
MIT ICAT ICATMIT M I T I n t e r n a t i o n a l C e n t e r f o r A i r T r a n s p o r t a t i o n Virtual Hubs: A Case Study Michelle Karow
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Raimo P. Hämäläinen and Ville Mattila Systems Analysis Laboratory Helsinki.
Classroom Utilization Capacity Management Study: Findings and Next Steps Doug Swink Registrar Tuesday, December 7, 2010.
1 S ystems Analysis Laboratory Helsinki University of Technology A Simulation Model for Aircraft Maintenance in an Uncertain Operational Environment Ville.
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
1 S ystems Analysis Laboratory Helsinki University of Technology Scheduling Periodic Maintenance of Aircraft through simulation-based optimization Ville.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Tuomas Raivio and Raimo P. Hämäläinen Systems Analysis Laboratory Helsinki.
1 A New Method for Composite System Annualized Reliability Indices Based on Genetic Algorithms Nader Samaan, Student,IEEE Dr. C. Singh, Fellow, IEEE Department.
1 S ystems Analysis Laboratory Helsinki University of Technology Flight Time Allocation Using Reinforcement Learning Ville Mattila and Kai Virtanen Systems.
1 S ystems Analysis Laboratory Helsinki University of Technology Kai Virtanen, Janne Karelahti, Tuomas Raivio, and Raimo P. Hämäläinen Systems Analysis.
S ystems Analysis Laboratory Helsinki University of Technology Automated Solution of Realistic Near-Optimal Aircraft Trajectories Using Computational Optimal.
Kanpur Genetic Algorithms Laboratory IIT Kanpur 25, July 2006 (11:00 AM) Multi-Objective Dynamic Optimization using Evolutionary Algorithms by Udaya Bhaskara.
Chapter5: Evaluating Hypothesis. 개요 개요 Evaluating the accuracy of hypotheses is fundamental to ML. - to decide whether to use this hypothesis - integral.
Genetic Algorithms Genetic algorithms provide an approach to learning that is based loosely on simulated evolution. Hypotheses are often described by bit.
Genetic Algorithms What is a GA Terms and definitions Basic algorithm.
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.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Rounding scheme if r * j  1 then r j := 1  When the number of processors assigned in the continuous solution is between 0 and 1 for each task, the speed.
1 S ystems Analysis Laboratory Helsinki University of Technology Manuscript “On the Use of Influence Diagrams in a One-on-One Air Combat Game” in Kai Virtanen’s.
Capacity Planning Pertemuan 04
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
S ystems Analysis Laboratory Helsinki University of Technology Game Theoretic Validation of Air Combat Simulation Models Jirka Poropudas and Kai Virtanen.
Authors: Soamsiri Chantaraskul, Klaus Moessner Source: IET Commun., Vol.4, No.5, 2010, pp Presenter: Ya-Ping Hu Date: 2011/12/23 Implementation.
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.
Distributed Control and Autonomous Systems Lab. Sang-Hyuk Yun and Hyo-Sung Ahn Distributed Control and Autonomous Systems Laboratory (DCASL ) Department.
Genetic Algorithm(GA)
O PTIMAL R EPLACEMENT AND P ROTECTION S TRATEGY FOR P ARALLEL S YSTEMS R UI P ENG, G REGORY L EVITIN, M IN X IE AND S ZU H UI N G Adviser: Frank, Yeong-Sung.
Presented By: Farid, Alidoust Vahid, Akbari 18 th May IAUT University – Faculty.
Evolutionary Computation Evolving Neural Network Topologies.
A MapReduced Based Hybrid Genetic Algorithm Using Island Approach for Solving Large Scale Time Dependent Vehicle Routing Problem Rohit Kondekar BT08CSE053.
Genetic Algorithms.
OPERATING SYSTEMS CS 3502 Fall 2017
Balancing of Parallel Two-Sided Assembly Lines via a GA based Approach
Facility Logistics Simulation at a Large Retailer
A Modeling Framework for Flight Schedule Planning
Air Carrier Continuing Analysis and Surveillance System (CASS)
Operations Management
Metaheuristic methods and their applications. Optimization Problems Strategies for Solving NP-hard Optimization Problems What is a Metaheuristic Method?
Operations Management
Behavior Modification Report with Peak Reduction Component
Outline System architecture Current work Experiments Next Steps
Production and Operations Management
Systems Analysis Laboratory Helsinki University of Technology
Case Injected Genetic Algorithms
GA.
Presentation transcript:

A Simulation-Based Optimization Model to Schedule Periodic Maintenance of a Fleet of Aircraft Ville Mattila and Kai Virtanen Systems Analysis Laboratory, Helsinki University of Technology

Contents Scheduling the periodic maintenance (PM) of the aircraft fleet of the Finnish Air Force (FiAF) Objective of scheduling: Improve aircraft availability A simulation-based optimization model for the scheduling task A discrete-event simulation model A genetic algorithm

Aircraft usage and maintenance Different forms of pilot and tactical training A number of aircraft chosen each day to flight duty Several missions during one day Failure repairs Unplanned Periodic maintenance Based on usage Different level maintenance facilities

Periodic maintenance of a Hawk Mk51 training aircraft Type of PM task Maintenance interval (flight hours) Average duration (hours) Maintenance level C 50 10 Organizational level (O-level), Squadron D1, D2 125 to 250 75 to 200 Intermediate level (I-level), Air command’s repair shop E, F, G 500 to 2000 300 to 500 Depot level (D-level), Industrial repair shop

Periodic maintenance scheduling Difficulty: starting times of PM can not be assigned with certainty Aircraft usage is affected by failures and subsequent repairs Working principle: PM schedule governs the selection of aircraft to flight duty Each aircraft is assigned an index value based on the ratio: flight hours to maintenance / time to maintenance The aircraft with the highest indices get selected to flight duty The schedule represents targeted starting times of PM tasks

The maintenance scheduling problem N the total number of aircraft X=(x1,1,...,x1,n1,...,xN,1,...,xN,nN) the maintenance schedule of the fleet L simulated average aircraft availability  sample path

Further assumptions Aircraft usage is limited by the flight operations plan PM may be conducted within the window of usage time defined in the PM program of the aircraft Failures can preclude aircraft from flight duty, a failed aircraft may not be flown until it has been repaired Maintenance facilities have a limited capacity

The simulation optimization model A discrete-event simulation model Describes aircraft usage and maintenance Evaluates aircraft availability related to a given candidate solution, i.e., a maintenance schedule A genetic algorithm Produces new candidate solutions utilizing the simulated availabilities

The simulation model No maintenance or repair need Check for failures and periodic maintenance need Turnaround or pre-flight inspection Mission O-level maintenance I-level maintenance D-level maintenance Need for periodic maintenance or failure repair No maintenance or repair need

The genetic algorithm (GA) Real-coded GA Binary tournament selection for reproduction of solutions Simulated binary crossover in crossover operation Mutation based on normal distribution Constraints handled by biasing infeasible solutions relative to the amount of constraint violation

An example case Number of aircraft 16 Length of planning period 260 days Scheduled maintenance tasks per aircraft 4 Number of aircraft in daily flight duty Number of daily flights per aircraft O-level maintenance capacity 1 aircraft I-level maintenance capacity 3 aircraft D-level maintenance capacity 2 aircraft

Optimization results

The performance of the model The simulation-optimization model produces viable maintenence schedules The best example solution has an average aircraft availability of 0.72 This level of availability is obtained with 1200 simulation model evaluations using random initial solutions

How good is the solution? Simulation output for evaluating the quality of the solution Queing times at maintenance facilities Indicate the maximum amount of improvement obtainable by means of scheduling In the example case, queuing is almost entirely eliminated The timely development of aircraft availability illustrates the impact of an efficient solution

Scheduling vs. no scheduling in the example case

Future work Ranking and selection procedures in comparison of candidate solutions to enhance the efficiency of optimization Extensions to the example case: Different patterns of flight activity Time varying resource availability Larger fleet sizes Implementation of the model as a design-tool for maintenance designers