Charles Fleurent Director - Optimization algorithms

Size: px
Start display at page:

Download "Charles Fleurent Director - Optimization algorithms"

Transcription

1 Software Tools for Transit Scheduling and Routing at GIRO Charles Fleurent Director - Optimization algorithms

2 Objectives Provide an overview of software tools and optimization algorithms offered by GIRO Public transit Postal operations Demonstrate how operational research methods can be used in practice 2

3 Overview Company background Public transit sector (scheduling) Postal sector (routing) Conclusion 3

4 GIRO Inc. World-leading developer of software solutions for public transit and postal sectors Founded in 1979 Spin-off from University of Montreal Presence in 24 countries, 4 continents 85% of revenues outside Canada Headquartered in Montreal ~210 employees, steady growth Recent news at 4

5 Product families HASTUS Public transportt GeoRoute Postal services GIRO/ACCES Paratransit (assisted transport) 5

6 Snapshot of major transit customers North/South America New York, Los Angeles, Chicago, Montreal, Santiago Europe Asia Barcelona, Stockholm, Vienna, Geneva, Hamburg, Brussels Singapore, Hong Kong Australia Sydney, Melbourne, Canberra, Brisbane Major transit operators Keolis, Transdev, Veolia, Connexxion *250 sites in more than 21 countries 6

7 Postal services customers An Post La Poste De Post Deutsche Post AG Posten Norge AS Royal Mail P&T Luxemburg Canada Post Corporation TNT Post CTT Correios 7

8 Public transit sector Public transit Relatively large transportation network (city, region) Buses, metros, trams, trolleys, light rail, etc. Mandate Provide high-quality service to customers Frequencies Travel time Punctuality Reduce operating costs Material resources (e.g. vehicles) Human resources (e.g. drivers) 8

9 Planning process Demand estimation (O-D matrix) Lines and frequencies Timetabling Vehicle scheduling Crew scheduling Rostering Operations (dispatching) 9

10 Planning process (cont d) Early phases Demand estimation Lines and frequencies Timetabling Important political and human factors Line paths Frequencies Resistance to change 10

11 Timetabling Decision variables Trip start times Objectives Maximize synchronization (passenger transfers) Minimize resources (vehicles, drivers) Mathematical model Optimization problem Min s.t. K T ( x ) K V ( x ) x T ij V integer i I, j J i 11

12 Example Waiting time (synchronization) B h25 waiting time 7:45 7:30 7:15 7:00 C 730 7:30 7:00 A 5 7:00 7:30 Path Duration A-B 0h20 A-C-B 0h35 12

13 Changing starting times for C-B B h01 waiting time 7:45 7:30 7:15 7:00 C 736 7:36 7:06 A 5 7:00 7:30 Path Duration A-B 0h20 A-C-B 0h11 13

14 Example - Impact on vehicle schedule 7:00 7:45 7:30 7:15 7:00 B 7: :00 7:15 5 7:30 7: :00 7:30 C 730 7:30 7:00 Unproductive time and # of vehicles A 7:00 7:30 B C 14 A 5 G G G G G G G G G G G

15 Timetabling Graphical view in HASTUS 15

16 Vehicle scheduling Data Trips to cover (timetable) Deadhead matrix (travel times between termini) Minimum layovers Garages ages (depots) with capacities Vehicle types restrictions Objectives Minimize number of vehicles Minimize unproductive time (layovers, deadheads) 16

17 Vehicle scheduling (cont d) Single-depot variant (SDVSP) Easy (e.g. network flow formulation) 17

18 Vehicle scheduling (cont d) Multiple depots MDVSP (Multi-Depot Vehicle Scheduling Problem) NP-Hard for 2 depots or more Possible formulations Set partitioning i Multi-commodity problems Solution approaches Column generation Specialized heuristics 18

19 Vehicle scheduling (cont d) Complicating factors that are found in practice: Temporary parking of vehicles Additional constraints on vehicles Possible modifications to timetable Generate solutions that are similar to a starting solution Generate coupling/uncoupling activities (rail) Consider operating exceptions Urban and regional variants Algorithms must remain efficient! 19

20 Vehicle scheduling Graphical view in HASTUS 20

21 Vehicle scheduling Another graphical view 21

22 Crew scheduling Data Vehicle schedule Relief points Travel times Collective bargaining agreement (CBA) Objective Constraints Hourly rate, fringe benefits, bonuses Minimize paid time and penalties 22

23 Crew scheduling (cont d) Leading problems: Manpower: up to 80% of global operation costs Collective agreement can be very complex Service usually much higher at peak hours Split duties with large spread 23

24 Crew schedule Graphical view in HASTUS 24

