Computer Science Department
School of Computer Science, Carnegie Mellon University


Combining Multiple Optimization Runs with Optimal Dependency Trees

Shumeet Baluja*, Scott Davies

June 1997

Keywords: Combinatorial optimization, dependency trees, probability models, Bayesian networks, heuristic search

When trying to solve a combinatorial optimization problem, often multiple algorithms and/or multiple runs of the same algorithm are used in order to find multiple local minima. The information gained from previous search runs is commonly discarded when selecting initialization points for future runs. We present a method which uses information from previous runs to determine promising starting points for future searches. Our algorithm, termed COMIT, models inter-parameter dependencies present in the previously found high-evaluation solutions. COMIT incrementally learns optimal dependency trees that model the pairwise dependencies in a set of good solutions found in previous searches. COMIT then samples the probability distributions modeled by these trees to generate new starting points for future searches. This algorithm has been successfully applied to jobshop scheduling, traveling salesman, knapsack, rectangle packing, and bin-packing problems.

12 pages

*Justsystem Pittsburgh Research Center, 4616 Henry Street, Pittsburgh, PA 15213 and School of Computer Science, Carnegie Mellon University

Return to: SCS Technical Report Collection
School of Computer Science homepage

This page maintained by