Grant: Discovery Grants Program - Individual
Simon Fraser University
$33,000.00
Algorithms for hard discrete optimization problems with linear and quadratic objective functions
FY 2012-13
Summary
The primary objective of the proposed research program is to develop efficient algorithms for solving hard optimization problems arising in the areas of communication, distribution systems, transportation, and resource allocation. An equally important objective is to train highly qualified personnel who could apply cutting-edge techniques within complex optimization projects by optimizing existing procedures and developing viable alternatives. Dissemination of research results through conference presentations and publications in reputable journals are also part of the objectives. Accomplishment of these objectives necessitate the development of new theoretical results, intelligent application of existing results, development of computer programs, and extensive computational and theoretical analysis of algorithms. The investigators research experience and results obtained in the past will be very useful in successfully completing this project. In particular, very large neighbourhood search techniques developed by this investigator along with various collaborators will be a vital design tool for heuristic algorithms we plan to develop. The intended research includes, among others, solving large scale discrete optimization problems with linear and quadratic objectives where special graph theoretic structures serve as feasible solutions. Establishing certificate of optimality for the output of metaheuristics, algorithmic characterization of combinatorial structures, and grid computing based heuristics are other important topics that will be studied. The research program is expected to result in novel solution approaches for problems of interest hitherto unsolved or for solving problems more efficiently and thereby making fundamental contributions to optimization modeling and solution methodologies. By bringing together theoretical and applied research, the project is expected to enhance the efficacy and uses of operations research for socio-economic developments of Canada. Several students will be employed in the project as research associates. These students will receive valuable research training in the areas of optimization modeling, design and analysis of algorithms, and computational testing.
Program
Discovery Grants Program - Individual
Recipient
Location
British Columbia, Canada
Recipient Type
Academia
Type
Grant
Source
NSERC's Awards Data
As published
Application id
170381-2010
Name nom
Punnen, Abraham
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
2012
Competition year année de concours
2010
Award amount
33000
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
520
Area of application group en
Manufacturing processes and products
Area of application group fr
Procédés et produits industriels
Area of application en
Production and operations management
Area of application fr
Production et gestion des opérations
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
3
Nb partie
5
Application title
Algorithms for hard discrete optimization problems with linear and quadratic objective functions
Keyword
NSERC
Application summary
The primary objective of the proposed research program is to develop efficient algorithms for solving hard optimization problems arising in the areas of communication, distribution systems, transportation, and resource allocation. An equally important objective is to train highly qualified personnel who could apply cutting-edge techniques within complex optimization projects by optimizing existing procedures and developing viable alternatives. Dissemination of research results through conference presentations and publications in reputable journals are also part of the objectives. Accomplishment of these objectives necessitate the development of new theoretical results, intelligent application of existing results, development of computer programs, and extensive computational and theoretical analysis of algorithms. The investigators research experience and results obtained in the past will be very useful in successfully completing this project. In particular, very large neighbourhood search techniques developed by this investigator along with various collaborators will be a vital design tool for heuristic algorithms we plan to develop. The intended research includes, among others, solving large scale discrete optimization problems with linear and quadratic objectives where special graph theoretic structures serve as feasible solutions. Establishing certificate of optimality for the output of metaheuristics, algorithmic characterization of combinatorial structures, and grid computing based heuristics are other important topics that will be studied. The research program is expected to result in novel solution approaches for problems of interest hitherto unsolved or for solving problems more efficiently and thereby making fundamental contributions to optimization modeling and solution methodologies. By bringing together theoretical and applied research, the project is expected to enhance the efficacy and uses of operations research for socio-economic developments of Canada. Several students will be employed in the project as research associates. These students will receive valuable research training in the areas of optimization modeling, design and analysis of algorithms, and computational testing.