Dynamic Global Constraints in Backtracking Based Environments
نویسنده
چکیده
* Supported by the Grant Agency of the Czech Republic under the contracts no. 201/99/D057 and 201/01/0942. I would like to thank Petr Vilím for implementing the alldifferent constraint and for performing the empirical evaluation. I am also grateful to Ondøej Èepek for proof reading of the paper draft.
منابع مشابه
Optimization in Uncertain and Complex Dynamic Environments with Evolutionary Methods
In the real world, many of the optimization issues are dynamic, uncertain, and complex in which the objective function or constraints can be changed over time. Consequently, the optimum of these issues is changed nonlinearly. Therefore, the optimization algorithms not only should search the global optimum value in the space but also should follow the path of optimal change in dynamic environmen...
متن کاملA Rule-based Approach to Dynamic Constraint Satisfaction Problems
Dynamic Constraint Satisfaction Problems Armin Wolf GMD { German National Research Center for Information Technology GMD FIRST, Kekul estra e 7, D-12489 Berlin, Germany E-mail: [email protected] URL: http://www.first.gmd.de Abstract Practical constraint satisfaction problems (CSPs) are rarely statically xed. For instance, in job-shopscheduling express jobs have to be added, while already plann...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملMulti-dynamic Bayesian Networks
We present a generalization of dynamic Bayesian networks to concisely describe complex probability distributions such as in problems with multiple interacting variable-length streams of random variables. Our framework incorporates recent graphical model constructs to account for existence uncertainty, value-specific independence, aggregation relationships, and local and global constraints, whil...
متن کاملLocal Probing for Resource
This paper investigates a form of algorithm hybridization that combines constraint satisfaction algorithms with local search algorithms. On one hand, constraint satisfaction algorithms are eeective at nding feasible solutions for tightly constrained problems with complex constraints. On the other hand, local search algorithms are usually better at nding solutions that are good with respect to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Annals OR
دوره 118 شماره
صفحات -
تاریخ انتشار 2003