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 13 of 13 for “"algorithm Tabu search"”.
-
Algorithms for Scheduling Teaching Assistants - A comparison focused on preference satisfaction, workload fairness, and computational performance
… and hard constraints for the scheduling algorithms. This thesis investigates four algorithms: a simple greedy algorithm; a simple genetic algorithm; Tabu Search; and Simulated Annealing. Results reveal that although Greedy Algorithm was the quickest, it performed poorly on constraint …
-
Planning in parallel machine shops and scheduling of flexible process plans in mould manufacturing shop
… survival of manufacturing industries. In this research, efforts are taken with an emphasis to improve the planning tasks in parallel machine shops. Sequencing and scheduling complexities prevalent in parallel machine shops are usually solved using heuristic and Meta heuristic algorithms. Two …
-
Learning Models for Discrete Optimization
… incorporate machine learning models into the algorithm structure. Our focus is on the algorithms that can learn the patterns in the search space in order to boost computational performance. The idea is to design optimization techniques that allow for computationally efficient tuning a priori. …
-
The Optimization of Machining Parameters for Milling Operations by Using the Nelder Mead Simplex Method
… the machining process, such as the genetic algorithm, tabu search method, and ant colony algorithm. In CNC milling operations, an objective function proposed by Tolouei and Bidhendi [1996] was used to estimate the profit rate. Tolouei and Bidhendi [1996] used the method of feasible direction …
-
USING THE VEHICLE ROUTING PROBLEM (VRP) TO PROVIDE LOGISTICS SOLUTIONS IN AGRICULTURE
… Vehicle Routing Problem (VRP). A basic heuristic algorithm (a modified form of the Clarke-Wright algorithm) and a meta-heuristic algorithm, Tabu Search, were employed to solve the VRP. The solution considered optimization of field completion time as well as improving the field efficiency. Both …
-
Use of decision science to aid selection of genetically superior animals : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Animal Science at Massey University, Palmerston North, New Zealand
… model for pig breeding, as part of the ongoing search for the “perfect” genotype. The starting point is an additive model to investigate how accurately the classical, infinitesimal model predicts genetic gain for traits controlled by few loci and few alleles. This initial investigation …
-
The Fleet-Sizing-and-Allocation Problem: Models and Solution Approaches
… on Marginal Analysis, we developed a simple algorithm, which gives us the cost-minimal allocation. Since the multi-period, deterministic demand problem is NP-hard we suggest to use Genetic Algorithms. Some building elements for these are described. For the most general situation we also …
-
Modelling and scheduling of heterogeneous computing systems
… This dissertation focuses on the development of algorithms to maximize reliability and/or minimize the completion time of more practical DCS models. A more practical reliabilitya??oriented allocation model was proposed. To solve this NP-complete problem, a Genetic Algorithm and Tabu Search were …
-
Evoluční návrh ultrazvukových operačních plánů
Tato práce se zabývá studiem vybraných evolučních systémů pro jejich použití při návrhu plánu pro ultrazvukové operace. Tyto algoritmy statisticky analyzuje a dle vhodných kritérií je experimentálně srovnává a diskutuje přínos pro klinickou praxi.
-
Problém obchodního cestujícího - paralelní řešení na SMP (vlákna)
Práce se zabývá řešením problému obchodního cestujícího. Problém je řešen nejprve sériovým přístupem na čtyřech algoritmech, aby byly posléze vybrány dva, které jsou převedeny do paralelního provedení. V závěru jsou shrnuty poznatky o rozdílných parametrech obou přístupů. Práce rovněž čtenáře …
-
Metaheurísticas para a minimização do atraso total no problema de sequenciamento em máquinas paralelas com divisão de tarefas
… metaheurísticas GRASP (Greed Randomized Adaptive Search procedure) e no Algoritmo Genético são propostas. Além disso, três regras de dominâncias são utilizadas para melhorar as soluções. São comparados os resultados destes algoritmos com os resultados de outros dois algoritmos propostos na …
-
Srovnání algoritmů při řešení problému obchodního cestujícího
Diplomová práce se zabývá inovací v modulu logistiky informačního systému ERP. Principem inovace je implementace heuristických algoritmů řešících problém obchodního cestujícího (TSP). Pro analýzu a testy zmíněných algoritmů je využit softwarový nástroj MATLAB. Východiskem práce je porovnání …
-
Blending multiple algorithmic granular components: A recipe for clustering
Trends in algorithm design have shown that hybrid algorithms, which combine or merge multiple algorithms, can create synergies to overcome the inherent limitations of the underlying individual algorithms. There are two broad types of hybridization: collaborative - individual algorithms tackle an …