25 Crew scheduling (cont d) Optimization algorithms for crew scheduling Before 1990: specialized heuristics Since 1990: column generation GERAD (Desrochers et Soumis 1989) GIRO involved since early 1990 Recent developments Decomposition Parallel processing Dynamic constraint aggregation Complementary heuristic procedures 25

26 Rostering Work planning over a longer time period Days off Duties Availability periods Algorithms Mathematical programming Meta-heuristics Tabu search Variable Neighborhood Search 26

27 Rostering Graphical view in HASTUS 27

28 Integrated problems Planning process Demand estimation Line and frequencies Timetabling Vehicle scheduling Crew scheduling Rostering Steps are often carried out sequentially Possible savings when some steps are combined Integrated models are more complex and large-scale GIRO s algorithms can also tackle these problems 28

29 Daily operations (dispatching) React to daily events Absences and late arrivals for drivers Service disruptions Temporary service addition Optimization problems Work assignment for available drivers Crew re-scheduling Solution methods Mathematical programming Specialized heuristics 29

30 Daily operations Graphical view in HASTUS 30

31 Other products Run-time analysis Find periods and run times for routes Maximize punctuality Specialized algorithms that use statistical analysis 31

32 Other products (cont d) Passenger information (trip planners) Shortest path problem in a time-space graph 32

33 Routing sector Postal services High-density problems Mail delivery Low-density problems Parcel/express Postal box collection Transportation (pickup and delivery) Location problems Other applications School transportation Waste collection 33

34 Routing - Graphical view in GeoRoute Demands on arcs 34

35 Routing Another graphical view in GeoRoute Demands on points 35

36 Routing Another graphical view in GeoRoute Depot location Depots with fixed and variable costs (find best subset) 36

37 Related academic problems Node problems Traveling Salesman Problem (TSP) Vehicle Routing Problem (VRP) Many variants (e.g. time windows) Arc problems Chinese Postman Problem Rural Postman Problem Capacitated t Arc Routing Problem (CARP) These problems are well-studied by the scientific community 37

38 Practical problems Additional difficulties: Very large-scale (5,000 demands and more) Additional constraints Network restrictions (left turns, U-turns) Extra activities in routes (sorting, breaks, etc.) High number of demands per route Multiple route types (e.g. vehicle types) Zigzag distribution (both sides of street) Time windows Park and loop routes 38

39 Algorithms Constructive methods Iterations between clustering and sequencing phases Generate good solutions in less than 1 hour Often sufficient for mail delivery Initial solution for more difficult variants (e.g. pickup and delivery) Post-optimization Local search Large neighborhood search Meta-heuristics Run-time increases 39

40 Algorithms (cont d) What is the real cost of running time? User waits for result Slows down tuning of the algorithms Reduced interaction with user Slows down the planning process Computer resources are tied up Allows to reach better solutions Possible productivity gains Fast algorithms are necessary To be used in early stage of a project If more running time is available Try to use it efficiently 40

41 Conclusion Problems to solve are: Varied Often difficult Time-sensitive (tight deadlines) Algorithms must be: Flexible Fast Efficient (solution quality) Integrated into a complete computer application 41

42 Conclusion (cont d) Wide variety of optimization methods used at GIRO: Linear programming Network flow algorithms Integer programming Column generation Lagrangean relaxation Tabu search Variable neighborhood search Large neighborhood search Gomory cuts Greedy algorithms Specialized heuristics Statistics Local search Explicit enumeration of a solution space Parallelism Use what works depending on the problem you need to solve 42

43 Conclusion (cont d) Keys to success: Often solve the same problems Always some variants but easier if you know the problem well Algorithms improve over time Use if possible simple and flexible algorithms Always new functionalities to support In some cases, more complex approaches are needed 43

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

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

Two objective functions for a real life Split Delivery Vehicle Routing Problem

Two objective functions for a real life Split Delivery Vehicle Routing Problem International Conference on Industrial Engineering and Systems Management IESM 2011 May 25 - May 27 METZ - FRANCE Two objective functions for a real life Split Delivery Vehicle Routing Problem Marc Uldry

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

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models

INTEGER PROGRAMMING. Integer Programming. Prototype example. BIP model. BIP models Integer Programming INTEGER PROGRAMMING In many problems the decision variables must have integer values. Example: assign people, machines, and vehicles to activities in integer quantities. If this is

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

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

Driver Scheduling, Vehicle Scheduling, Optimal Route Structure, Transit Platform Hours. Form DOT F 1700.7 (8-72)

