Grant: Discovery Grants Program - Individual
Simon Fraser University
$24,000.00
Design and analysis of efficient algorithms for location-routing problems
EF 2011-12
Résumé
Efficiency in modern industrial operations requires that resources be deployed in optimal manner. This has resulted in extensive work in operations research on resource allocation with a focus optimal or near optimal planning. I propose to study algorithmic aspects of a combinatorial problem called location routing problem. Location-routing research area encompasses the classical facility location and routing areas. The location of service providers is often influenced by transport costs. Clearly, dealing this problem separately, will often result in suboptimal algorithm. There are a host pf practical industrial problems which can benefit from the theoretical results in this area.
We will first build on our research in the areas of facility location and vehicle routing. Significant progress has been made, but still many problems remain in these areas. A particular focus will be on well structured classes of graphs such as partial k-trees. The long term objective of this research remains the goal of integrating the location planning with tour planning aspects taken into account. An additional focus on mobile sensor networks raises novel combinatorial questions arising from the ad-hoc nature of network.
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
2422-2011
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
2011
Competition year année de concours
2011
Award amount
24000
Program id
RGPIN
Program nane 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
1507
Committee name en
Computer Science
Committee name fr
Sciences informatiques
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
2713
Research subject group en
Information technology
Research subject group fr
Technologie de l'information
Research subject en
Algorithms
Research subject fr
Algorithmes
Partie
1
Nb partie
5
Application title
Design and analysis of efficient algorithms for location-routing problems
Keyword
NSERC
Application summary
Efficiency in modern industrial operations requires that resources be deployed in optimal manner. This has resulted in extensive work in operations research on resource allocation with a focus optimal or near optimal planning. I propose to study algorithmic aspects of a combinatorial problem called location routing problem. Location-routing research area encompasses the classical facility location and routing areas. The location of service providers is often influenced by transport costs. Clearly, dealing this problem separately, will often result in suboptimal algorithm. There are a host pf practical industrial problems which can benefit from the theoretical results in this area.
We will first build on our research in the areas of facility location and vehicle routing. Significant progress has been made, but still many problems remain in these areas. A particular focus will be on well structured classes of graphs such as partial k-trees. The long term objective of this research remains the goal of integrating the location planning with tour planning aspects taken into account. An additional focus on mobile sensor networks raises novel combinatorial questions arising from the ad-hoc nature of network.