Efficient constructive heuristics have been designed for most of the difficult combinatorial optimisation problems. Performance of these heuristics may vary from one instance to another and hence it is beneficial to be able to select an instance of the heuristic which is best suited to a given instance of the problem. Both of the heuristic search algorithm and hyper-heuristic approaches try to ...

Hyperheuristics give us the appealing possibility of abstracting the solution method from the problem, since our hyperheuristic, at each decision point, chooses between different low level heuristics rather than different solutions as is usually the case for metaheuristics. By assembling low level heuristics from parameterised components we may create hundreds or thousands of low level heuristi...

in recent years stock exchange has become one of the most attractive and growing businesses in respect of investment and profitability. but applying a scientific approach in this field is really troublesome because of variety and complexity of decision making factors in the field. this paper tries to deliver a new solution for portfolio selection based on multi criteria decision making literatu...

This paper presents an investigation of a simple generic hyper-heuristic approach upon a set of widely used constructive heuristics (graph coloring heuristics) in timetabling. Within the hyperheuristic framework, a Tabu Search approach is employed to search for permutations of graph heuristics which are used for constructing timetables in exam and course timetabling problems. This underpins a m...

We consider the multi-mode resource-constrained project scheduling problem (MRCPSP) with renewable resources. In MRCPSP, an activity can be executed in one of many possible modes; each mode having different resource requirements and accordingly different activity durations. We assume that all resources are renewable from period to period, such as labor and machines. A solution to this problem b...

Application placement is an important concept when providing software as a service in cloud environments. Because of the potential downtime cost of application migration, most of the time additional resource acquisition is preferred over migrating the applications residing in the virtual machines (VMs). This situation results in under-utilized resources. To overcome this problem static/dynamic ...

This paper presents a general framework for analyzing heuristics for constraint solving, including backtracking and arc consistency algorithms. It will emphasize heuristics for variable selection during search, since this is where major differences are found. In earlier work two basic approaches to this problem were developed. The first was a general theoretical framework for different types of...

We study the problem of building effective heuristics for achieving conjunctive goals from heuristics for individual goals. We consider a straightforward method for building conjunctive heuristics that smoothly trades off between previous common methods. In addition to first explicitly formulating the problem of designing conjunctive heuristics, our major contribution is the discovery that this...

MOTIVATION RNA-Seq experiments have revealed a multitude of novel ncRNAs. The gold standard for their analysis based on simultaneous alignment and folding suffers from extreme time complexity of [Formula: see text]. Subsequently, numerous faster 'Sankoff-style' approaches have been suggested. Commonly, the performance of such methods relies on sequence-based heuristics that restrict the search ...