277 research outputs found
Hybrid Tractable Classes of Binary Quantified Constraint Satisfaction Problems
In this paper, we investigate the hybrid tractability of binary Quantified
Constraint Satisfaction Problems (QCSPs). First, a basic tractable class of
binary QCSPs is identified by using the broken-triangle property. In this
class, the variable ordering for the broken-triangle property must be same as
that in the prefix of the QCSP. Second, we break this restriction to allow that
existentially quantified variables can be shifted within or out of their
blocks, and thus identify some novel tractable classes by introducing the
broken-angle property. Finally, we identify a more generalized tractable class,
i.e., the min-of-max extendable class for QCSPs
Self Adaptive Artificial Bee Colony for Global Numerical Optimization
AbstractThe ABC algorithm has been used in many practical cases and has demonstrated good convergence rate. It produces the new solution according to the stochastic variance process. In this process, the magnitudes of the perturbation are important since it can affect the new solution. In this paper, we propose a self adaptive artificial bee colony, called self adaptive ABC, for the global numerical optimization. A new self adaptive perturbation is introduced in the basic ABC algorithm, in order to improve the convergence rates. 23 benchmark functions are employed in verifying the performance of self adaptive ABC. Experimental results indicate our approach is effective and efficient. Compared with other algorithms, self adaptive ABC performs better than, or at least comparable to the basic ABC algorithm and other state-of-the-art approaches from literature when considering the quality of the solution obtained
Finding and Exploring Promising Search Space for the 0-1 Multidimensional Knapsack Problem
The 0-1 multidimensional knapsack problem(MKP) is a classical NP-hard
combinatorial optimization problem. In this paper, we propose a novel heuristic
algorithm simulating evolutionary computation and large neighbourhood search
for the MKP. It maintains a set of solutions and abstracts information from the
solution set to generate good partial assignments. To find high-quality
solutions, integer programming is employed to explore the promising search
space specified by the good partial assignments. Extensive experimentation with
commonly used benchmark sets shows that our approach outperforms the state of
the art heuristic algorithms, TPTEA and DQPSO, in solution quality. It finds
new lower bound for 8 large and hard instance
- …