Improving Emergency Medical Dispatching with Emphasis on Mass-Casualty Incidents



Similar documents
VEHICLE ROUTING PROBLEM

Vehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1

IST 301. Class Exercise: Simulating Business Processes

Constraint Programming for the Vehicle Routing Problem. Philip Kilby

Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming

The vehicle routing problem with time windows is a hard combinatorial optimization problem that has

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows

Online vehicle routing and scheduling with continuous vehicle tracking

Airport logistics - A case study of the turnaround

Cost Models for Vehicle Routing Problems Stanford Boulevard, Suite 260 R. H. Smith School of Business

A Staffing Algorithm for Call Centers with Skill-Based Routing

Production Planning Solution Techniques Part 1 MRP, MRP-II

Monitoring Pramati EJB Server

A hybrid approach for solving real-world nurse rostering problems

Research Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok

On the Technician Routing and Scheduling Problem

Load Balancing. Load Balancing 1 / 24

QoS optimization for an. on-demand transportation system via a fractional linear objective function

Models for Ambulance Planning on the Strategic and the Tactical Level

Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times

Fleet Management Optimisation

Regrets Only! Online Stochastic Optimization under Time Constraints

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

Earliest Due Date (EDD) [Ferrari] Delay EDD. Jitter EDD

A Library of Local Search Heuristics for the Vehicle Routing Problem

Integer Programming: Algorithms - 3

Charles Fleurent Director - Optimization algorithms

Managing End-to-end Network performance via. Optimized Monitoring Strategies

Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry

LOCATION OF HEALTH CARE FACILITIES

HOME HEALTH CARE LOGISTICS PLANNING

Optimizing departure times in vehicle routes

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms

A Decision Support System for the Assessment of Higher Education Degrees in Portugal

Routing and Technology

An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem

Ant Colony Optimization (ACO)

Finding Liveness Errors with ACO

UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES

FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION

APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION

On the Impact of Real-Time Information on. Field Service Scheduling. Ioannis Petrakis, Christian Hass, Martin Bichler 1

M. Sugumaran / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (3), 2011,

A Hybrid Heuristic Method for the Compressed Natural Gas (CNG) Truck Routing Problem with Fueling Stations. I-NUF 2015, Long Beach

More Local Structure Information for Make-Model Recognition

EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks

Collaborative Transportation Planning of Less-Than-Truckload Freight: Request Exchange through a Route-based Combinatorial Auction

Is Truck Queuing Productive? Study of truck & shovel operations productivity using simulation platform MineDES

6.852: Distributed Algorithms Fall, Class 2

Metaheuristics for the consistent nurse scheduling and routing problem.

Joint Ground and Air Emergency Medical Services Coverage Models: A Greedy Heuristic Solution Approach. Revised: December 2009

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem

Direct Integration: Training Software Developers and Designers to Conduct Usability Evaluations

MISSING DATA IMPUTATION IN CARDIAC DATA SET (SURVIVAL PROGNOSIS)

Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows

FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM

A CP Scheduler for High-Performance Computers

A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows

Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows

Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods

An Improved ACO Algorithm for Multicast Routing

BTS Backhaul by Satellite

An Energy-aware Multi-start Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution

Agenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers

Optimization of patient transport dispatching in hospitals

Load balancing in a heterogeneous computer system by self-organizing Kohonen network

Dynamic Relocation of Emergency Ambulance Vehicles Using the AVL Component of the GPS/GPRS Tracking System

RIGHT TECHNICIAN, RIGHT PLACE, RIGHT TIME, SO WHAT? A Mobile Workforce Management ebook

SPLIT PLOT DESIGN 2 A 2 B 1 B 1 A 1 B 1 A 2 B 2 A 1 B 1 A 2 A 2 B 2 A 2 B 1 A 1 B. Mathematical Model - Split Plot

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

Dynamic Vehicle Routing in MATSim

A Simple Method to Forecast Travel Demand in Urban Public Transport

Have you reported the defect? Reference No.* FR. Date of Incident / / Time of Incident am/pm

R u t c o r Research R e p o r t. A Method to Schedule Both Transportation and Production at the Same Time in a Special FMS.

vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK

Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand

Appendix of: Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem

Optimal Vehicle Routing and Scheduling with Precedence Constraints and Location Choice

Report: Google Data center Scheduling

Research Article Scheduling IT Staff at a Bank: A Mathematical Programming Approach

Revenue Management for Transportation Problems

Asking Hard Graph Questions. Paul Burkhardt. February 3, 2014

Distributionally robust workforce scheduling in call centers with uncertain arrival rates

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2

STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1

How To Find The Optimal Location Of A Trauma Center And Air Ambulance

Classification - Examples

Approximation Algorithms

Optimization: Continuous Portfolio Allocation

