Computer Science – Artificial Intelligence
Scientific paper
1998-12-15
International Journal of Approximate Reasoning, 19(1--2):161--191, July/August 1998
Computer Science
Artificial Intelligence
33 pages, 9 figures; for a project overview see http://www.dbai.tuwien.ac.at/proj/StarFLIP/
Scientific paper
Real world combinatorial optimization problems such as scheduling are typically too complex to solve with exact methods. Additionally, the problems often have to observe vaguely specified constraints of different importance, the available data may be uncertain, and compromises between antagonistic criteria may be necessary. We present a combination of approximate reasoning based constraints and iterative optimization based heuristics that help to model and solve such problems in a framework of C++ software libraries called StarFLIP++. While initially developed to schedule continuous caster units in steel plants, we present in this paper results from reusing the library components in a shift scheduling system for the workforce of an industrial production plant.
Raggl Andreas
Slany Wolfgang
No associations
LandOfFree
A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-122136