Driver Scheduling, Vehicle Scheduling, Optimal Route Structure, Transit Platform Hours. Form DOT F 1700.7 (8-72) 1. Report No. SWUTC/09/476660-00063-1 Technical Report Documentation Page 2. Government Accession No. 3. Recipient's Catalog No. 4. Title and Subtitle Vehicle and Driver Scheduling for Public Transit 7.

More information

Fleet Size and Mix Optimization for Paratransit Services

Fleet Size and Mix Optimization for Paratransit Services Fleet Size and Mix Optimization for Paratransit Services Liping Fu and Gary Ishkhanov Most paratransit agencies use a mix of different types of vehicles ranging from small sedans to large converted vans

More information

Stochastic Ship Fleet Routing with Inventory Limits YU YU

Stochastic Ship Fleet Routing with Inventory Limits YU YU Stochastic Ship Fleet Routing with Inventory Limits YU YU Doctor of Philosophy University of Edinburgh 2009 Declaration I declare that this thesis was composed by myself and that the work contained therein

More information

OPTIMAL VEHICLE TIMETABLING, ROUTING AND DRIVER DUTY SCHEDULING CASE STUDY: BUS DEPOT PROBLEM

OPTIMAL VEHICLE TIMETABLING, ROUTING AND DRIVER DUTY SCHEDULING CASE STUDY: BUS DEPOT PROBLEM OPTIMAL VEHICLE TIMETABLING, ROUTING AND DRIVER DUTY SCHEDULING CASE STUDY: BUS DEPOT PROBLEM Mr Tushar T. Rasal Department of Electronics & Telecommunication Engineering Rajarambapu Institute of Technology

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

Operational Indicators for public transport companies

Operational Indicators for public transport companies Operational Indicators for public transport companies João Mendes Moreira, Jorge Freire de Sousa INEGI, Rua dos Bragas, 4099 Porto Code, Portugal Tel: +351-2-2073650 Fa: +351-2-2073659 Email: joao@gist.fe.up.pt

More information

A New Solution for Rail Service Network Design Problem

A New Solution for Rail Service Network Design Problem A New Solution for Rail Service Network Design Problem E.Zhu 1 T.G.Crainic 2 M.Gendreau 3 1 Département d informatique et de recherche opérationnelle Université de Montréal 2 École des sciences de la gestion

More information

Bus fleet optimization using genetic algorithm a case study of Mashhad

Bus fleet optimization using genetic algorithm a case study of Mashhad International Journal of Civil Engineering Bus fleet optimization using genetic algorithm a case study of Mashhad Sh. Afandizadeh 1,*, H. Khaksar 2, N. Kalantari 2 Received: May 2011, Revised: June 2011,

More information

Re-optimization of Rolling Stock Rotations

Re-optimization of Rolling Stock Rotations Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany RALF BORNDÖRFER 1, JULIKA MEHRGARDT 1, MARKUS REUTHER 1, THOMAS SCHLECHTE 1, KERSTIN WAAS 2 Re-optimization

More information

Using Ant Colony Optimization for Infrastructure Maintenance Scheduling

Using Ant Colony Optimization for Infrastructure Maintenance Scheduling Using Ant Colony Optimization for Infrastructure Maintenance Scheduling K. Lukas, A. Borrmann & E. Rank Chair for Computation in Engineering, Technische Universität München ABSTRACT: For the optimal planning

More information

Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change

Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change Constrained Local Search Method for Bus Fleet Scheduling Problem with Multi-depot with Line Change Kriangsak Vanidchakornpong 1, Nakorn Indra-Payoong 1, Agachai Sumalee 2, Pairoj Raothanachonkun 1 1 College

More information

Routing in Line Planning for Public Transport

Routing in Line Planning for Public Transport Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARC E. PFETSCH RALF BORNDÖRFER Routing in Line Planning for Public Transport Supported by the DFG Research

More information

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips

Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Adaptive Memory Programming for the Vehicle Routing Problem with Multiple Trips Alfredo Olivera, Omar Viera Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Herrera y Reissig

More information

AN OPEN VEHICLE ROUTING APPLICATION FOR THE PERSONNEL OF A CALL CENTER

AN OPEN VEHICLE ROUTING APPLICATION FOR THE PERSONNEL OF A CALL CENTER OR 2008 Conference in Augsburg September 03 rd 2008 AN OPEN VEHICLE ROUTING APPLICATION FOR THE PERSONNEL OF A CALL CENTER Deniz Koşucuo ucuoğlu 1, Deniz Aksen 2, Selçuk Savaş 3 1 Department of Industrial

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

The VRP with Time Windows

