Advanced Search   
  Look in
       Title     Description
  Include
       Inactive Projects
 
Intelligent Combinatorial Optimization
This project is no longer active.
Head: Norman Sadeh-Koniecpol
Contact: Norman Sadeh-Koniecpol
Mailing address:
Carnegie Mellon University
Robotics Institute
5000 Forbes Avenue
Pittsburgh, PA 15213
Associated center(s) / consortia:
 Center for Integrated Manfacturing Decision Systems (CIMDS)
Associated lab(s) / group(s):
 Intelligent Coordination and Logistics Laboratory
Project Homepage
Overview
Constrained Optimization problems are ubiquitous, whether one is interested in the design of an integrated circuit or a car, the production of a factory schedule, or the routing of school buses. One promising approach to solving these problems involves using Simulated Annealing (SA) search. This is a stochastic neighborhood search procedure that moves from one solution to another, while recording the best solution found so far. Typically, the procedure attempts to move to solutions that improve over the current one, though occasionally transitions to lower quality solutions are accepted in an attempt to avoid local optima. SA has been shown to yield near-optimal solutions to many difficult combinatorial optimization problems, if run a sufficiently large number of times.