Improving Emergency Medical Dispatching with Emphasis on Mass-Casualty Incidents

Size: px
Start display at page:

Download "Improving Emergency Medical Dispatching with Emphasis on Mass-Casualty Incidents"

Transcription

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

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

3 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

4 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

5 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

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

7 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_ % -8.1% -28.4% -13.1% -31.5% -16.9% -36.8% -23.3% 71 f_2_8_ % 8.6% -9.0% -9.0% -11.0% -11.0% -13.9% -13.9% 42 f_2_8_ % 1.5% -36.0% -14.1% -38.9% -18.0% -44.1% -25.0% 58 f_4_8_74 1, % 70.8% 8.7% 44.9% 0.0% 33.3% -8.0% -22.7% 20 f_8_8_ % 8.9% -2.5% 3.9% -4.9% 1.4% -8.8% -2.8% 27 f_8_27_272 3,171 2, % 15.9% -12.3% 10.7% -15.4% 6.8% -26.6% -7.3% 127

8 Evaluation (III) Performance evaluation Data in [s] #removed ambulances Avg. Instance f_1_8_ f_2_8_ f_2_8_ f_4_8_ f_8_8_ f_8_27_ (14.97*) avg * average value of the first 4 columns

9 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

10 Thank you for your attention!, MSc BSc

VEHICLE ROUTING PROBLEM

VEHICLE ROUTING PROBLEM VEHICLE ROUTING PROBLEM Readings: E&M 0 Topics: versus TSP Solution methods Decision support systems for Relationship between TSP and Vehicle routing problem () is similar to the Traveling salesman problem

More information

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

Vehicle Routing and Scheduling. Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Martin Savelsbergh The Logistics Institute Georgia Institute of Technology Vehicle Routing and Scheduling Part I: Basic Models and Algorithms Introduction Freight routing

More information

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

5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 5 INTEGER LINEAR PROGRAMMING (ILP) E. Amaldi Fondamenti di R.O. Politecnico di Milano 1 General Integer Linear Program: (ILP) min c T x Ax b x 0 integer Assumption: A, b integer The integrality condition

More information

IST 301. Class Exercise: Simulating Business Processes

IST 301. Class Exercise: Simulating Business Processes IST 301 Class Exercise: Simulating Business Processes Learning Objectives: To use simulation to analyze and design business processes. To implement scenario and sensitivity analysis As-Is Process The As-Is

More information

Constraint Programming for the Vehicle Routing Problem. Philip Kilby

Constraint Programming for the Vehicle Routing Problem. Philip Kilby Constraint Programming for the Vehicle Routing Problem Philip Kilby A bit about NICTA National Information and Communications Technology Australia (NICTA) Research in ICT since 24 Major Labs in Sydney,

More information

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

Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Solving the Vehicle Routing Problem with Multiple Trips by Adaptive Memory Programming Alfredo Olivera and Omar Viera Universidad de la República Montevideo, Uruguay ICIL 05, Montevideo, Uruguay, February

More information

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

The vehicle routing problem with time windows is a hard combinatorial optimization problem that has TRANSPORTATION SCIENCE Vol. 38, No. 4, November 2004, pp. 515 530 issn 0041-1655 eissn 1526-5447 04 3804 0515 informs doi 10.1287/trsc.1030.0049 2004 INFORMS A Two-Stage Hybrid Local Search for the Vehicle

More information

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

Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows TECHNISCHE UNIVERSITEIT EINDHOVEN Branch-and-Price Approach to the Vehicle Routing Problem with Time Windows Lloyd A. Fasting May 2014 Supervisors: dr. M. Firat dr.ir. M.A.A. Boon J. van Twist MSc. Contents

More information

Online vehicle routing and scheduling with continuous vehicle tracking

Online vehicle routing and scheduling with continuous vehicle tracking Online vehicle routing and scheduling with continuous vehicle tracking Jean Respen, Nicolas Zufferey, Jean-Yves Potvin To cite this version: Jean Respen, Nicolas Zufferey, Jean-Yves Potvin. Online vehicle

