this work presents a hybrid method for motif discovery in dna sequences. the proposed method called spso-lk, borrows the concept of chebyshev polynomials and uses the stochastic local search to improve the performance of the basic pso algorithm as a motif finder. the chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

The optimal reactive power dispatch (ORPD) is a very important problem aspect of power system planning and is a highly nonlinear, non-convex optimization problem because consist of both continuous and discrete control variables. Since the power system has inherent uncertainty, hereby, this paper presents both of the deterministic and stochastic models for ORPD problem in multi objective and sin...

This paper outlines an experiential approach to teaching stochastic local search. Using the Tale of the Drunken Topographer as a running analogy, students are led from the implementation of a hill descent algorithm through small, motivated modifications to a simple implementation of simulated annealing. Supplementary applets allow students to experiment with temperature and gain understanding o...

The Genomic Median Problem is an optimization problem inspired by a biological issue: it aims at finding the genome organization of the common ancestor to multiple living species. It is formulated as the search for a genome that minimizes some distance measure among given genomes. Several attempts have been made at solving the problem. These range from simple heuristic methods to a stochastic l...

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

Stochastic local search can be used for the process of vectorization. In this project, local search is used to optimize the parameters of a set of smooth shapes to represent an image of the Mona Lisa. The shapes are made using quadratic piecewise parametric interpolation. The shapes are partially transparent and are defined by three vertices and a color. The method is successfully applied to a ...

The article presents a local search approach for the solution of timetabling problems in general, with a particular implementation for competition track 3 of the International Timetabling Competition 2007 (ITC 2007). The heuristic search procedure is based on Threshold Accepting to overcome local optima. A stochastic neighborhood is proposed and implemented, randomly removing and reassigning ev...

We generalize Stochastic Local Search (SLS) heuristics into a unique formal model. This model has two key components: common structure designed to be as large possible and parametric intended small possible. Each heuristic is obtained by instantiating the part in different way. Particular instances for Genetic Algorithms (GA), Ant Colony Optimization (ACO), Particle Swarm (PSO) are presented. T...