Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Université de Montréal

$42,000.00

Combinatorial optimization, network design and scheduling

FY 2010-11

Summary
The aim of this research program is to develop novel methods for solving large-scale combinatorial optimization problems, in particular network design and scheduling problems, which have many applications in diverse fields such as logistics, transportation, forestry and healthcare management. Problems in these areas give rise to large-scale mathematical programming formulations that are difficult to solve, even using the best state-of-the-art optimization tools. Hence, we will develop specialized methods based on the latest advances in mixed-integer programming, mathematical decomposition, metaheuristics, constraint programming, and parallel computing. The objectives and expected contributions of this research program are as follows: 1. To study mixed-integer programming formulations for network design problems; 2. To develop decomposition methods for large-scale network design problems; 3. To develop heuristic methods for large-scale network design problems based on metaheuristics principles; 4. To study mixed-integer programming formulations based on formal language theory for scheduling problems; 5. To develop methods based on mixed-integer programming, metaheuristics and constraint programming (in particular, hybrid methods that combine together these different paradigms) for scheduling problems and other related problems (graph coloring and extensions); 6. To develop parallel software libraries for branch-and-bound, metaheuristics, and constraint programming, and to apply them to solve very large-scale combinatorial optimization problems.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
184122-2010
Name nom
Gendron, Bernard
Department département
Informatique et recherche opérationnelle
Organization id
63
Institution établissement
Université de Montréal
Province en
Québec
Province fr
Québec
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2010
Competition year année de concours
2010
Award amount
42000
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
1
Nb partie
5
Application title
Combinatorial optimization, network design and scheduling
Keyword
NSERC
Application summary
The aim of this research program is to develop novel methods for solving large-scale combinatorial optimization problems, in particular network design and scheduling problems, which have many applications in diverse fields such as logistics, transportation, forestry and healthcare management. Problems in these areas give rise to large-scale mathematical programming formulations that are difficult to solve, even using the best state-of-the-art optimization tools. Hence, we will develop specialized methods based on the latest advances in mixed-integer programming, mathematical decomposition, metaheuristics, constraint programming, and parallel computing. The objectives and expected contributions of this research program are as follows: 1. To study mixed-integer programming formulations for network design problems; 2. To develop decomposition methods for large-scale network design problems; 3. To develop heuristic methods for large-scale network design problems based on metaheuristics principles; 4. To study mixed-integer programming formulations based on formal language theory for scheduling problems; 5. To develop methods based on mixed-integer programming, metaheuristics and constraint programming (in particular, hybrid methods that combine together these different paradigms) for scheduling problems and other related problems (graph coloring and extensions); 6. To develop parallel software libraries for branch-and-bound, metaheuristics, and constraint programming, and to apply them to solve very large-scale combinatorial optimization problems.