Simulated annealing has been shown to be a powerful stochastic method of tackling hard combinatorial optimisation problems, but it demands a vast amount of computation time to arrive at a good approximate solution. A lot of research has been done on the cooling schedule of simulated annealing to speed up its convergence, but only limited attention has been paid to the impact of the neighbourhoo...

Given a graph G, a proper k-coloring of G is an assignment of k colors {1, . . . , k} to the vertices of G such that two adjacent vertices receive two different colors. The minimum sum coloring problem (MSCP) is to find a proper k-coloring while minimizing the sum of the colors assigned to the vertices. This paper presents a stochastic hybrid evolutionary search algorithm for computing upper an...

Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. The problem of designing such sets of DNA strands, also known as the DNA code design problem, appears to be computationally hard. In this paper, we show how a recently proposed stochastic local search algorithm for DNA ...

The obnoxious p-median problem is a facility location where we maximise the sum of distances between each client point and its nearest facility. Since it nondeterministic polynomial-time (NP)-hard, most algorithms designed for follow metaheuristic strategies to find high-quality solutions in affordable time but with no optimality guarantee. In this paper, variant iterated greedy algorithm devel...

A new class of search-based training algorithms for feedforward networks is introduced. These algorithms do not calculate analytical gradients and do not use stochastic or genetic search techniques. The forward step is performed to calculate error in response to localized weight changes using systematic search techniques. One of the simplest variants of this type of algorithms, the Variable Ste...

In this paper we focus on the test selection problem. It is modeled after a real-life problem that arises in telecommunication when one has to check the reliability of an application. We apply different metaheuristics, namely Reactive Tabu Search (RTS), Genetic Algorithms (GA) and Simulated Annealing (SA) to solve the problem. We propose some modifications to the conventional schemes including ...