A problem with many contemporary musical robotic percussion systems lies in the fact that solenoids fail to respond linearly to linear increases in input velocity. This nonlinearity forces performers to individually tailor their compositions to specific robotic drummers. To address this problem, we introduce a method of pre-performance calibration using metaheuristic search techniques. A variet...

One important approach to learning Bayesian networks (BNs) from data uses a scoring metric to evaluate the fitness of any given candidate network for the data base, and applies a search procedure to explore the set of candidate networks. The most usual search methods are greedy hill climbing, either deterministic or stochastic, although other techniques have also been used. In this paper we pro...

The use of techniques for automating the generation of test scripts is important as it can reduce the time and cost of the process. The recent method for automatic generation of tests using metaheuristic techniques i.e. Genetic Algorithms and Simulated Annealing. There is a great deal of research into the use of Genetic Algorithms to obtain a specific coverage in software testing but none is us...

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuri...

The aim of Search Based Software Engineering (SBSE) research is to move software engineering problems from human-based search to machine-based search, using a variety of techniques from the metaheuristic search, operations research and evolutionary computation paradigms. The idea is to exploit humans’ creativity and machines’ tenacity and reliability, rather than requiring humans to perform the...

GRASP is a multi-start metaheuristic for combinatorial optimization problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the result. In this chapter, we first describ...

GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phase. The best overall solution is kept as the result. In this chapter, we first describe the basic c...

An application of the current search (CS), one of the most efficient metaheuristic optimization search techniques, to design the PIDA (proportional-integral-derivative-accelerated) controllers is proposed in this paper. The CS is applied to search for the optimum PIDA controller’s parameters. The obtained controllers are tested against nine benchmark systems collected by Åsström and Hägglund co...

In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in concurrent models using a model checking approach. ACOhg is a new kind of ant colony optimization algorithm inspired by the foraging behaviour of real ants equipped with internal resorts to search in very large search la...