More information

Airport logistics - A case study of the turnaround

Airport logistics - A case study of the turnaround Airport logistics - A case study of the turnaround process Anna Norin, Tobias Andersson Granberg, Di Yuan and Peter Värbrand Linköping University Post Print N.B.: When citing this work, cite the original

More information

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

Cost Models for Vehicle Routing Problems. 8850 Stanford Boulevard, Suite 260 R. H. Smith School of Business 0-7695-1435-9/02 $17.00 (c) 2002 IEEE 1 Cost Models for Vehicle Routing Problems John Sniezek Lawerence Bodin RouteSmart Technologies Decision and Information Technologies 8850 Stanford Boulevard, Suite

More information

A Staffing Algorithm for Call Centers with Skill-Based Routing

A Staffing Algorithm for Call Centers with Skill-Based Routing A Staffing Algorithm for Call Centers with Skill-Based Routing Ward Whitt IEOR Department, Columbia University http://www.columbia.edu/ ww2040 Joint work with: Rodney B. Wallace IBM and George Washington

More information

Production Planning Solution Techniques Part 1 MRP, MRP-II

Production Planning Solution Techniques Part 1 MRP, MRP-II Production Planning Solution Techniques Part 1 MRP, MRP-II Mads Kehlet Jepsen Production Planning Solution Techniques Part 1 MRP, MRP-II p.1/31 Overview Production Planning Solution Techniques Part 1 MRP,

More information

Monitoring Pramati EJB Server

Monitoring Pramati EJB Server Monitoring Pramati EJB Server 17 Overview The EJB Server manages the execution of enterprise applications that run on the J2EE server. The JAR modules deployed on the Server are supported by the EJB container.

More information

A hybrid approach for solving real-world nurse rostering problems

A hybrid approach for solving real-world nurse rostering problems Presentation at CP 2011: A hybrid approach for solving real-world nurse rostering problems Martin Stølevik (martin.stolevik@sintef.no) Tomas Eric Nordlander (tomas.nordlander@sintef.no) Atle Riise (atle.riise@sintef.no)

More information

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

Research Paper Business Analytics. Applications for the Vehicle Routing Problem. Jelmer Blok Research Paper Business Analytics Applications for the Vehicle Routing Problem Jelmer Blok Applications for the Vehicle Routing Problem Jelmer Blok Research Paper Vrije Universiteit Amsterdam Faculteit

More information

On the Technician Routing and Scheduling Problem

On the Technician Routing and Scheduling Problem On the Technician Routing and Scheduling Problem July 25, 2011 Victor Pillac *, Christelle Guéret *, Andrés Medaglia * Equipe Systèmes Logistiques et de Production (SLP), IRCCyN Ecole des Mines de Nantes,

More information

Load Balancing. Load Balancing 1 / 24

Load Balancing. Load Balancing 1 / 24 Load Balancing Backtracking, branch & bound and alpha-beta pruning: how to assign work to idle processes without much communication? Additionally for alpha-beta pruning: implementing the young-brothers-wait

More information

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

QoS optimization for an. on-demand transportation system via a fractional linear objective function QoS optimization for an Load charge ratio on-demand transportation system via a fractional linear objective function Thierry Garaix, University of Avignon (France) Column Generation 2008 QoS optimization

More information

Models for Ambulance Planning on the Strategic and the Tactical Level

Models for Ambulance Planning on the Strategic and the Tactical Level Noname manuscript No. (will be inserted by the editor) Models for Ambulance Planning on the Strategic and the Tactical Level J. Theresia van Essen Johann L. Hurink Stefan Nickel Melanie Reuter Received:

More information

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

Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times Impact of Online Tracking on a Vehicle Routing Problem with Dynamic Travel Times Jean Respen Nicolas Zufferey Jean-Yves Potvin January 2014 Impact of Online Tracking on a Vehicle Routing Problem with Dynamic

More information

Fleet Management Optimisation

