Benedikt Skulason, Lucas Van Drunen.  A branch of the general staff scheduling problem.  However, staffing problems within hospitals are particularly.

Slides:



Advertisements
Similar presentations
Crew Pairing Optimization with Genetic Algorithms
Advertisements

Population-based metaheuristics Nature-inspired Initialize a population A new population of solutions is generated Integrate the new population into the.
Genetic Algorithms.
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
1 IOE/MFG 543 Chapter 14: General purpose procedures for scheduling in practice Section 14.5: Local search – Genetic Algorithms.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Genetic algorithms for neural networks An introduction.
Evolutionary Computation Introduction Peter Andras s.
Cornell Fitness Centers (CFC) Scheduling System Darrell Wilson and Drew McElhare Nick Gerner, Evan Junek, Jonathan Lyons, Greg Poucher.
Genetic Algorithm for Variable Selection
Intro to AI Genetic Algorithm Ruth Bergman Fall 2002.
An indirect genetic algorithm for a nurse scheduling problem Ya-Tzu, Chiang.
Genetic Algorithms Nehaya Tayseer 1.Introduction What is a Genetic algorithm? A search technique used in computer science to find approximate solutions.
An Evolutionary Approach To Space Layout Planning Using Genetic Algorithm By: Hoda Homayouni.
Chapter 6: Transform and Conquer Genetic Algorithms The Design and Analysis of Algorithms.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Genetic Algorithm.
SOFTWARE TESTING STRATEGIES CIS518001VA : ADVANCED SOFTWARE ENGINEERING TERM PAPER.
SOFT COMPUTING (Optimization Techniques using GA) Dr. N.Uma Maheswari Professor/CSE PSNA CET.
Solving the Concave Cost Supply Scheduling Problem Xia Wang, Univ. of Maryland Bruce Golden, Univ. of Maryland Edward Wasil, American Univ. Presented at.
Intro. ANN & Fuzzy Systems Lecture 36 GENETIC ALGORITHM (1)
Optimization in Engineering Design Georgia Institute of Technology Systems Realization Laboratory Mixed Integer Problems Most optimization algorithms deal.
By Prafulla S. Kota Raghavan Vangipuram
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
Genetic algorithms Charles Darwin "A man who dares to waste an hour of life has not discovered the value of life"
More on Heuristics Genetic Algorithms (GA) Terminology Chromosome –candidate solution - {x 1, x 2,...., x n } Gene –variable - x j Allele –numerical.
1/27 Discrete and Genetic Algorithms in Bioinformatics 許聞廉 中央研究院資訊所.
1 Chapter 14 Genetic Algorithms. 2 Chapter 14 Contents (1) l Representation l The Algorithm l Fitness l Crossover l Mutation l Termination Criteria l.
GENETIC ALGORITHMS.  Genetic algorithms are a form of local search that use methods based on evolution to make small changes to a popula- tion of chromosomes.
Richard Patrick Greer.  The Neonatal ICU in Providence Alaska Medical Center would like a scheduling system to assign nurses to babies based on numerous.
Learning by Simulating Evolution Artificial Intelligence CSMC February 21, 2002.
C OMPARING T HREE H EURISTIC S EARCH M ETHODS FOR F UNCTIONAL P ARTITIONING IN H ARDWARE -S OFTWARE C ODESIGN Theerayod Wiangtong, Peter Y. K. Cheung and.
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.
For Wednesday Read chapter 6, sections 1-3 Homework: –Chapter 4, exercise 1.
For Wednesday Read chapter 5, sections 1-4 Homework: –Chapter 3, exercise 23. Then do the exercise again, but use greedy heuristic search instead of A*
Chapter 12 FUSION OF FUZZY SYSTEM AND GENETIC ALGORITHMS Chi-Yuan Yeh.
EE749 I ntroduction to Artificial I ntelligence Genetic Algorithms The Simple GA.
Robot Intelligence Technology Lab. Generalized game of life YongDuk Kim.
Waqas Haider Bangyal 1. Evolutionary computing algorithms are very common and used by many researchers in their research to solve the optimization problems.
GENETIC ALGORITHM Basic Algorithm begin set time t = 0;
Innovative and Unconventional Approach Toward Analytical Cadastre – based on Genetic Algorithms Anna Shnaidman Mapping and Geo-Information Engineering.
Genetic algorithms: A Stochastic Approach for Improving the Current Cadastre Accuracies Anna Shnaidman Uri Shoshani Yerach Doytsher Mapping and Geo-Information.
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.
The Implementation of Genetic Algorithms to Locate Highest Elevation By Harry Beddo.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Overview Last two weeks we looked at evolutionary algorithms.
1 Comparative Study of two Genetic Algorithms Based Task Allocation Models in Distributed Computing System Oğuzhan TAŞ 2005.
S TRATEGIC C HANGE P RESENTATION S ELF -S CHEDULING By RitaAnn Robinson.
Genetic Algorithms. Solution Search in Problem Space.
Genetic Algorithms And other approaches for similar applications Optimization Techniques.
 Presented By: Abdul Aziz Ghazi  Roll No:  Presented to: Sir Harris.
