Processing of Spatio-Temporal Hybrid Search Algorithms in Heterogenous Environment Using Stochastic Annealing NN Search

In spatio-temporal database the mixed regions are present in a random manner. The existing work produces the result to create new research opportunities in the area of adaptive and hybrid SLS algorithms. This algorithm develops initialization algorithms which are used only for the homogenous environment. Most current approaches assume, as we have done here, only the homogenous mixtures. Approach: To overcome the above issue, we are going to implement a new technique termed Stochastic Annealing Nearest Neighbor Search using hybrid search algorithms (SANN- HA) for spatio-temporal heterogeneous environment to retrieve the best solution. It provides enhanced fits for definite run length distributions, and would be useful in other contexts as well. Results: Performance of Stochastic Annealing Nearest Neighbor Search using hybrid search algorithms is to discover different sub explanations using different mixture of algorithms in terms of run length distribution and average time for execution based on data objects. Conclusion: It considers the problem of retrieving the high quality solution from the heterogeneous environment. An analytical and empirical result shows the better result with the efficient hybrid search algorithms of our proposed SANN scheme

A Hybrid Quantum Encoding Algorithm of Vector Quantization for Image Compression

Many classical encoding algorithms of Vector Quantization (VQ) of image compression that can obtain global optimal solution have computational complexity O(N). A pure quantum VQ encoding algorithm with probability of success near 100% has been proposed, that performs operations 45sqrt(N) times approximately. In this paper, a hybrid quantum VQ encoding algorithm between classical method and quantum algorithm is presented. The number of its operations is less than sqrt(N) for most images, and it is more efficient than the pure quantum algorithm. Key Words: Vector Quantization, Grover's Algorithm, Image Compression, Quantum AlgorithmComment: Modify on June 21. 10pages, 3 figure

Investigating a Hybrid Metaheuristic For Job Shop Rescheduling

Previous research has shown that artificial immune systems can be used to produce robust schedules in a manufacturing environment. The main goal is to develop building blocks (antibodies) of partial schedules that can be used to construct backup solutions (antigens) when disturbances occur during production. The building blocks are created based upon underpinning ideas from artificial immune systems and evolved using a genetic algorithm (Phase I). Each partial schedule (antibody) is assigned a fitness value and the best partial schedules are selected to be converted into complete schedules (antigens). We further investigate whether simulated annealing and the great deluge algorithm can improve the results when hybridised with our artificial immune system (Phase II). We use ten fixed solutions as our target and measure how well we cover these specific scenarios

Hybrid Taguchi-Harmony Search Algorithm for Solving Engineering Optimization Problems

Harmony search algorithm have recently gained a lot of attention from the optimization research community. In this paper, an improved harmony search algorithm is introduced to solve engineering optimization problems. To demonstrate the effectiveness and robustness of the proposed approach, it is applied to an engineering design and manufacturing optimization problem taken from the literature. The results obtained by the new hybrid harmony search approach for the case studies are compared with a hybrid genetic algorithm, scatter search algorithm, genetic algorithm, feasible direction method and handbook recommendation. The results of case studies show that the proposed optimization approach is highly competitive and that can be considered a viable alternative to solve design and manufacturing optimization problems

MCTS-minimax hybrids with state evaluations

Monte-Carlo Tree Search (MCTS) has been found to show weaker play than minimax-based search in some tactical game domains. In order to combine the tactical strength of minimax and the strategic strength of MCTS, MCTS-minimax hybrids have been proposed in prior work. This arti