Fleet Management Optimisation Fleet Management Optimisation Sindre Soltun Master of Science in Communication Technology Submission date: January 2007 Supervisor: Steinar Andresen, ITEM Co-supervisor: Per Stein, Nordisk Mobiltelefon

More information

Regrets Only! Online Stochastic Optimization under Time Constraints

Regrets Only! Online Stochastic Optimization under Time Constraints Regrets Only! Online Stochastic Optimization under Time Constraints Russell Bent and Pascal Van Hentenryck Brown University, Providence, RI 02912 {rbent,pvh}@cs.brown.edu Abstract This paper considers

More information

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan International Journal of Applied Operational Research Vol. 3, o. 3, pp. 105-111, Summer 2013 Journal homepage: www.ijorlu.ir Waste Collection Vehicle Routing Problem Considering Similarity Pattern of Trashcan

More information

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

Earliest Due Date (EDD) [Ferrari] Delay EDD. Jitter EDD Earliest Due Date (EDD) [Ferrari] Based on EDF Delay-EDD vs. jitter-edd Works for periodic message models (single packet in period): (pi,, Di) Partition end-to-end deadline D i into local deadlines D i,k

More information

A Library of Local Search Heuristics for the Vehicle Routing Problem

A Library of Local Search Heuristics for the Vehicle Routing Problem A Library of Local Search Heuristics for the Vehicle Routing Problem Chris Groër 1 Oak Ridge National Laboratory, 1 Bethel Valley Rd, Oak Ridge, TN 37831 cgroer@gmail.com Bruce Golden R.H. Smith School

More information

Integer Programming: Algorithms - 3

Integer Programming: Algorithms - 3 Week 9 Integer Programming: Algorithms - 3 OPR 992 Applied Mathematical Programming OPR 992 - Applied Mathematical Programming - p. 1/12 Dantzig-Wolfe Reformulation Example Strength of the Linear Programming

More information

Charles Fleurent Director - Optimization algorithms

Charles Fleurent Director - Optimization algorithms Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director - Optimization algorithms Objectives Provide an overview of software tools and optimization algorithms offered by GIRO

More information

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

Managing End-to-end Network performance via. Optimized Monitoring Strategies Managing End-to-end Network performance via Optimized Monitoring Strategies H. Cenk Ozmutlu hco@uludag.edu.tr Dept. of Industrial Engineering School of Engineering and Architecture Uludag University Gorukle,

More information

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

Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry Improving Forestry Transport Efficiency through Truck Schedule Optimization: a case study and software tool for the Australian Industry Mauricio Acuna Harvesting and Operations Program CRC for Forestry

More information

LOCATION OF HEALTH CARE FACILITIES

LOCATION OF HEALTH CARE FACILITIES 3 LOCATION OF HEALTH CARE FACILITIES Mark S. Daskin 1 and Latoya K. Dean 1 1 Department of Industrial Engineering and Management Sciences Northwestern University Evanston, IL 60208 FINAL PROOF VERSION

More information

HOME HEALTH CARE LOGISTICS PLANNING

HOME HEALTH CARE LOGISTICS PLANNING HOME HEALTH CARE LOGISTICS PLANNING A Thesis Presented to The Academic Faculty by Ashlea R. Bennett In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the H. Milton Stewart

More information

Optimizing departure times in vehicle routes

Optimizing departure times in vehicle routes Optimizing departure times in vehicle routes A.L. Kok, E.W. Hans, J.M.J. Schutten Operational Methods for Production and Logistics, University of Twente, P.O. Box 217, 7500AE, Enschede, Netherlands Abstract

More information

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms

Nurse Rostering. Jonathan Johannsen CS 537. Scheduling Algorithms Nurse Rostering Jonathan Johannsen CS 537 Scheduling Algorithms Most hospitals worldwide create schedules for their staff by hand, spending hours trying to optimally assign workers to various wards at

More information

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

A Decision Support System for the Assessment of Higher Education Degrees in Portugal A Decision Support System for the Assessment of Higher Education Degrees in Portugal José Paulo Santos, José Fernando Oliveira, Maria Antónia Carravilla, Carlos Costa Faculty of Engineering of the University

