Grant: Discovery Grants Program - Individual
École Polytechnique de Montréal
$45,000.00
Constraint Programming Approaches to Integrated Scheduling and Transportation Problems
EF 2015-16
Résumé
It is common in the service industry for managers in different departments, using different tools, to solve planning problems in silos. Each of them concentrates on one piece of the puzzle, often ignoring the global picture.
This behaviour is seen in large retail companies where human resources, inventory movement, and transportation are planned separately; healthcare organizations where the schedules for physicians, nurses, rooms, and patients are assembled by different people; and transportation networks where the opportunity for backhauling during operations is often lost because of myopic tactical planning. Moreover, new mobile technology is changing the business paradigm of many of these organizations. Multi-channel retailing is becoming increasingly important as more and more customers order online. Data collected in real time will soon allow many different organizations (such as public transit firms) to react instantly to changing trends and to adapt their offers accordingly. In healthcare, personalized medicine is knocking at the door.
The challenges that lie ahead are thus numerous: i) Given the tremendous amounts of data that will be available, appropriate system performance measures will need to be developed and handled by optimization engines; ii) decision problems will need to be more integrated along the time line, e.g., strategic and tactical plans will need to take into account operational constraints and foresee real-time adjustments; iii) decision models will need to account for uncertainty because the available data can be incomplete or inaccurate. To tackle these challenges, the proposed research program will develop new methodology, built around rich combinatorial structures and their use within operations research methods, to solve large, integrated, and stochastic decision problems. I will target personnel scheduling, the planning and scheduling of transportation, and healthcare logistics.
We have already developed methodology for complex and integrated personnel scheduling problems. These approaches will be extended by the development of new techniques that capture more complex contexts and thus allow us to integrate different decision problems. Finally, the rich internal structures will be able to capture the combined probability distribution of a series of events, and thus we will be able to use these techniques within a stochastic programming approach.
We will base our methodological development on constraint programming, which we have found to be useful for many mixed integer nonlinear problems. I want to investigate this approach further to take advantage of its strong inference mechanism and to develop ""learning during search"" methods for difficult nonlinear problems, such as those where the objective function is obtained through data mining.
The novelty of this proposal thus lies in the use of rich combinatorial structures in flexible constraint programming approaches. These new techniques will allow us to integrate different optimization problems that are part of the same global decision process, while taking into account uncertainty and real-time decision-making.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
Quebec, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
RGPIN-2014-03968
Name nom
Rousseau, LouisMartin
Department département
Mathématiques et génie industriel
Organization id
64
Institution établissement
École Polytechnique de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2015
Competition year année de concours
2014
Award amount
45000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
Discovery grants programs
Group fr
Programmes de subventions à la découverte
Committee code
1509
Committee name en
Civil, Industrial and Systems Engineering
Committee name fr
Génie civil, industriel et des systèmes
Area of application code
700
Area of application group en
Transportation systems and services
Area of application group fr
Services et systèmes de transport
Area of application en
Transportation systems and services
Area of application fr
Services et systèmes de transport
Research subject code
1601
Research subject group en
Industrial engineering
Research subject group fr
Génie industriel
Research subject en
Operations research and management science
Research subject fr
Recherche opérationnelle et science de la gestion
Partie
2
Nb partie
5
Application title
Constraint Programming Approaches to Integrated Scheduling and Transportation Problems
Keyword
NSERC
Application summary
It is common in the service industry for managers in different departments, using different tools, to solve planning problems in silos. Each of them concentrates on one piece of the puzzle, often ignoring the global picture.
This behaviour is seen in large retail companies where human resources, inventory movement, and transportation are planned separately; healthcare organizations where the schedules for physicians, nurses, rooms, and patients are assembled by different people; and transportation networks where the opportunity for backhauling during operations is often lost because of myopic tactical planning. Moreover, new mobile technology is changing the business paradigm of many of these organizations. Multi-channel retailing is becoming increasingly important as more and more customers order online. Data collected in real time will soon allow many different organizations (such as public transit firms) to react instantly to changing trends and to adapt their offers accordingly. In healthcare, personalized medicine is knocking at the door.
The challenges that lie ahead are thus numerous: i) Given the tremendous amounts of data that will be available, appropriate system performance measures will need to be developed and handled by optimization engines; ii) decision problems will need to be more integrated along the time line, e.g., strategic and tactical plans will need to take into account operational constraints and foresee real-time adjustments; iii) decision models will need to account for uncertainty because the available data can be incomplete or inaccurate. To tackle these challenges, the proposed research program will develop new methodology, built around rich combinatorial structures and their use within operations research methods, to solve large, integrated, and stochastic decision problems. I will target personnel scheduling, the planning and scheduling of transportation, and healthcare logistics.
We have already developed methodology for complex and integrated personnel scheduling problems. These approaches will be extended by the development of new techniques that capture more complex contexts and thus allow us to integrate different decision problems. Finally, the rich internal structures will be able to capture the combined probability distribution of a series of events, and thus we will be able to use these techniques within a stochastic programming approach.
We will base our methodological development on constraint programming, which we have found to be useful for many mixed integer nonlinear problems. I want to investigate this approach further to take advantage of its strong inference mechanism and to develop ""learning during search"" methods for difficult nonlinear problems, such as those where the objective function is obtained through data mining.
The novelty of this proposal thus lies in the use of rich combinatorial structures in flexible constraint programming approaches. These new techniques will allow us to integrate different optimization problems that are part of the same global decision process, while taking into account uncertainty and real-time decision-making.