Presidential Young Investigators Award: Combinatorial Optimization Problems

总统青年研究者奖：组合优化问题

• 批准号: 8451517
• 负责人: James Orlin
• 金额: --
• 依托单位: Massachusetts Institute of Technology
• 依托单位国家: 美国
• 项目类别: Continuing grant
• 财政年份: 1985
• 资助国家: 美国
• 起止时间: 1985-07-01 至 1991-12-31
• 项目状态: 已结题
• 来源: https://www.nsf.gov/awardsearch/showAward?AWD_ID=8451517&HistoricalAwards=false
• 关键词: Presidential; Young; Investigators; Award; Combinatorial

Two major research thrusts will be pursued: optimization of algebraic systems and dynamic vehicle routing. Within optimization of algebraic systems, the focus will be on the "matroid parity" problem. The major goal of this work is algorithmic and conceptual and is an elegant generalization of a number of important problems in combinatorial optimization. In the area of dynamic vehicle routing, the goal is to develop effective heuristic procedures for solving the emergency scheduling problem. The methodologies will include interactive scheduling and hierarchical decomposition techniques. It is expected that this research will extend the "state-of-the-art" in dynamic scheduling and routing problems by drawing on research developments from mathematical programming, combinatorial optimization, control theory, queueing theory, and artificial intelligence.

两个主要的研究重点将追求：优化的代数 系统和动态车辆路线。 代数优化 系统，重点将放在“拟阵奇偶校验”的问题。 主要 这项工作的目标是算法和概念，是一个优雅的 组合数学中若干重要问题的推广 优化. 在动态车辆路径方面，目标是 制定有效的启发式程序来解决紧急情况 调度问题 这些方法将包括互动 调度和层次分解技术。 预计 这项研究将扩展“最先进的”动态 利用研究进展解决调度和路线问题 从数学规划，组合优化，控制 理论、进化理论和人工智能。