Adaptive forest management requires planning and implementation of activities designed to maintain or improve forest conditions, and in support of these endeavors knowledge of silviculture, economics, operations research, and other allied fields are necessary. With regard to forest planning, traditional (exact) mathematical techniques along with heuristics have been demonstrated as useful in de...

This thesis presents an investigation into the use of hyper-heuristic approaches to construct and improve solutions for exam timetabling problems. The majority of the approaches developed in the literature operate on a space of potential solutions to a problem. However, a hyper-heuristic is a heuristic which acts on a space of heuristics, rather than a solution space directly. The majority of r...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

Local-search approaches promise very interesting features for planning, such as an anytime computation and an uncomplicated handling of the environment's dynamics. However, most local-search approaches require the availability of maximal structures what causes problems of scalability. Local search within a generative planning process is rarely looked into. This article presents some basic heuri...

Local-search approaches promise very interesting features for planning, such as an anytime computation and an uncomplicated handling of the environment’s dynamics. However, most local-search approaches require the availability of maximal structures what causes problems of scalability. Local search within a generative planning process is rarely looked into. This article presents some basic heuri...

The transportation problem is one of the most popular problems in linear programming. Over the course of time a multitude of exact solution methods and heuristics have been proposed. Due to substantial progress of exact solvers since the mid of the last century, the interest in heuristics for the transportation problem over the last few decades has been reduced to their potential as starting me...

The reconstruction of DNA sequences from DNA fragments is one of the most challenging problems in computational biology. In recent years the specific problem of DNA sequencing by hybridization has attracted quite a lot of interest in the optimization community. Despite the fact that well-working constructive heuristics are often the basis for well-working metaheuristics, only two constructive h...

The current research trends on hyper-heuristics design have sprung up in two different flavours: heuristics that choose heuristics and heuristics that generate heuristics. In the latter, the goal is to develop a problem-domain independent strategy to automatically generate a good performing heuristic for specific problems, that is, the input to the algorithm are problems and the output are prob...