My research interests involve the application of operations research (OR) techniques to solve problems encountered by industry and the military. In particular, I’m interested in leveraging the capabilities of (semi-) autonomous vehicles for logistics and surveillance. This includes routing and scheduling of unmanned aerial vehicles (UAVs, also known as drones). I am a Federal Aviation Administration (FAA) certified drone pilot.
“On a summery day in March, the huge mesh drone cage at the University at Buffalo’s North Campus is humming as engineering professor Chase Murray and doctoral student Dowon Lee practice landing remote- and voice-controlled drones on a small autonomous land rover.
It looks like fun, but it’s also part of serious research on how artificial intelligence can equip fleets of drones to launch from the roof of a delivery vehicle and fly packages to customers who live farther from a distribution center than drones can fly.” … Continue reading at buffalonews.com
New Paper – A Graph-Based Approach for Relating Integer Programs (March, 2024):
Abstract. This paper presents a framework for classifying and comparing instances of integer linear programs (ILPs) based on their mathematical structure. It has long been observed that the structure of ILPs can play an important role in determining the effectiveness of certain solution techniques; those that work well for one class of ILPs are often found to be effective in solving similarly structured problems. In this work, the structure of a given ILP instance is captured via a graph-based representation, where decision variables and constraints are described by nodes, and edges denote the presence of decision variables in certain constraints. Using machine learning techniques for graph-structured data, we introduce two approaches for leveraging the graph representations for relating ILPs. In the first approach, a graph convolutional network (GCN) is used to classify ILP graphs as having come from one of a known number of problem classes. The second approach makes use of latent features learned by the GCN to compare ILP graphs to one another directly. As part of the latter approach, we introduce a formal measure of graph-based structural similarity. A series of empirical studies indicate strong performance for both the classification and comparison procedures. Additional properties of ILP graphs, namely, losslessness and permutation invariance, are also explored via computational experiments.
Integer linear programming graphs for instances from four different problem classes. These instances were downloaded from strIPlib. Graph visualizations were generated using the Python package networkx. The paper shows how these graphs of integer programs can be used to compare/relate different problem formulations.