CREW SCHEDULING Past and Future Jacques Desrosiers HEC & GERAD Montréal, Canada.

Slides:



Advertisements
Similar presentations
Personnel and Vehicle Scheduling
Advertisements

1 Outline relationship among topics secrets LP with upper bounds by Simplex method basic feasible solution (BFS) by Simplex method for bounded variables.
BUS AND DRIVER SCHEDULING IN URBAN MASS TRANSIT SYSTEMS Guy Desaulniers GERAD Research Center Ecole Polytechnique Montréal Travel and Transportation Workshop.
1 Branch-and-Price (Column Generation) Solving Integer Programs With a Huge Number of Variables CP-AI-OR02 School on Optimization Le Croisic, France March.
Column Generation: Theory, Algorithms and Applications Dr Natashia Boland Department of Mathematics and Statistics The University of Melbourne.
Chapter 3 Workforce scheduling.
Leena Suhl University of Paderborn, Germany
Electrical and Computer Engineering Mississippi State University
Gomory’s cutting plane algorithm for integer programming Prepared by Shin-ichi Tanigawa.
Column Generation n ENGG 6070 n Instructor: Shawki M Areibi n Students: Limin Ma, Hao Qin.
Progress in Linear Programming Based Branch-and-Bound Algorithms
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
Crew Scheduling Housos Efthymios, Professor Computer Systems Laboratory (CSL) Electrical & Computer Engineering University of Patras.
System design-related Optimization problems Michela Milano Joint work DEIS Università di Bologna Dip. Ingegneria Università di Ferrara STI Università di.
Supply Chain Design Problem Tuukka Puranen Postgraduate Seminar in Information Technology Wednesday, March 26, 2009.
Computer Algorithms Integer Programming ECE 665 Professor Maciej Ciesielski By DFG.
1 A Second Stage Network Recourse Problem in Stochastic Airline Crew Scheduling Joyce W. Yen University of Michigan John R. Birge Northwestern University.
ALTITUDE 1 Le partenariat Universités - Entreprises Un problème générique Plus court chemin avec fenêtres de temps Un peu d’histoire...
1 Planning and Scheduling to Minimize Tardiness John Hooker Carnegie Mellon University September 2005.
1 Contents college 3 en 4 Book: Appendix A.1, A.3, A.4, §3.4, §3.5, §4.1, §4.2, §4.4, §4.6 (not: §3.6 - §3.8, §4.2 - §4.3) Extra literature on resource.
CS541 Advanced Networking 1 Introduction to Optimization Neil Tang 2/23/2009.
Airline Schedule Planning: Accomplishments and Opportunities Airline Schedule Planning: Accomplishments and Opportunities C. Barnhart and A. Cohn, 2004.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
LOGO AAIA’2012 \ WCO’ – 12 september, 2012 S. Deleplanque, A. Quilliot. LIMOS, CNRS, BLAISE PASCAL UNIVERSITY, Clermont-Ferrand (FRANCE) Wrocław,
11/26/ J/ESD.204J1 Transit Crew Scheduling Outline Crew Scheduling Work Rules and Policies Model Formulation Matching Problem Approximation approach.
1.3 Modeling with exponentially many constr.  Some strong formulations (or even formulation itself) may involve exponentially many constraints (cutting.
Column Generation Approach for Operating Rooms Planning Mehdi LAMIRI, Xiaolan XIE and ZHANG Shuguang Industrial Engineering and Computer Sciences Division.
Group Construction for Cabin Crew Comparing Constraint Programming with Branch&Price Presentation at SweConsNet 2005 Jesper Hansen Carmen Systems AB
Optimized Search Heuristics: a Survey Susana Fernandes Universidade do Algarve Faro, Portugal Helena Ramalhinho Lourenço Universitat Pompeu.
Linear Programming Chapter 6. Large Scale Optimization.
Stabilized column generation  Classical column generation often very slow.  Slow convergence (tailing-off effect)  Poor columns in initial stages (head-in.
MILP algorithms: branch-and-bound and branch-and-cut
Method of Column Generation Used in IP Jan Pelikán, Jan Fábry ___________________________________________________________________________ MME 2004, Brno.
Jacques Desrosiers Ecole des HEC & GERAD
Optimal Fueling Strategies for Locomotive Fleets in Railroad Networks Seyed Mohammad Nourbakhsh Yanfeng Ouyang 1 William W. Hay Railroad Engineering Seminar.
“LOGISTICS MODELS” Andrés Weintraub P
Column Generation By Soumitra Pal Under the guidance of Prof. A. G. Ranade.
Stabilized column generation  Classical column generation often very slow.  Slow convergence (tailing-off effect)  Poor columns in initial stages (head-in.
Integer Programming (정수계획법)
Lagrangean Relaxation
EMIS 8373: Integer Programming Column Generation updated 12 April 2005.
Dominance and Indifference in Airline Planning Decisions NEXTOR Conference: INFORMS Aviation Session June 2 – 5, 2003 Amy Mainville Cohn, KoMing Liu, and.
Airline Optimization Problems Constraint Technologies International
IE 312 Review 1. The Process 2 Problem Model Conclusions Problem Formulation Analysis.
Linear Programming Chapter 1 Introduction.
The integrated dial-a-ride problem with timetabled fixed route service Marcus Posada, Henrik Andersson and Carl Henrik Häll.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
Constructing Robust Crew Schedules with Bicriteria Optimisation
6.5 Stochastic Prog. and Benders’ decomposition
EMGT 6412/MATH 6665 Mathematical Programming Spring 2016
1.206J/16.77J/ESD.215J Airline Schedule Planning
EMIS 8373: Integer Programming
Manpower Planning: Task Scheduling
1.3 Modeling with exponentially many constr.
1.206J/16.77J/ESD.215J Airline Schedule Planning
Chapter 6. Large Scale Optimization
1.206J/16.77J/ESD.215J Airline Schedule Planning
Integer Programming (정수계획법)
1.206J/16.77J/ESD.215J Airline Schedule Planning
Linear Programming and Approximation
Chapter 1. Formulations (BW)
1.3 Modeling with exponentially many constr.
Integer Programming (정수계획법)
6.5 Stochastic Prog. and Benders’ decomposition
Chapter 1. Formulations.
Branch-and-Bound Algorithm for Integer Program
Chapter 6. Large Scale Optimization
Discrete Optimization
Presentation transcript:

CREW SCHEDULING Past and Future Jacques Desrosiers HEC & GERAD Montréal, Canada

Voir la présentation Power Point Crew Sched - Complements.ppt pour deux autres transparents

The Mathematics behind Vehicle Routing and Crew Scheduling Jacques Desrosiers HEC & GERAD Montréal, Canada Canadian Mathematical Society Montréal, December , 1999

OUTLINE  Problem Structure  Solution Approaches  Successful Applications  Research Trends  Conclusions

 PROBLEM STRUCTURE Time-Space Networks Local Schedule Restrictions Task Covering Schedule Composition Non Linear Cost Functions

Time-Space Networks

 SOLUTION APPROACHES Branch & Cut involving... Lagrangean Relaxation Dantzig-Wolfe Decomposition Kelley’s Cutting Plane Method Column Generation

Resource Constrained Shortest Path Problem on G=(N,A) P(N, A) :

Integer Multi-Commodity Network Flow Structure

Crew Scheduling Problems Sub-Problem is Strongly NP- hard Does not possess the Integrality Property Master Problem : Set Partitioning/Covering

Branching & Cutting Decisions Branch-and-Cut Decomposition Process applied at all decision nodes

 SUCCESSFUL APPLICATIONS Vehicle Routing with Time Windows Dial-a-Ride for Physically Disabled Persons Urban Transit Crew Scheduling Multiple Depot Vehicle Scheduling Aircraft Routing Crew Pairing Crew Rostering (Pilots & Flight Attendants) Locomotive and Car Assignment

CREW-OPT BUS-OPT ALTITUDE-Pairings ALTITUDE-Rosters ALTITUDE-PBS RAIL-WAYS The GENCOL Optimizer 60 installations around the world … at the Core of Various Software Systems

 RESEARCH TRENDS Accelerating Techniques Primal - Dual Stabilization Constraint Aggregation Sub-Problem Speed-up Two-level Problems Solved with Benders Decomposition Integer Column Generation with Interior Point Algorithm

Acceleration Techniques Column Generator Master Problem Global Formulation Heuristics Re-Optimizers Pre-Processors …to obtain Primal & Dual Solutions

Acceleration Techniques... Multiple Columns: selected subset close to expected optimal solution Partial Pricing in case of many Sub-Problems Early & Multiple Branching & Cutting: quickly gets local optima Branching & Cutting: on integer variables !

Primal - Dual Stabilization Restricted Dual Perturbed Primal Stabilized Primal

Dual SolutionPrimal Solution Primal SolutionDual Solution Approximate Primal & Dual Primal & Dual Solutions Primal - Dual Stabilization...

Constraint Aggregation Massive Degeneracy on Set Partitioning Problems A pilot covers consecutive flights on the same aircraft A driver covers consecutive legs on the same bus line Aggregate Identical Constraints on Non-zero Variables

Aggregation Algorithm Initial Constraint Aggregation Consider only Compatible Variables Solve Aggregated Master Problem Primal & Aggregated Dual Solutions Dual Variables Split-up Solve Sub-Problem Modify Constraint Aggregation

Sub-Problem Speed-up Resource Constrained Shortest Path Labels at each node : cost, time, load, … Resource Projection Adjust A dynamically Generalized Lagrangian Relaxation Results on Sub-Problem cpu time divided by 5 to 10

Two-Level Problems Benders Decomposition Algorithm for Simultaneous Assignment of Buses and Drivers Aircraft and Pilots Pairings and Rosters Locomotives and Cars

IP(X, Y) for Two-Level Scheduling MIP(X, y) solved using Benders Decomposition Master IP(X) Simplex and B&B(X) Sub-Problem solved by Column Generation MP LP(y) of Set Partitioning SP DP for Constrained Paths B&B(Y) with MIP(X, y) at each node

Benders MP Benders SP B & B IP LP DP CG MP CG SP

Column Generation with Interior Point Algorithm ACCPM Algorithm (Goffin & Vial) Applications Linear Programming Non-Linear Programming Stochastic Programming Variational Inequalities

Integer Column Generation with Interior Point Algorithm Strategic Grant in Geneva –J.-P. Vial et al. Strategic Grant in Montréal –J.-L. Goffin et al. Design of a Commercial Software System

 CONCLUSIONS Larger Problems to Solve Mixing of Decomposition Methods Strong Exact and Heuristic Algorithms Faster Computers Parallel Implementations Still a lot of work to do !!

Some Collaborators Jean-Louis Goffin Pierre Hansen Gilles Savard Marius Solomon François Soumis Jean-Philippe Vial Jean-François Cordeau Michel Denault Guy Desaulniers Daniel Villeneuve