Genetic (Evolutionary) Algorithms CEE 6410 David Rosenberg “Natural Selection or the Survival of the Fittest.” -- Charles Darwin.
1 Genetic Algorithms Contents 1. Basic Concepts 2. Algorithm 3. Practical considerations.
Genetic Algorithm (Knapsack Problem)
Chapter 14 Genetic Algorithms.
Genetic Algorithms.
Introduction to Genetic Algorithm (GA)
Artificial Intelligence (CS 370D)
Example: Applying EC to the TSP Problem
Learning Intention I will learn about testing programs.
Population Based Metaheuristics
GA.
Presentation transcript:

Benedikt Skulason, Lucas Van Drunen

 A branch of the general staff scheduling problem.  However, staffing problems within hospitals are particularly challenging because of the following: ◦ Variations in staffing requirements between different shifts within the day (e.g. day/evening/night-shift specific activities) ◦ Variations in staffing requirements between different days (e.g. based on schedules from the operating room, etc.) ◦ The extreme importance of maintaining an acceptable service level at all times.

 Determine staffing requirement ◦ Average census ◦ Average case severity ◦ Gov’t and hospital regulations  Build the schedule ◦ Assign nurses to shifts subject to constraints

 How to achieve feasible nursing schedules?  How to maintain schedule feasibility in case of unexpected events?  Are academic methods of nurse scheduling used in the real world?

“Preference scheduling for nurses using column generation” Jonathan F. Bard, Hadi W. Purnomo, 2003.

 Blank schedule posted with: ◦ Deadline ◦ Required staffing level ◦ Other constraints: minimum number of experienced nurses, etc.  After deadline, manager may need to rework schedule to achieve required coverage

Genetic Algorithm for creating schedules similar to a given base schedule Step 1: Initial individuals (schedules) are generated by a random permutation of each individual’s two chromosomes. Chromosome 1: A list of tasks. Chromosome 2: The ordering of nurses associated with the tasks. Step 2: The current individuals are mated randomly and crossovers and mutations are applied to them, creating offspring. Step 3: Each individual’s fitness is evaluated (feasibility & similarity). Step 4: The fittest individual is moved to the next generation. Step 5: Remaining individuals for the next generation are chosen by the roulette wheel method, with likelihood proportional to their fitness. Step 6: If a predefined stopping criteria is satisfied, stop, otherwise we go back to step 2.

 Many researchers have stated intentions of their work being implemented  Few models actually make the jump to implementations  Causes: ◦ Narrow focus ◦ Customer support ◦ Proprietary concerns ◦ Nursing acceptance: lack of flexibility, “black-box” perception

 Staffing requirement from: average census, average care level  Self-scheduling used to build schedule  Non-unionized nurses  Role of software

 There is a need for scheduling methods that interface with the real world  The preferential IP method attempts this  Benefits: ◦ Avoids the “black-box” syndrome ◦ Avoids conflicts from exercising seniority or playing favorites