The VRP with Time Windows The VRP with Time Windows J.-F. Cordeau École des Hautes Études Commerciales, Montréal cordeau@crt.umontreal.ca Guy Desaulniers Département de mathématiques et génie industriel École Polytechnique de Montréal,

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

A Method for Scheduling Integrated Transit Service

A Method for Scheduling Integrated Transit Service A Method for Scheduling Integrated Transit Service Mark Hickman Department of Civil Engineering and Engineering Mechanics The University of Arizona P.O. Box 210072 Tucson, AZ 85721-0072 USA Phone: (520)

More information

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

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

Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP)

Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP) Mass Transport Vehicle Routing Problem (MTVRP) and the Associated Network Design Problem (MTNDP) R. Jayakrishnan Department of Civil Engineering and Institute of Transportation Studies University of California,

More information

Martin Savelsbergh. Georgia Institute of Technology. Joint work with Alan Erera, Mike Hewitt, Yang Zhang

Martin Savelsbergh. Georgia Institute of Technology. Joint work with Alan Erera, Mike Hewitt, Yang Zhang Dynamic Load Planning for Less-Than-Truckload Carriers Schneider Professor Georgia Institute of Technology Joint work with Alan Erera, Mike Hewitt, Yang Zhang TRANSLOG, December 10, 2009 Part I: Advances

More information

Dave Sly, PhD, MBA, PE Iowa State University

Dave Sly, PhD, MBA, PE Iowa State University Dave Sly, PhD, MBA, PE Iowa State University Tuggers deliver to multiple locations on one trip, where Unit Load deliveries involve only one location per trip. Tugger deliveries are more complex since the

More information

Optimizing the Synchronization of Multiple Bus Routes at Multiple Transfer Points Assuming Stochastic Bus Journey Times

Optimizing the Synchronization of Multiple Bus Routes at Multiple Transfer Points Assuming Stochastic Bus Journey Times University of Wisconsin Milwaukee UWM Digital Commons Theses and Dissertations August 2014 Optimizing the Synchronization of Multiple Routes at Multiple Transfer Points Assuming Stochastic Journey Times

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

Optimising Patient Transportation in Hospitals

Optimising Patient Transportation in Hospitals Optimising Patient Transportation in Hospitals Thomas Hanne 1 Fraunhofer Institute for Industrial Mathematics (ITWM), Fraunhofer-Platz 1, 67663 Kaiserslautern, Germany, hanne@itwm.fhg.de 1 Introduction

More information

Load Planning for Less-than-truckload Carriers. Martin Savelsbergh

Load Planning for Less-than-truckload Carriers. Martin Savelsbergh Load Planning for Less-than-truckload Carriers Martin Savelsbergh Centre for Optimal Planning and Operations School of Mathematical and Physical Sciences University of Newcastle Optimisation in Industry,

More information

HASTUS SYSTEM v2014 SOFTWARE UPGRADE APPROVE CONTRACT PS92403192 AWARD TO GIRO, INC.

HASTUS SYSTEM v2014 SOFTWARE UPGRADE APPROVE CONTRACT PS92403192 AWARD TO GIRO, INC. One Gateway Plaza Los Angeles, CA 90012-2952 213.922.2ooo Tel metro. net SYSTEM SAFETY SECURITY AND OPERATIONS COMMITTEE SEPTEMBER 18,2014 SUBJECT: ACTION: HASTUS SYSTEM v2014 SOFTWARE UPGRADE APPROVE

More information

Available online at www.sciencedirect.com. ScienceDirect. Procedia Computer Science 52 (2015 ) 902 907

Available online at www.sciencedirect.com. ScienceDirect. Procedia Computer Science 52 (2015 ) 902 907 Available online at www.sciencedirect.com ScienceDirect Procedia Computer Science 52 (2015 ) 902 907 The 4th International Workshop on Agent-based Mobility, Traffic and Transportation Models, Methodologies

More information

Route optimization applied to school transports A method combining column generation with greedy heuristics

Route optimization applied to school transports A method combining column generation with greedy heuristics PREPRINT Route optimization applied to school transports A method combining column generation with greedy heuristics Mikael Andersson Peter Lindroth Department of Mathematics CHALMERS UNIVERSITY OF TECHNOLOGY

More information

Heuristic and exact algorithms for vehicle routing problems. Stefan Ropke

Heuristic and exact algorithms for vehicle routing problems. Stefan Ropke Heuristic and exact algorithms for vehicle routing problems Stefan Ropke December 2005 Preface This Ph.D. thesis has been prepared at the Department of Computer Science at the University of Copenhagen

More information

Improved Load Plan Design Through Integer Programming Based Local Search

