Design and analysis of efficient algorithms for location-routing problems

定位路由问题的有效算法的设计和分析

• 批准号: 2422-2011
• 负责人: Bhattacharya, Binay
• 金额: $ 1.75万
• 依托单位: Simon Fraser University
• 依托单位国家: 加拿大
• 项目类别: Discovery Grants Program - Individual
• 财政年份: 2014
• 资助国家: 加拿大
• 起止时间: 2014-01-01 至 2015-12-31
• 项目状态: 已结题
• 来源: https://www.nserc-crsng.gc.ca/ase-oro/Details-Detailles_eng.asp?id=544034
• 关键词: Design; analysis; efficient; algorithms; location

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.

现代工业运作的效率要求以最佳方式配置资源。这导致了关于资源分配的业务研究的广泛工作，重点是最优或接近最优的规划。我建议研究一个称为定位路线问题的组合问题的算法方面。选址-布线研究领域包括经典的设施选址和布线领域。服务提供商的位置往往受到运输成本的影响。显然，单独处理这一问题往往会导致次优算法。有许多实际的工业问题可以从这一领域的理论结果中受益。