More information

Routing and Technology

Routing and Technology 1 Routing and Technology The how and why of school routing MTA 2015 Class 4 April 1 & 7, 2015 OSBA leads the way to educational excellence by serving Ohio s public school board members and the diverse

More information

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

An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem An ACO/VNS Hybrid Approach for a Large-Scale Energy Management Problem Challenge ROADEF/EURO 2010 Roman Steiner, Sandro Pirkwieser, Matthias Prandtstetter Vienna University of Technology, Austria Institute

More information

Ant Colony Optimization (ACO)

Ant Colony Optimization (ACO) Ant Colony Optimization (ACO) Exploits foraging behavior of ants Path optimization Problems mapping onto foraging are ACO-like TSP, ATSP QAP Travelling Salesman Problem (TSP) Why? Hard, shortest path problem

More information

Finding Liveness Errors with ACO

Finding Liveness Errors with ACO Hong Kong, June 1-6, 2008 1 / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Motivation Motivation Nowadays software is very complex An error in a software system can imply the

More information

UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES

UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES UAV ROUTE PLANNING FOR MAXIMUM TARGET COVERAGES MURAT KARAKAYA 1 1 Department of Computer Engineering, Atilim University, Ankara, Turkey ABSTRACT Utilization of Unmanned Aerial Vehicles (UAVs) in military

More information

FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION

FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION FLEET REROUTING STRATEGIES WITH REAL-TIME TRAFFIC INFORMATION Barceló, Jaume. Department of Statistics and Operations Research and CENIT (Center for Innovation in Transport), Universitat Politècnica de

More information

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

APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,

More information

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

On the Impact of Real-Time Information on. Field Service Scheduling. Ioannis Petrakis, Christian Hass, Martin Bichler 1 On the Impact of Real-Time Information on Field Service Scheduling Ioannis Petrakis, Christian Hass, Martin Bichler 1 Department of Informatics, TU München, Germany Mobile phone operators need to plan

More information

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

M. Sugumaran / (IJCSIT) International Journal of Computer Science and Information Technologies, Vol. 2 (3), 2011, 1001-1006 A Design of Centralized Meeting Scheduler with Distance Metrics M. Sugumaran Department of Computer Science and Engineering,Pondicherry Engineering College, Puducherry, India. Abstract Meeting scheduling

More information

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

A Hybrid Heuristic Method for the Compressed Natural Gas (CNG) Truck Routing Problem with Fueling Stations. I-NUF 2015, Long Beach A Hybrid Heuristic Method for the Compressed Natural Gas (CNG) Truck Routing Problem with Fueling Stations Author: Advisor: Yihuan (Ethan) Shao Maged Dessouky Outline Introduction Literature review Problem

More information

More Local Structure Information for Make-Model Recognition

More Local Structure Information for Make-Model Recognition More Local Structure Information for Make-Model Recognition David Anthony Torres Dept. of Computer Science The University of California at San Diego La Jolla, CA 9093 Abstract An object classification

More information

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

EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks 2 EA and ACO Algorithms Applied to Optimizing Location of Controllers in Wireless Networks Dac-Nhuong Le, Hanoi University of Science, Vietnam National University, Vietnam Optimizing location of controllers

More information

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

Collaborative Transportation Planning of Less-Than-Truckload Freight: Request Exchange through a Route-based Combinatorial Auction Faculty 7: Business Studies & Economics Collaborative Transportation Planning of Less-Than-Truckload Freight: Request Exchange through a Route-based Combinatorial Auction Xin Wang and Herbert Kopfer Working

More information

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

Is Truck Queuing Productive? Study of truck & shovel operations productivity using simulation platform MineDES Is Truck Queuing Productive? Study of truck & shovel operations productivity using simulation platform MineDES Dmitry Kostyuk Specialist Scientist, Group Resource and Business Optimisation 25 November

More information

6.852: Distributed Algorithms Fall, 2009. Class 2

