Presidential Young Investigators Award: Combinatorial Optimization Problems

两个主要的研究重点将被追求：代数系统的优化和动态车辆路线。在代数系统的优化中，重点将放在“矩阵奇偶性”问题上。这项工作的主要目标是算法和概念，是对组合优化中许多重要问题的优雅概括。在动态车辆路径领域，目标是开发有效的启发式程序来解决紧急调度问题。这些方法将包括交互式调度和分层分解技术。预计本研究将通过借鉴数学规划、组合优化、控制论、排队论和人工智能的研究进展，扩展动态调度和路由问题的“最先进”。

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.