Grant: Discovery Grants Program - Individual
Simon Fraser University
$22,000.00
Resource allocation problems under uncertainty
EF 2019-20
Résumé
Efficiency in modern industrial operations requires that resources be deployed in an optimal manner. This has resulted in extensive work in operations research on resource allocation with a focus on optimal or near-optimal planning.***Resource allocation decisions are very costly and difficult to reverse. Their impact is felt over a long period of time. The parameters, such as cost, demand, and distance, used during the design phase may change over the time period. Researchers have been developing models for resource allocation under uncertainty for decades. The goal of robust optimization is to look for a solution that will work well in the worst case under various possible realizations of the parameters. The random parameters can be either continuous or described by discrete scenarios.******The main objective of our project is to study the problem locating facilities in weighted networks under uncertainty. Our proposal has two parts: (a) min-max regret facility location problems in a tree-like networks, (b) pickup and delivery problem with time window (PDPTW) in road networks.***Facility location problems in tree-like networks have been studied extensively in the past. There are many open problems still to be solved. This proposal suggests a few directions for further studies. PDPTW in general networks is an NP-hard problem. Still this problem is very important in real world. We have built a prototype software for this class of problems. This proposal also identifies a few areas where the enhancing of the existing approaches are needed.****For general networks, very little is known about how to approximate the optimal solution. Many interesting, important results on approximating location problems in general networks are known when the parameters are assumed to be certain. We will explore when the parameters have interval uncertainty.***The research on exactly solving NP-hard optimization problems is intense. The advent of integer programming solver has hastened this progress. We are currently working on a model for general assignment problems. One of our objectives would be to provide structure to the solution approach.***********
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
RGPIN-2016-04031
Name nom
Bhattacharya, Binay
Department département
Computing Science, School of
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
2019
Competition year année de concours
2016
Award amount
22000
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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
Area of application code
801
Area of application group en
Information and communication services
Area of application group fr
Services d'information et de télécommunications
Area of application en
Computer software
Area of application fr
Logiciel
Research subject code
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Installment
inst:4 - 5
Partie
4
Nb partie
5
Application title
Resource allocation problems under uncertainty
Keyword
NSERC
Application summary
Efficiency in modern industrial operations requires that resources be deployed in an optimal manner. This has resulted in extensive work in operations research on resource allocation with a focus on optimal or near-optimal planning.***Resource allocation decisions are very costly and difficult to reverse. Their impact is felt over a long period of time. The parameters, such as cost, demand, and distance, used during the design phase may change over the time period. Researchers have been developing models for resource allocation under uncertainty for decades. The goal of robust optimization is to look for a solution that will work well in the worst case under various possible realizations of the parameters. The random parameters can be either continuous or described by discrete scenarios.******The main objective of our project is to study the problem locating facilities in weighted networks under uncertainty. Our proposal has two parts: (a) min-max regret facility location problems in a tree-like networks, (b) pickup and delivery problem with time window (PDPTW) in road networks.***Facility location problems in tree-like networks have been studied extensively in the past. There are many open problems still to be solved. This proposal suggests a few directions for further studies. PDPTW in general networks is an NP-hard problem. Still this problem is very important in real world. We have built a prototype software for this class of problems. This proposal also identifies a few areas where the enhancing of the existing approaches are needed.****For general networks, very little is known about how to approximate the optimal solution. Many interesting, important results on approximating location problems in general networks are known when the parameters are assumed to be certain. We will explore when the parameters have interval uncertainty.***The research on exactly solving NP-hard optimization problems is intense. The advent of integer programming solver has hastened this progress. We are currently working on a model for general assignment problems. One of our objectives would be to provide structure to the solution approach.***********