The purpose of this paper is to improve the simulated annealing method with a variable neighborhood search to solve the resource-constrained scheduling problem. We also compare numerically this method with other neighborhood search (local search) techniques: threshold accepting methods and tabu search. Furthermore, we combine these techniques with multistart diversification strategies and with ...

Best-Reply Search (BRS) is a new search technique for gametree search in multi-player games. In BRS, the exponentially many possibilities that can be considered by opponent players is flattened so that only a single move, the best one among all opponents, is chosen. BRS has been shown to outperform the classic search techniques in several domains. However, BRS may consider invalid game states. ...

the platform switching (pls) concept was introduced in the literature in 2005. the biological benefits and clinical effectiveness of the pls technique have been established by several studies. in this article different aspects of pls concept are discussed. crestal bone loss, biologic width, and stress distribution in this concept are comprehensively reviewed. in this article the relative publis...

We present a hybrid search technique based on metaheuristics for approximately solving the vehicle routing problem with time windows (VRPTW). The approach is two phased; a global customer clustering phase based on genetic algorithms (GAs) and a post-optimization local search technique based on tabu search (TS). We also devise a new crossover operator for the VRPTW and compare its performance wi...

Parallelism and distribution are two distinct concepts that are confusingly close. Parallel Search refers in this work to the distribution of the search space and Distributed Asynchronous Search to the distribution of the constraint predicates. A certain amount of parallelism exists in any Distributed Asynchronous Search and it increases with the degree of asynchronism. However, in comparison t...

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...

We present a novel, robust and accurate blood velocity estimation technique that is implementable by elementary digital signal processing. In this technique, echoes from repeated firings of a transducer are resampled along a set of predetermined trajectories of constant velocities, called "butterfly lines" because of their intersection at a reference range. The slope of the trajectory on which ...

A k-nearest neighbor search algorithm for the Pyramid technique is presented. The Pyramid technique divides d-dimensional data space into 2d pyramids. Given a query point q, we initialize the radius of a range query to be the furthest distance of the k candidate nearest neighbors from q in the pyramid which q is in, then examine the rest of the pyramids one by one. After one pyramid is checked,...

We establish a refined search tree technique for the parameterized Dominating Set problem on planar graphs. Here, we are given an undirected graph and we ask for a set of at most k vertices such that each other graph vertex has at least one neighbor in this set. We derive search-tree based fixed-parameter solving algorithms with running times O(8n) and O(8k + n), where n is the number of vertic...

In this paper, stochastic leader gravitational search algorithm (SL-GSA) based on randomized k is proposed. Standard GSA (SGSA) utilizes the best agents without any randomization, thus it is more prone to converge at suboptimal results. Initially, the new approach randomly choses k agents from the set of all agents to improve the global search ability. Gradually, the set of agents is reduced by...