6.852: Distributed Algorithms Fall, 2009. Class 2 .8: Distributed Algorithms Fall, 009 Class Today s plan Leader election in a synchronous ring: Lower bound for comparison-based algorithms. Basic computation in general synchronous networks: Leader election

More information

Metaheuristics for the consistent nurse scheduling and routing problem.

Metaheuristics for the consistent nurse scheduling and routing problem. Metaheuristics for the consistent nurse scheduling and routing problem. Thomas Macdonald supervisors: Karl Dörner and Xavier Gandibleux Department of Production and Logistics University of Vienna Bruenner

More information

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

Joint Ground and Air Emergency Medical Services Coverage Models: A Greedy Heuristic Solution Approach. Revised: December 2009 Joint Ground and Air Emergency Medical Services Coverage Models: A Greedy Heuristic Solution Approach Elif Tokar Erdemir 1, Rajan Batta 2,3,5, Peter A. Rogerson 2,4,5, Alan Blatt 2, and Marie Flanigan

More information

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem

An Efficient Algorithm for Solving a Stochastic Location-Routing Problem Journal of mathematics and computer Science 12 (214) 27 38 An Efficient Algorithm for Solving a Stochastic LocationRouting Problem H.A. HassanPour a, M. MosadeghKhah a, M. Zareei 1 a Department of Industrial

More information

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

Direct Integration: Training Software Developers and Designers to Conduct Usability Evaluations Direct Integration: Training Software Developers and Designers to Conduct Usability Evaluations Mikael B. Skov Jan Stage Presented by: Jan Stage Aalborg University Department of Computer Science jans@cs.aau.dk

More information

MISSING DATA IMPUTATION IN CARDIAC DATA SET (SURVIVAL PROGNOSIS)

MISSING DATA IMPUTATION IN CARDIAC DATA SET (SURVIVAL PROGNOSIS) MISSING DATA IMPUTATION IN CARDIAC DATA SET (SURVIVAL PROGNOSIS) R.KAVITHA KUMAR Department of Computer Science and Engineering Pondicherry Engineering College, Pudhucherry, India DR. R.M.CHADRASEKAR Professor,

More information

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

Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows Sophie N. Parragh Jean-François Cordeau October 2015 Branch-and-Price for the Truck and Trailer Routing Problem with Time Windows

More information

FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM

FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM FAST LOCAL SEARCH FOR THE MAXIMUM INDEPENDENT SET PROBLEM DIOGO V. ANDRADE, MAURICIO G.C. RESENDE, AND RENATO F. WERNECK Abstract. Given a graph G = (V, E), the independent set problem is that of finding

More information

A CP Scheduler for High-Performance Computers

A CP Scheduler for High-Performance Computers A CP Scheduler for High-Performance Computers Thomas Bridi, Michele Lombardi, Andrea Bartolini, Luca Benini, and Michela Milano {thomas.bridi,michele.lombardi2,a.bartolini,luca.benini,michela.milano}@

More information

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

A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows European Journal of Operational Research 176 (2007) 1478 1507 Discrete Optimization A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows

More information

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

Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows Beam-ACO Based on Stochastic Sampling for Makespan Optimization Concerning the TSP with Time Windows Manuel López-Ibáñez 1, Christian Blum 1, Dhananjay Thiruvady 2,3, Andreas T. Ernst 3, and Bernd Meyer

More information

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

Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods Variable neighbourhood search in commercial VRP packages: evolving towards self-adaptive methods Kenneth Sörensen 1, Marc Sevaux 2, and Patrick Schittekat 1,3 1 University of Antwerp 2 University of South

More information

An Improved ACO Algorithm for Multicast Routing

An Improved ACO Algorithm for Multicast Routing An Improved ACO Algorithm for Multicast Routing Ziqiang Wang and Dexian Zhang School of Information Science and Engineering, Henan University of Technology, Zheng Zhou 450052,China wzqagent@xinhuanet.com

More information

BTS Backhaul by Satellite

BTS Backhaul by Satellite BTS Backhaul by Satellite Improving QoS & Optimizing Bandwidth The Mobile Market is experiencing solid growth in emerging countries. As an illustration, GSMA predicts the number of connections in Africa