Improved Load Plan Design Through Integer Programming Based Local Search Improved Load Plan Design Through Integer Programming Based Local Search Alan Erera 1, Michael Hewitt 2, Martin Savelsbergh 3, and Yang Zhang 1 1 School of Industrial and Systems Engineering, Georgia Institute

More information

LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES

LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES LECTURE - 3 RESOURCE AND WORKFORCE SCHEDULING IN SERVICES Learning objective To explain various work shift scheduling methods for service sector. 8.9 Workforce Management Workforce management deals in

More information

Title: Integrating Management of Truck and Rail Systems in LA. INTERIM REPORT August 2015

Title: Integrating Management of Truck and Rail Systems in LA. INTERIM REPORT August 2015 Title: Integrating Management of Truck and Rail Systems in LA Project Number: 3.1a Year: 2013-2017 INTERIM REPORT August 2015 Principal Investigator Maged Dessouky Researcher Lunce Fu MetroFreight Center

More information

P13 Route Plan. E216 Distribution &Transportation

P13 Route Plan. E216 Distribution &Transportation P13 Route Plan Vehicle Routing Problem (VRP) Principles of Good Routing Technologies to enhance Vehicle Routing Real-Life Application of Vehicle Routing E216 Distribution &Transportation Vehicle Routing

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

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

COORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN ABSTRACT

COORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN ABSTRACT Technical Report #98T-010, Department of Industrial & Mfg. Systems Egnieering, Lehigh Univerisity (1998) COORDINATION PRODUCTION AND TRANSPORTATION SCHEDULING IN THE SUPPLY CHAIN Kadir Ertogral, S. David

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

Solving Train Schedule Design Problems using Decomposition and Network Flows

Solving Train Schedule Design Problems using Decomposition and Network Flows Solving Train Schedule Design Problems using Decomposition and Network Flows Ravindra K. Ahuja, President ravi@innovativescheduling.com +1-352-870-8401 Collaborators Development Partnership with BNSF Architects

More information

New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem

New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem New Exact Solution Approaches for the Split Delivery Vehicle Routing Problem Gizem Ozbaygin, Oya Karasan and Hande Yaman Department of Industrial Engineering, Bilkent University, Ankara, Turkey ozbaygin,

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

HAMPTON ROADS TRANSIT: Service and Schedule Efficiency Review

HAMPTON ROADS TRANSIT: Service and Schedule Efficiency Review HAMPTON ROADS TRANSIT: Service and Schedule Efficiency Review FINAL REPORT Table of Contents EXECUTIVE SUMMARY... 1 CHAPTER 1: SCHEDULE SCENARIO AND SCOPING TESTING...9 1.1 PURPOSE... 9 1.2 METHODOLOGY...

More information

Making the Yellow Angels Fly: Online Dispatching Of Service Vehicles in Real Time

Making the Yellow Angels Fly: Online Dispatching Of Service Vehicles in Real Time Konrad-Zuse-Zentrum für Informationstechnik Berlin Takustraße 7 D-14195 Berlin-Dahlem Germany MARTIN GRÖTSCHEL SVEN O. KRUMKE JÖRG RAMBAU LUIS M. TORRES Making the Yellow Angels Fly: Online Dispatching

More information

On a Railway Maintenance Scheduling Problem with Customer Costs and Multi-Depots

On a Railway Maintenance Scheduling Problem with Customer Costs and Multi-Depots Als Manuskript gedruckt Technische Universität Dresden Herausgeber: Der Rektor On a Railway Maintenance Scheduling Problem with Customer Costs and Multi-Depots F. Heinicke (1), A. Simroth (1), G. Scheithauer

More information

Scheduling Shop Scheduling. Tim Nieberg

Scheduling Shop Scheduling. Tim Nieberg Scheduling Shop Scheduling Tim Nieberg Shop models: General Introduction Remark: Consider non preemptive problems with regular objectives Notation Shop Problems: m machines, n jobs 1,..., n operations

More information

Service Network Design for Consolidation Freight Carriers

Service Network Design for Consolidation Freight Carriers Service Network Design for Consolidation Freight Carriers Teodor Gabriel Crainic ESG UQAM & CIRRELT - CRT CIRRELT Consolidation Freight Transportation Long distance freight transportation Railways Less-Than-Truckload

More information

An optimization model for aircraft maintenance scheduling and re-assignment

An optimization model for aircraft maintenance scheduling and re-assignment Transportation Research Part A 37 (2003) 29 48 www.elsevier.com/locate/tra An optimization model for aircraft maintenance scheduling and re-assignment Chellappan Sriram 1, Ali Haghani * Department of Civil

More information

This paper introduces a new method for shift scheduling in multiskill call centers. The method consists of

