Google

genetic algorithm


Bookmark and Share
Hybrid genetic algorithm for cutting and packing problems

Cutting and Packing (C&P) issues are usually present in our daily life. Common instances comprise of resource allocation, material cutting, package packing, to mention a few. The C&P dilemma is an optimization challenge for assigning small objects into some large ones. Its high complexity and difficulty are very well known, not just because it is NP-hard but in addition because of the multi-dimensional geometrical constraints added. Within this dissertation, a hybrid approach which includes heuristic approach and genetic algorithm (GA) ...

Project category: Electrical/Computer
Engineering Feelings of Quality

There is an increasing emphasis on developing systematical research approaches for design of products that appeal to people’s emotions and values. This thesis proposes methodological developments for investigating people’s subjective emotional needs and values towards quality and explores interactions of related physical design attributes for product design.

Project category: Engg Misc, TQM
Integrated Software Pipelining

In this thesis we address the problem of integrated software pipelining for clustered VLIW architectures. The phases that are integrated and solved as one combined problem are: cluster assignment, instruction selection, scheduling, register allocation and spilling.As a first step we describe two methods for integrated code generation of basic blocks. The first method is optimal and based on integer linear programming... Contents 1 Introduction 1.1 Motivation 1.2 Compilers and code generation for VLIW architectures 1.2.1 Compilation 1.2.2 Very long instruction word architectures 1.3 Retargetable code generation and ...

Project category: IT General
Genetic algorithms in multiobjective control designs

This thesis presents the use of Genetic Algorithms (GA) in the multiobjective control design problems. The theme is to devise the means and methods for such multiobjective problems based upon the intrinsic characteristics of GA. Control engineering problems often exist in the class of multiple objectives. In the conventional techniques, these problems are usually converted into a single objective problem or handled in a similar manner. The major deficiency of those approaches is that only a single best solution is ...

Project category: Electrical/Computer
Optimizing Genetic Algorithms for Time Critical Problems

Genetic algorithms have a lot of properties that makes it a good choice when one needs to solve very complicated problems. The performance of genetic algorithms is affected by the parameters that are used. Optimization of the parameters for the genetic algorithm is one of the most popular research fields of genetic algorithms. One of the reasons for this is because of the complicated relation between the parameters and factors such as the complexity of the problem. This thesis describes ...

Project category: Artificial Intelligence
Optimization of Contemporary Telecommunications Networks: Generalized Spanning Trees and WDM Optical Networks

We present a study of two NP-hard telecommunications network design problems - the prize-collecting generalized minimum spanning tree problem (PCGMST) and the design of optical networks with wavelength division multiplexing. The first problem, the PCGMST problem, involves the design of regional backbone networks, where a set of local area networks (LANs) need to be connected by a minimum cost tree network using exactly one gateway site from each LAN. We present several polynomial time heuristics for the PCGMST problem and ...

Project category: Networking

Project Reports, Final Year Projects for Students, Case Studies, Dissertation Ideas, Thesis Topics, Project Sample Downloads