More information

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

An Energy-aware Multi-start Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution An Energy-aware Multi-start Local Search Metaheuristic for Scheduling VMs within the OpenNebula Cloud Distribution Y. Kessaci, N. Melab et E-G. Talbi Dolphin Project Team, Université Lille 1, LIFL-CNRS,

More information

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

Agenda. Real System, Transactional IT, Analytic IT. What s the Supply Chain. Levels of Decision Making. Supply Chain Optimization Agenda Supply Chain Optimization KUBO Mikio Definition of the Supply Chain (SC) and Logistics Decision Levels of the SC Classification of Basic Models in the SC Logistics Network Design Production Planning

More information

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers

Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Traffic Engineering for Multiple Spanning Tree Protocol in Large Data Centers Ho Trong Viet, Yves Deville, Olivier Bonaventure, Pierre François ICTEAM, Université catholique de Louvain (UCL), Belgium.

More information

Optimization of patient transport dispatching in hospitals

Optimization of patient transport dispatching in hospitals Optimization of patient transport dispatching in hospitals Cyrille Lefèvre and Sophie Marquet Supervisors: Yves Deville and Gildas Avoine 1500 minutes Thesis motivation MedSoc NPO asked us to conduct a

More information

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

Load balancing in a heterogeneous computer system by self-organizing Kohonen network Bull. Nov. Comp. Center, Comp. Science, 25 (2006), 69 74 c 2006 NCC Publisher Load balancing in a heterogeneous computer system by self-organizing Kohonen network Mikhail S. Tarkov, Yakov S. Bezrukov Abstract.

More information

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

Dynamic Relocation of Emergency Ambulance Vehicles Using the AVL Component of the GPS/GPRS Tracking System Dynamic Relocation of Emergency Ambulance Vehicles Using the AVL Component of the GPS/GPRS Tracking System Čedomir Vasić 1, Bratislav Predić 1, Dejan Rančić 1, Petar Spalević 2, Dženan Avdić 3 1 Department

More information

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

RIGHT TECHNICIAN, RIGHT PLACE, RIGHT TIME, SO WHAT? A Mobile Workforce Management ebook RIGHT TECHNICIAN, RIGHT PLACE, RIGHT TIME, SO WHAT? A Mobile Workforce Management ebook TABLE OF CONTENTS Why Schedule Optimization Should Be Your Most Important Field Service Project This Year... 03 How

More information

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

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 SPLIT PLOT DESIGN 2 Main Plot Treatments (1, 2) 2 Sub Plot Treatments (A, B) 4 Blocks Block 1 Block 2 Block 3 Block 4 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

More information

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem

A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem A Scatter Search Algorithm for the Split Delivery Vehicle Routing Problem Campos,V., Corberán, A., Mota, E. Dep. Estadística i Investigació Operativa. Universitat de València. Spain Corresponding author:

More information

Dynamic Vehicle Routing in MATSim

Dynamic Vehicle Routing in MATSim Poznan University of Technology Department of Motor Vehicles and Road Transport ZPSiTD Dynamic Vehicle Routing in MATSim Simulation and Optimization Michal Maciejewski michal.maciejewski@put.poznan.pl

More information

A Simple Method to Forecast Travel Demand in Urban Public Transport

A Simple Method to Forecast Travel Demand in Urban Public Transport Acta Polytechnica Hungarica Vol. 9, No. 4, 2012 A Simple Method to Forecast Travel Demand in Urban Public Transport Balázs Horváth Széchenyi István University Department of Transport Egyetem tér 1, H-9026

More information

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

Have you reported the defect? Reference No.* FR. Date of Incident / / Time of Incident am/pm Highway Incident Claim Form THE PROVISION OF THIS FORM DOES NOT CONSTITUTE AN ADMISSION OF LIABILITY ON BEHALF OF EAST SUSSEX COUNTY COUNCIL OR SUGGEST THAT YOU WILL AUTOMATICALLY RECEIVE COMPENSATION.

