A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A reusable iterative optimization software library to solve combinatorial problems with approximate reasoning

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 speci ed constraints of di erent 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 i...

متن کامل

A General Ant Colony Model to solve Combinatorial Optimization Problems

An Ants System is an artificial system based on the behavior of real ant colonies, which is used to solve combinatorial problems. This is a distributed algorithm composed by a set of cooperating agents called ants which cooperate among them to find good solutions to combinatorial optimization problems. The cooperation follows the behavior of real ants using an indirect form of communication med...

متن کامل

Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems

An expected-cost analysis of backtracking and non-backtracking algorithms. We have presented a new method, called-transformation, that can be used by a search algorithm, such as branch-and-bound (BnB), to nd approximate solutions to combinatorial problems. This method is designed to exploit the computational phase transitions of tree search problems. On a random tree,-BnB, which is BnB using th...

متن کامل

A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems 125 A Collaborative Search Strategy to Solve Combinatorial Optimization and Scheduling Problems

Since the creation of operations research as a discipline, a continued interest has been in the development of heuristics or approximation algorithms to solve complex combinatorial optimization problems. As many problems have been proven computationally intractable, the heuristic approaches become increasingly important in solving various large practical problems. The most popular heuristics th...

متن کامل

Cut-and-solve: An iterative search strategy for combinatorial optimization problems

Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy which we refer to as cut-and-solve and prove optimality and termination for this method. This search is different from traditional tree search as there is no branching. At each node in the search path, a relaxed probl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Approximate Reasoning

سال: 1998

ISSN: 0888-613X

DOI: 10.1016/s0888-613x(98)10002-6