This paper introduces a new method for shift scheduling in multiskill call centers. The method consists of MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol. 10, No. 3, Summer 2008, pp. 411 420 issn 1523-4614 eissn 1526-5498 08 1003 0411 informs doi 10.1287/msom.1070.0172 2008 INFORMS Simple Methods for Shift

More information

A Decision Support System for Crew Planning in Passenger Transportation using a Flexible Branch-and-Price Algorithm

A Decision Support System for Crew Planning in Passenger Transportation using a Flexible Branch-and-Price Algorithm A Decision Support System for Crew Planning in Passenger Transportation using a Flexible Branch-and-Price Algorithm RICHARD FRELING 1, 2*, RAMON M. LENTINK 1, 2 AND ALBERT P.M. WAGELMANS 1 1 Erasmus Center

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

Scheduling and Routing Milk from Farm to Processors by a Cooperative

Scheduling and Routing Milk from Farm to Processors by a Cooperative Journal of Agribusiness 22,2(Fall 2004):93S106 2004 Agricultural Economics Association of Georgia Scheduling and Routing Milk from Farm to Processors by a Cooperative Peerapon Prasertsri and Richard L.

More information

Transmodel in UML. SITP 2 Système d'information Transport Public

Transmodel in UML. SITP 2 Système d'information Transport Public Transmodel in UML Equipe de projet Page 0 Version 0. 04/09/2003 Contents. Introduction... 2. Class diagrams... 3 2.. Network description... 3 2... CD TM Fig. 0 Points and Links... 3 2..2. CD TM Fig. 02

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

MODELLING FRAMEWORK AND SOFTWARE TOOLS FOR CITY LOGISTICS PLANNING AND OPERATIONS

MODELLING FRAMEWORK AND SOFTWARE TOOLS FOR CITY LOGISTICS PLANNING AND OPERATIONS MODELLING FRAMEWORK AND SOFTWARE TOOLS FOR CITY LOGISTICS PLANNING AND OPERATIONS Gaetano Fusco Università di Roma La Sapienza, Dipartimento Idraulica Trasporti e Strade. Maria Pia Valentini ENEA, ENE/TEC,

More information

A Column Generation Model for Truck Routing in the Chilean Forest Industry

A Column Generation Model for Truck Routing in the Chilean Forest Industry A Column Generation Model for Truck Routing in the Chilean Forest Industry Pablo A. Rey Escuela de Ingeniería Industrial, Facultad de Ingeniería, Universidad Diego Portales, Santiago, Chile, e-mail: pablo.rey@udp.cl

More information

Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes

Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Un algorithme génétique hybride à gestion adaptative de diversité pour le problème de tournées de véhicules et ses variantes Thibaut VIDAL LOSI et CIRRELT Université de Technologie de Troyes et Université

More information

High Performance Computing for Operation Research

High Performance Computing for Operation Research High Performance Computing for Operation Research IEF - Paris Sud University claude.tadonki@u-psud.fr INRIA-Alchemy seminar, Thursday March 17 Research topics Fundamental Aspects of Algorithms and Complexity

More information

A MIXED INTEGER PROGRAMMING FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS: A CASE STUDY OF A THAI SEASONING COMPANY. Abstract

A MIXED INTEGER PROGRAMMING FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS: A CASE STUDY OF A THAI SEASONING COMPANY. Abstract A MIXED INTEGER PROGRAMMING FOR A VEHICLE ROUTING PROBLEM WITH TIME WINDOWS: A CASE STUDY OF A THAI SEASONING COMPANY Supanat Suwansusamran 1 and Pornthipa Ongunaru 2 Department of Agro-Industrial Technology,

More information

Transvision Waste Planner

Transvision Waste Planner Transvision Waste Planner Improving waste collection and transport efficiency TRANSVISION WASTE PLANNER facilitates major cost savings and impressive CO 2 emission reductions in your waste collection and

More information

Improving public transport decision making, planning and operations by using Big Data

Improving public transport decision making, planning and operations by using Big Data Improving public transport decision making, planning and operations by using Big Data Cases from Sweden and the Netherlands dr. ir. N. van Oort dr. Oded Cats Assistant professor public transport Assistant

More information

English. Trapeze Rail System. www.trapezegroup.com

English. Trapeze Rail System. www.trapezegroup.com English Trapeze Rail System www.trapezegroup.com Trapeze Rail System Enabling future railway, tram and metro transport The worldwide growth in demand for travel and increasing competition between all modes

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction Intermodal freight transportation describes the movement of goods in standardized loading units (e.g., containers) by at least two transportation modes (rail, maritime, and road)