More information

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.

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. 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 Navid Hashemian a Béla Vizvári b RRR 3-2011, February 21, 2011 RUTCOR Rutgers

More information

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

vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK vii TABLE OF CONTENTS CHAPTER TITLE PAGE DECLARATION DEDICATION ACKNOWLEDGEMENT ABSTRACT ABSTRAK TABLE OF CONTENTS LIST OF TABLES LIST OF FIGURES LIST OF ABBREVIATIONS LIST OF SYMBOLS LIST OF APPENDICES

More information

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

Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand Strategic Planning and Vehicle Routing Algorithm for Newspaper Delivery Problem: Case study of Morning Newspaper, Bangkok, Thailand Arunya Boonkleaw, Nanthi Sutharnnarunai, PhD., Rawinkhan Srinon, PhD.

More information

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

Appendix of: Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Appendix of: Metaheuristics for Solving a Multimodal Home-Healthcare Scheduling Problem Gerhard Hiermann, Matthias Prandtstetter, Andrea Rendl, Jakob Puchinger, and Günther R. Raidl 1 M. Prandtstetter,

More information

Optimal Vehicle Routing and Scheduling with Precedence Constraints and Location Choice

Optimal Vehicle Routing and Scheduling with Precedence Constraints and Location Choice Optimal Vehicle Routing and Scheduling with Precedence Constraints and Location Choice G. Ayorkor Korsah, Anthony Stentz, M. Bernardine Dias, and Imran Fanaswala Abstract To realize the vision of intelligent

More information

Report: Google Data center Scheduling

Report: Google Data center Scheduling 1 Research Objective Report: Google Data center Scheduling Tony T. Tran and J. Christopher Beck Department of Mechanical and Industrial Engineering, University of Toronto {tran, jcb}@mie.utoronto.ca The

More information

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

Research Article Scheduling IT Staff at a Bank: A Mathematical Programming Approach e Scientific World Journal, Article ID 768374, 10 pages http://dx.doi.org/10.1155/2014/768374 Research Article Scheduling IT Staff at a Bank: A Mathematical Programming Approach M.Labidi,M.Mrad,A.Gharbi,andM.A.Louly

More information

Revenue Management for Transportation Problems

Revenue Management for Transportation Problems Revenue Management for Transportation Problems Francesca Guerriero Giovanna Miglionico Filomena Olivito Department of Electronic Informatics and Systems, University of Calabria Via P. Bucci, 87036 Rende

More information

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

Asking Hard Graph Questions. Paul Burkhardt. February 3, 2014 Beyond Watson: Predictive Analytics and Big Data U.S. National Security Agency Research Directorate - R6 Technical Report February 3, 2014 300 years before Watson there was Euler! The first (Jeopardy!)

More information

Distributionally robust workforce scheduling in call centers with uncertain arrival rates

Distributionally robust workforce scheduling in call centers with uncertain arrival rates Distributionally robust workforce scheduling in call centers with uncertain arrival rates S. Liao 1, C. van Delft 2, J.-P. Vial 3,4 1 Ecole Centrale, Paris, France 2 HEC. Paris, France 3 Prof. Emeritus,

More information

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

IEOR 4404 Homework #2 Intro OR: Deterministic Models February 14, 2011 Prof. Jay Sethuraman Page 1 of 5. Homework #2 IEOR 4404 Homework # Intro OR: Deterministic Models February 14, 011 Prof. Jay Sethuraman Page 1 of 5 Homework #.1 (a) What is the optimal solution of this problem? Let us consider that x 1, x and x 3

More information

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

STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 STUDY OF PROJECT SCHEDULING AND RESOURCE ALLOCATION USING ANT COLONY OPTIMIZATION 1 Prajakta Joglekar, 2 Pallavi Jaiswal, 3 Vandana Jagtap Maharashtra Institute of Technology, Pune Email: 1 somanprajakta@gmail.com,

More information

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