Factors to Describe Job Shop Scheduling Problem

In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic

Iterated Local Search. Variable Neighborhood Search

Fifty Years of Vehicle Routing

VENDOR MANAGED INVENTORY

The Trip Scheduling Problem

Warshall s Algorithm: Transitive Closure

DESIGN AND OPERATION FOR AN ELECTRIC TAXI FLEET

GRASP and Path Relinking for the Matrix Bandwidth Minimization *

Transcription:

Improving Emergency Medical Dispatching with Emphasis on Mass-Casualty Incidents, Harald Burgsteiner, Martin Bernroider, Günter Kiechle, Maria Obermayer

Dispatcher s Challenges Dispatching ambulances is demanding Planning about 30 to 90 minutes in advance

Constraints & Assumptions Pickup/delivery Separation of emergencies/routine transports 7 different ambulance types Application of time windows Multiple depots Combination of routine transports due to ambulance capacities 4 different transport types

Objective Function k K Ambulance k out of the set of all ambulances (i, j) A Edge between the locations i and j i N Location i out of the set of all request h P r Routine transport h out of the set of all routine locations transports w i,k Normal waiting time w i,k Excessive waiting time Beginning of the service at location i by d i,j Distance between the locations i and j ambulance k a i Appointment at location i x i,j,k 1 if edge (i, j) is traversed by ambulance k B i,k w i,k w i,k min α d i,j x i,j,k k K (i,j) A = max(0, B i,k l i ) = max(0, B i,k a i w i,k + β w i,k i N ) + γ w i,k + δ z h r h P r l i α β Point in time marking the boundary between normal and excessive waiting time Weight factor of the minimum distance objective Weight factor of the minimum waiting time objective z h r γ δ 1 if routine transport h could not be included in the solution Weight factor of the excessive waiting time Weight factor of the number of unscheduled routine transports

Adaptive Large Neighborhood Search Searching different areas of the solution space Application of different destroy/repair heuristics Random removal Greedy insertion Worst removal Regret-2 heuristic Automatic weight adjustment due to solution quality Acceptance of worse solutions for diversification Simulated annealing framework

Evaluation (I) Instance Depots #Vehicles #Requests f_1_8_97 1 8 97 f_2_8_74 1, 4 8 74 f_2_8_89 1, 2 8 89 f_4_8_74 1, 4, 6, 7 8 74 f_8_8_81 all 8 81 f_8_27_272 all 27 272 1 Salzburg Stadt 2 Hallein 3 Saalfelden 4 Zell/See 5 Gastein 6 Tamsweg 7 Bischofshofen 8 - Lamprechtshausen

Evaluation (II) Qualitative evaluation Reference Start solution 1 min 5 min 50,000 it. Instance Cost b Cost n Cost b Cost n Cost b Cost n Cost b Cost n Cost b Cost n t [h] f_1_8_97 683 563-24.3% -8.1% -28.4% -13.1% -31.5% -16.9% -36.8% -23.3% 71 f_2_8_74 523 523 8.6% 8.6% -9.0% -9.0% -11.0% -11.0% -13.9% -13.9% 42 f_2_8_89 941 701-24.4% 1.5% -36.0% -14.1% -38.9% -18.0% -44.1% -25.0% 58 f_4_8_74 1,202 902 28.2% 70.8% 8.7% 44.9% 0.0% 33.3% -8.0% -22.7% 20 f_8_8_81 970 910 2.2% 8.9% -2.5% 3.9% -4.9% 1.4% -8.8% -2.8% 27 f_8_27_272 3,171 2,511-8.2% 15.9% -12.3% 10.7% -15.4% 6.8% -26.6% -7.3% 127

Evaluation (III) Performance evaluation Data in [s] #removed ambulances Avg. Instance 1 2 3 4 5 6 7 8 9 f_1_8_97 3.70 11.98 17.85 32.56 16.52 f_2_8_74 1.63 3.76 9.98 10.02 6.35 f_2_8_89 3.26 9.47 13.57 20.05 11.59 f_4_8_74 1.06 1.90 3.23 3.75 2.48 f_8_8_81 1.63 3.29 3.99 4.15 3.27 f_8_27_272 6.64 7.90 16.71 28.62 31.14 43.02 49.99 58.08 67.53 34.40 (14.97*) avg. 2.99 6.38 10.89 16.53 31.14 43.02 49.99 58.08 67.53 * average value of the first 4 columns

Conclusions More and different destroy/repair heuristics Include rostering of personnel, ambulance coverage, weather data, traffic status Connection of optimization system to the computer aided dispatch system

Thank you for your attention!, MSc BSc Email: gabriel.kleinoscheg.eht11@fh-joanneum.at Email: gabriel.kleinoscheg@meduniwien.ac.at