Grant: Discovery Grants Program - Individual
Simon Fraser University
$19,000.00
Large-scale discrete optimization: theory and future vehicle routing applications
EF 2014-15
Résumé
What does the following management problems have in common: a) Deciding in which order a futuristic mobile space gas station would visit satellites, b) Scheduling surgeries, c) Making environmentally-friendly decisions on the medical lab sample transportation that meets the deadlines? In mathematics and operations research, they are known as discrete optimization problems. Discrete optimization problems arise in all areas of industry, public services, and government, and luckily there exists a large body of related research with significant achievements. However, these practical problems can be hard, dynamic, and of large-scale, and not always solvable in a reasonable time. My research program proposes improvements of theoretical knowledge and advancements to approaches for solving large-scale discrete optimization problems, in static and dynamic settings. The main topics are: (1) model-based hybrid metaheursitics, (2) time-constrained routing, and (3) future vehicle routing applications related to climate change and space industry. The program objectives are: i) design of metaheuristics that use general-purpose integer program solvers for neighborhood searches; ii) exploration of objective functions specifically tailored to dynamic problems; iii) improvement of pickup and delivery services by transshipment; iv) characterization of hard-to-solve instances of time-constrained routing problems; v) exploration of graphs for modeling problems with time and space dimensions; and vi) modeling complex real-world application with large number of technical constraints. The proposed topics represent continuation of my previous research whose results have been published in top scientific journals. Since this proposal tackles real-world applications related to transportation, space industry, and environment, the research results will have impact on our modern-day society. For example, appropriately solving non-emergency transportation in the public services may increase Canada's chances of reducing greenhouse gas emission to reach the Kyoto agreement targets. My research program will contribute to the advanced training of HQP, by having them pursue challenging theoretical research and solve complex practical problems.
Programme
Discovery Grants Program - Individual
Bénéficiaire
Emplacement
British Columbia, Canada
Type de bénéficiaire
Academia
Type
Grant
Source
NSERC's Awards Data
Tel que publié
Application id
355398-2011
Name nom
MitrovicMinic, Snezana
Department département
Mathematics
Organization id
5
Institution établissement
Simon Fraser University
Province en
British Columbia
Province fr
Colombie-Britannique
Country en
CANADA
Country fr
CANADA
Fiscal year exercice financier
2014
Competition year année de concours
2011
Award amount
19000
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
4
Nb partie
5
Application title
Large-scale discrete optimization: theory and future vehicle routing applications
Keyword
NSERC
Application summary
What does the following management problems have in common: a) Deciding in which order a futuristic mobile space gas station would visit satellites, b) Scheduling surgeries, c) Making environmentally-friendly decisions on the medical lab sample transportation that meets the deadlines? In mathematics and operations research, they are known as discrete optimization problems. Discrete optimization problems arise in all areas of industry, public services, and government, and luckily there exists a large body of related research with significant achievements. However, these practical problems can be hard, dynamic, and of large-scale, and not always solvable in a reasonable time. My research program proposes improvements of theoretical knowledge and advancements to approaches for solving large-scale discrete optimization problems, in static and dynamic settings. The main topics are: (1) model-based hybrid metaheursitics, (2) time-constrained routing, and (3) future vehicle routing applications related to climate change and space industry. The program objectives are: i) design of metaheuristics that use general-purpose integer program solvers for neighborhood searches; ii) exploration of objective functions specifically tailored to dynamic problems; iii) improvement of pickup and delivery services by transshipment; iv) characterization of hard-to-solve instances of time-constrained routing problems; v) exploration of graphs for modeling problems with time and space dimensions; and vi) modeling complex real-world application with large number of technical constraints. The proposed topics represent continuation of my previous research whose results have been published in top scientific journals. Since this proposal tackles real-world applications related to transportation, space industry, and environment, the research results will have impact on our modern-day society. For example, appropriately solving non-emergency transportation in the public services may increase Canada's chances of reducing greenhouse gas emission to reach the Kyoto agreement targets. My research program will contribute to the advanced training of HQP, by having them pursue challenging theoretical research and solve complex practical problems.