How To Find The Optimal Location Of A Trauma Center And Air Ambulance Proceedings of the 2012 Winter Simulation Conference C. Laroque, J. Himmelspach, R. Pasupathy, O. Rose, and A.M. Uhrmacher, eds A SIMULATION-BASED ITERATIVE METHOD FOR A TRAUMA CENTER AIR AMBULANCE LOCATION

More information

Classification - Examples

Classification - Examples Lecture 2 Scheduling 1 Classification - Examples 1 r j C max given: n jobs with processing times p 1,...,p n and release dates r 1,...,r n jobs have to be scheduled without preemption on one machine taking

More information

Approximation Algorithms

Approximation Algorithms Approximation Algorithms or: How I Learned to Stop Worrying and Deal with NP-Completeness Ong Jit Sheng, Jonathan (A0073924B) March, 2012 Overview Key Results (I) General techniques: Greedy algorithms

More information

Optimization: Continuous Portfolio Allocation

Optimization: Continuous Portfolio Allocation Optimization: Continuous Portfolio Allocation Short Examples Series using Risk Simulator For more information please visit: www.realoptionsvaluation.com or contact us at: admin@realoptionsvaluation.com

More information

Factors to Describe Job Shop Scheduling Problem

Factors to Describe Job Shop Scheduling Problem Job Shop Scheduling Job Shop A work location in which a number of general purpose work stations exist and are used to perform a variety of jobs Example: Car repair each operator (mechanic) evaluates plus

More information

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

In-Time Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic From: IAAI-99 Proceedings. Copyright 1999, AAAI (www.aaai.org). All rights reserved. In- Agent-Based Vehicle Routing with a Stochastic Improvement Heuristic Robert Kohout and Kutluhan Erol Intelligent

More information

Iterated Local Search. Variable Neighborhood Search

Iterated Local Search. Variable Neighborhood Search Iterated Local Search Variable Neighborhood Search Thomas Stützle stuetzle@informatik.tu-darmstadt.de http://www.intellektik.informatik.tu-darmstadt.de/ tom. Darmstadt University of Technology Department

More information

Fifty Years of Vehicle Routing

Fifty Years of Vehicle Routing Fifty Years of Vehicle Routing by Gilbert Laporte Canada Research Chair in Distribution Management HEC Montréal Vehicle Routing Problem Depot m (or at most m) identical vehicles based at the depot n customers

More information

VENDOR MANAGED INVENTORY

VENDOR MANAGED INVENTORY VENDOR MANAGED INVENTORY Martin Savelsbergh School of Industrial and Systems Engineering Georgia Institute of Technology Joint work with Ann Campbell, Anton Kleywegt, and Vijay Nori Distribution Systems:

More information

The Trip Scheduling Problem

The Trip Scheduling Problem The Trip Scheduling Problem Claudia Archetti Department of Quantitative Methods, University of Brescia Contrada Santa Chiara 50, 25122 Brescia, Italy Martin Savelsbergh School of Industrial and Systems

More information

Warshall s Algorithm: Transitive Closure

Warshall s Algorithm: Transitive Closure CS 0 Theory of Algorithms / CS 68 Algorithms in Bioinformaticsi Dynamic Programming Part II. Warshall s Algorithm: Transitive Closure Computes the transitive closure of a relation (Alternatively: all paths

More information

DESIGN AND OPERATION FOR AN ELECTRIC TAXI FLEET

DESIGN AND OPERATION FOR AN ELECTRIC TAXI FLEET DESIGN AND OPERATION FOR AN ELECTRIC TAXI FLEET BERNAT GACIAS AND FRÉDÉRIC MEUNIER Abstract. The deployment of electric taxi fleets is highly desirable from a sustainable point of view. Nevertheless, the

More information

GRASP and Path Relinking for the Matrix Bandwidth Minimization *

GRASP and Path Relinking for the Matrix Bandwidth Minimization * GRASP and Path Relinking for the Matrix Bandwidth Minimization * Estefanía Piñana, Isaac Plana, Vicente Campos and Rafael Martí Dpto. de Estadística e Investigación Operativa, Facultad de Matemáticas,

More information