More information

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents

Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Meta-Heuristics for Reconstructing Cross Cut Shredded Text Documents Matthias Prandtstetter Günther R. Raidl Institute of Computer Graphics and Algorithms Vienna University of Technology, Austria www.ads.tuwien.ac.at

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

The Problem of Scheduling Technicians and Interventions in a Telecommunications Company

The Problem of Scheduling Technicians and Interventions in a Telecommunications Company The Problem of Scheduling Technicians and Interventions in a Telecommunications Company Sérgio Garcia Panzo Dongala November 2008 Abstract In 2007 the challenge organized by the French Society of Operational

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

Residential waste management in South Africa: Optimisation of vehicle fleet size and composition

Residential waste management in South Africa: Optimisation of vehicle fleet size and composition Residential waste management in South Africa: Optimisation of vehicle fleet size and composition by Wouter H Bothma 26001447 Submitted in partial fulfillment of the requirements for the degree of Bachelors

More information

A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions

A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions A Branch-Cut-and-Price Approach to the Bus Evacuation Problem with Integrated Collection Point and Shelter Decisions Marc Goerigk, Bob Grün, and Philipp Heßler Fachbereich Mathematik, Technische Universität

More information

INTERACTIVE TRAINING SOFTWARE FOR OPTIMUM TRAVEL ROUTE ANALYSIS APPLICATIONS IN RAILWAY NETWORKS

INTERACTIVE TRAINING SOFTWARE FOR OPTIMUM TRAVEL ROUTE ANALYSIS APPLICATIONS IN RAILWAY NETWORKS 1. Uluslar arası Raylı Sistemler Mühendisliği Çalıştayı (IWRSE 12), 11-13 Ekim 2012, Karabük, Türkiye INTERACTIVE TRAINING SOFTWARE FOR OPTIMUM TRAVEL ROUTE ANALYSIS APPLICATIONS IN RAILWAY NETWORKS Abstract

More information

Solving the Vehicle Routing Problem with Genetic Algorithms

Solving the Vehicle Routing Problem with Genetic Algorithms Solving the Vehicle Routing Problem with Genetic Algorithms Áslaug Sóley Bjarnadóttir April 2004 Informatics and Mathematical Modelling, IMM Technical University of Denmark, DTU Printed by IMM, DTU 3 Preface

More information

An Integer Programming Model for the School Timetabling Problem

An Integer Programming Model for the School Timetabling Problem An Integer Programming Model for the School Timetabling Problem Geraldo Ribeiro Filho UNISUZ/IPTI Av. São Luiz, 86 cj 192 01046-000 - República - São Paulo SP Brazil Luiz Antonio Nogueira Lorena LAC/INPE

More information

OPTIMIZED STAFF SCHEDULING AT SWISSPORT

OPTIMIZED STAFF SCHEDULING AT SWISSPORT Gurobi User Conference, Frankfurt, 01.02.2016 OPTIMIZED STAFF SCHEDULING AT SWISSPORT Prof. Dr. Andreas Klinkert Dr. Peter Fusek Dipl. Ing. Roman Berner Rita Thalmann Simona Segessenmann Zurich University

More information

Algorithm Design and Analysis

Algorithm Design and Analysis Algorithm Design and Analysis LECTURE 27 Approximation Algorithms Load Balancing Weighted Vertex Cover Reminder: Fill out SRTEs online Don t forget to click submit Sofya Raskhodnikova 12/6/2011 S. Raskhodnikova;

More information

ivu. integrated RESOuRCE PLANNiNG

ivu. integrated RESOuRCE PLANNiNG ivu.rail integrated RESOuRCE PLANNiNG IVU MAKES INTEGRATED RESOURCE PLANNING POSSIBLE AND EASY. All planning and dispatching processes for personnel and vehicle deployment in a universal system. The deployment

More information

A DECISION SUPPORT SYSTEM FOR TIMETABLE ADJUSTMENTS

A DECISION SUPPORT SYSTEM FOR TIMETABLE ADJUSTMENTS A DECISION SUPPORT SYSTEM FOR TIMETABLE ADJUSTMENTS João Mendes-Moreira Dept. of Informatics Engineering, Faculty of Engineering, University of Porto, Portugal LIAAD-INESC Porto L.A., Portugal E-mail:

More information

Industrial Optimization

Industrial Optimization Industrial Optimization Lessons learned from Optimization in Practice Marco Lübbecke Chair of Operations Research RWTH Aachen University, Germany SICS Stockholm Feb 11, 2013 Discrete Optimization: Some

More information

Intermodal Transportation

