Canada Spends Logo

Explore our Budget 2026 analysis

Grant: Discovery Grants Program - Individual

Université de Montréal

$71,000.00

Large-Scale Combinatorial and Network Optimization

FY 2019-20

Summary
This research program is dedicated to the development of novel methods for solving large-scale combinatorial optimization problems, in particular those formulated in terms of networks. Such problems give rise to models that are difficult to solve, even using state-of-the-art optimization tools. Hence, we will develop specialized methods based on the latest advances in operations research. This research program aims to pursue and intensify the continued efforts of the applicant in developing methods for solving large-scale, difficult, combinatorial optimization problems. The long-term vision is driven by the objective of bridging the gaps between theory, methodology and algorithm implementation, thus leading to successful transfer and use of the proposed methods in real applications. In particular, the long-term goals of this research program are: 1) increase our capacity to solve large-scale combinatorial optimization problems; 2) expand the applicability of large-scale combinatorial optimization methods; 3) develop a unifying generic methodology to integrate supply optimization and demand analysis; 4) exploit knowledge to solve real applications. Our research on combinatorial optimization is driven by real applications, mostly in the area of logistics and transportation. These include applications of network design and facility location models in freight distribution and safety/security in transportation, as well as applications of staff scheduling in retail services, all of prime importance for the Canadian economy. Our ultimate goal is to provide practical solutions to end-users of these applications by developing advanced models and methods.
Program
Discovery Grants Program - Individual
Location
Quebec, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data

As published

Application id
RGPIN-2017-06054
Name nom
Gendron, Bernard
Department département
Recherche sur les transports, Centre de
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
2019
Competition year année de concours
2017
Award amount
71000
Program id
RGPIN
Program name en
Discovery Grants Program - Individual
Program name fr
Programme de subventions à la découverte - individuelles
Group en
DISCOVERY RESEARCH
Group fr
RECHERCHE AXÉE SUR 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
Installment
inst:3 - 5
Partie
3
Nb partie
5
Application title
Large-Scale Combinatorial and Network Optimization
Keyword
NSERC
Application summary
This research program is dedicated to the development of novel methods for solving large-scale combinatorial optimization problems, in particular those formulated in terms of networks. Such problems give rise to models that are difficult to solve, even using state-of-the-art optimization tools. Hence, we will develop specialized methods based on the latest advances in operations research. This research program aims to pursue and intensify the continued efforts of the applicant in developing methods for solving large-scale, difficult, combinatorial optimization problems. The long-term vision is driven by the objective of bridging the gaps between theory, methodology and algorithm implementation, thus leading to successful transfer and use of the proposed methods in real applications. In particular, the long-term goals of this research program are: 1) increase our capacity to solve large-scale combinatorial optimization problems; 2) expand the applicability of large-scale combinatorial optimization methods; 3) develop a unifying generic methodology to integrate supply optimization and demand analysis; 4) exploit knowledge to solve real applications. Our research on combinatorial optimization is driven by real applications, mostly in the area of logistics and transportation. These include applications of network design and facility location models in freight distribution and safety/security in transportation, as well as applications of staff scheduling in retail services, all of prime importance for the Canadian economy. Our ultimate goal is to provide practical solutions to end-users of these applications by developing advanced models and methods.
Université de Montréal - $71,000 Grant (2019-20) | Canada Spends