Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 20 of 308 for “"Metaheuristics"”.
-
METAHEURISTICS FOR HUB LOCATION MODELS
In this research, we propose metaheuristics for solving two p-hub median problems.. The first p-hub median problem, which is NP-hard, is the uncapacitated single p-hub median problem (USApHMP). In this problem, metaheuristics such as genetic algorithms, simulated annealing and tabu search, are …
-
Applying metaheuristics to some timetabling problems
… an even distribution of course schedule. Three metaheuristics, simulated annealing, tabu search and genetic algorithm, are proposed for solving the two subproblems. The performance of the proposed algorithms is evaluated by two sets of real data and a set of randomly generated problem instances. …
-
Scheduling coal handling processes using metaheuristics
The operational scheduling at coal handling facilities is of the utmost importance to ensure that the coal consuming processes are supplied with a constant feed of good quality coal. Although the Sasol Coal Handling Facility (CHF) were not designed to perform coal blending during the coal handling …
-
Metaheuristics for solving optimization industrial problems
El contenido principal de esta tesis consiste en la aplicación de diferentes técnicas metaheurísticas en la resolución del problema MPP, centrándose principalmente en su aplicación en un entorno industrial. El trabajo realizado en la tesis analiza y evalúa las fortalezas y debilidades de diferentes …
-
Metaheuristics for Multi Criteria Path Optimisation
In real world applications, the path-planning problem is one that is multi-criteria in nature though given the complexity of the task is one that is often condensed to a single criterion issue, either by the consideration of only a single objective or condensing several criteria into a single …
-
Metaheuristics for NP-hard combinatorial optimization problems
In one part of this work, we studied how decomposition-based search methods can improve running time performance when solving very large optimization instances. In another part of the work, carried out a theoretical analysis on convergence properties of Graph-based Ant System and derived a method …
-
Intensity-based medical image registration using metaheuristics
Un paso clave en el análisis de imágenes médicas es la superposición, con el fin de establecer una correspondencia espacial de su contenido común, una tarea llamada registrado de imágenes. La base de todos los métodos de registrado de imágenes es un proceso de optimización, que explora el espacio …
-
Metaheuristics for the Generalized Quadratic Assignment Problem
The generalized quadratic assignment problem (GQAP) is the task of assigning a set of facilities to a set of locations such that the sum of the assignment and transportation costs is minimized. The facilities may have different space requirements, and the locations may have varying space …
-
Metaheuristics for black-box robust optimisation problems
Our interest is in the development of algorithms capable of tackling robust black-box optimisation problems, where the number of model runs is limited. When a desired solution cannot be implemented exactly (implementation uncertainty) the aim is to find a robust one. Here that is to find a point in …
-
Model based test suite minimization using metaheuristics
Software testing is one of the most widely used methods for quality assurance and fault detection purposes. However, it is one of the most expensive, tedious and time consuming activities in software development life cycle. Code-based and specification-based testing has been going on for almost …
-
Using Metaheuristics to solve Dynamic Vehicle Routing Problems
… quality solutions under time limitations, i.e. metaheuristics, are the most suitable and applicable techniques to be used to find good solutions for them. This thesis aims to find good solutions for DVRP by using a Genetic Algorithm (GA) enhanced by five proposed modifications, including the …
-
Applying metaheuristics to feeder bus network design problem
… thesis proposes the design and analysis of four metaheuristics for solving the Feeder Bus Network Design Problem. They are Simulated Annealing, Tabu Search, Genetic Algorithm and the more recent metaheuristic, Ant Colony Optimization. The results are compared to those published in literature. A …
-
Heuristics and metaheuristics for heavily constrained hybrid flowshop problems
Due to the current trends in business as the necessity to have a large catalogue of products, orders that increase in frequency but not in size, globalisation and a market that is increasingly competitive, the production sector faces an ever harder economical environment. All this raises the need …
-
AutoEMH: a framework for high-level automatic ensemble metaheuristics
Metaheuristics are widely used and represent state-of-the-art approaches for many NP-Hard optimization problems. However, the design of robust optimizers remains a significant challenge. This work proposes the Automatic Ensemble Metaheuristic (AutoEMH) framework, which aims to enhance the …
-
Performance Evaluation of Metaheuristics Search Techniques in Resource Allocation Problems
… this research is to evaluate the performance of metaheuristics search techniques such as genetic algorithm, simulated annealing and tabu search in resource allocation problem with project management discipline. This will enable the paper to introduce an alternative approach to solve this Resource …
-
A proposed framework for the design and analysis of metaheuristics
… and seeks to improve methodological practices in metaheuristics research. These black-box stochastic optimization algorithms are widely applied to NP-complete problems, including vehicle routing, neural network training, and aerospace structure design. Despite their popularity, the literature …
Page 1 of 16