Intermodal Transportation Intermodal Transportation Teodor Gabriel Crainic ESG UQAM & CIRRELT - CRT CIRRELT Plan What are we talking about? Container-based intermodal transportation System design (location) Fleet Management (empties)

More information

Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry

Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry Freight Sequencing to Improve Hub Operations in the Less-Than-Truckload Freight Transportation Industry Xiangshang Tong, Ph.D. Menlo Worldwide Logistics Kimberly Ellis, Ph.D. Virginia Tech Amy Brown Greer

More information

VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul.

VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK. Kuladej Panapinun and Peerayuth Charnsethikul. 1 VEHICLE ROUTING AND SCHEDULING PROBLEMS: A CASE STUDY OF FOOD DISTRIBUTION IN GREATER BANGKOK By Kuladej Panapinun and Peerayuth Charnsethikul Abstract Vehicle routing problem (VRP) and its extension

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

Liner Shipping Revenue Management with Respositioning of Empty Containers

Liner Shipping Revenue Management with Respositioning of Empty Containers Liner Shipping Revenue Management with Respositioning of Empty Containers Berit Løfstedt David Pisinger Simon Spoorendonk Technical Report no. 08-15 ISSN: 0107-8283 Dept. of Computer Science University

More information

INTEGRATION OF OR AND MPC TECHNIQUES TO THE BIOMASS

INTEGRATION OF OR AND MPC TECHNIQUES TO THE BIOMASS INTEGRATION OF OR AND MPC TECHNIQUES TO THE BIOMASS SUPPLY CHAIN FOR ENERGY PRODUCTION Tatiana M. Pinho 1,2, Bruno Oliveira 2, Dmitry Podpokaev 3, Jussi Rasinmäki 3, Alexandra Marques 2, J. Boaventura-Cunha

More information

The Service Optimization Challenge Business Paper

The Service Optimization Challenge Business Paper The Service Optimization Challenge Business Paper Table of Contents Introduction............................................2 The Service Optimization Challenge.......................... 3 Avoiding Losses

More information

Staff scheduling and rostering: A review of applications, methods and models

Staff scheduling and rostering: A review of applications, methods and models European Journal of Operational Research 153 (2004) 3 27 www.elsevier.com/locate/dsw Staff scheduling and rostering: A review of applications, methods and models A.T. Ernst, H. Jiang, M. Krishnamoorthy

More information

A Constraint Programming based Column Generation Approach to Nurse Rostering Problems

A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Abstract A Constraint Programming based Column Generation Approach to Nurse Rostering Problems Fang He and Rong Qu The Automated Scheduling, Optimisation and Planning (ASAP) Group School of Computer Science,

More information

WE DELIVER YOUR SUCCESS. WORLDWIDE

WE DELIVER YOUR SUCCESS. WORLDWIDE DHL Global Mail WE DELIVER YOUR SUCCESS. WORLDWIDE Deutsche Post AG Head Office Global Mail 53250 Bonn Germany DHL Global Mail: your full service provider of international postal solutions. www.dhl-globalmail.com

More information

Railway rolling stock is one of the most significant cost components for operators of passenger trains. The

Railway rolling stock is one of the most significant cost components for operators of passenger trains. The TRANSPORTATION SCIENCE Vol. 0, No., August 2006, pp. 78 91 issn 001-1655 eissn 1526-57 06 00 078 informs doi 10.1287/trsc.1060.0155 2006 INFORMS Efficient Circulation of Railway Rolling Stock Arianna Alfieri

More information

Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms

Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms Software Framework for Vehicle Routing Problem with Hybrid Metaheuristic Algorithms S.MASROM 1, A.M. NASIR 2 Malaysia Institute of Transport (MITRANS) Faculty of Computer and Mathematical Science Universiti

More information

A new Branch-and-Price Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France

A new Branch-and-Price Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France A new Branch-and-Price Algorithm for the Traveling Tournament Problem (TTP) Column Generation 2008, Aussois, France Stefan Irnich 1 sirnich@or.rwth-aachen.de RWTH Aachen University Deutsche Post Endowed

More information

A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM

A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM Computing and Informatics, Vol. 30, 2011, 721 732 A CENTROID-BASED HEURISTIC ALGORITHM FOR THE CAPACITATED VEHICLE ROUTING PROBLEM Kwangcheol Shin Department of Computer Science Korea Advanced Institute

More information

RandstadRail: Increase in Public Transport Quality by Controlling Operations

RandstadRail: Increase in Public Transport Quality by Controlling Operations RandstadRail: Increase in Public Transport Quality by Controlling Operations Niels van Oort HTM, Urban public transport, Research and development P.O. Box 28503, 2502 KM The Hague, The Netherlands, e-mail:

More information