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 317 for “"Tabu Search"”.
-
Computational Molecular Design Using Tabu Search
… to increase stability and ease of synthesis. The Tabu Search optimization algorithm was used to design polymers with desirable properties. Finally, a prediction interval was calculated for each candidate to represent the possible error in the predicted properties. The described methodology …
-
Global Optimization Methods based on Tabu Search
… described. The new approaches are the Gradient Tabu Search (GTS), the Gradient Only Tabu Search (GOTS), and the Tabu Search with Powell’s Algorithm (TSPA). In the last part of the work the GOTS is applied for such chemical optimization problems. The chapter provides a systematic approach how the …
-
A TABU SEARCH ALGORITHM FOR FINDING CONSENSUS SEQUENCES
… way to characterize a family of molecules. Tabu Search method is a well known meta-heuristic algorithm. The basic concepts of Tabu Search are introduced. We also present a C++ implementation of a skeleton for Tabu Search method. The implementation provides both robustness and re-usability …
-
RAILWAY TRACTION SUBSTATION OPTIMIZATIONS WITH TABU SEARCH APPROACH
This document reports on the research of traction substations optimization using Tabu Search strategy. In a DC railway system, traction substations convert power from AC to DC and supply trains moving along the line. For traction substation with inverter, it could also return train regenerative …
-
A Survey of Tabu Search in Combinatorial Optimization
Tabu search is a Meta heuristic loosely connected to evolutionary computing. It has been used to tackle hard problems, especially combinatorial optimization problems. Tabu search is designed to overcome difficult regions of a search space by imposing restrictions. Various methods for …
-
Parallelizing Tabu Search Based Optimization Algorithm on GPUs
… that are computationally intractable. Tabu search based simulated annealing is a stochastic search algorithm that is widely used to solve combinatorial optimization problems. Due to excessive run time, there is a strong demand for a parallel version that can be applied to any problem …
-
A tabu search methodology for spacecraft tour trajectory optimization
… for use in the rest of the work. A global search methodology based on the tabu search metaheuristic is then developed. The tabu search approach is extended to operate on a tree-based solution representation and neighborhood structure, which is shown to be especially efficient for problems …
-
A tabu search approach to strategic mobility mode selection
… scheduling and assignment process using Adaptive Tabu Search. The results are then compared to current day solutions using the most widely used military model (JFAST). This approach considers current model limitations, then relaxes limitations of preserving pre-defined port assignments and then …
-
A tabu search approach to the strategic airlift problem
… necessary to produce flight schedules. This research outlines a robust algorithm that obtains excellent solutions to the strategic airlift problem that possess the operational level detail necessary for AMC planners to develop the detailed routing and scheduling of strategic airlift aircraft. …
-
Tabu search heuristics for the dynamic facility layout problem
… and rearrangement costs is minimized. In this research, tabu search heuristics and a probabilistic tabu search heuristic are developed to solve the DFLP. The proposed tabu search heuristics are a simple tabu search heuristic, a tabu search heuristic with diversification and intensification …
-
Mixed covering arrays on graphs and tabu search algorithms
… we do a complete experimental study of two tabu search algorithms for covering array construction. POT is a variation of the algorithm given by Stardom [40] while PAT is an implementation of the algorithm proposed by Nurmela [35]. We conclude that they provide effective methods for …
-
An adaptive tabu search approach to cutting and packing problems
This research implements an adaptive tabu search procedure that controls the partitioning, ordering and orientation features of a two–dimensional orthogonal packing solution, details an effective fine-grained objective function for cutting and packing problems, and presents effective move …
-
Discrete dynamical systems analysis of fixed tenure tabu search sequences
… analysis of observed data on fixed tenure tabu search sequences in order to gain insights into their behavior as related to the search parameters. Dynamical systems analysis is the study of observed times series whose behavior is assumed to be governed by some deterministic law or rule and …
-
An advanced tabu search approach to the airlift loading problem
… a sequence of related subproblems, this research develops an algorithm to simultaneously solve the combined problem by employing an advanced tabu search approach.
-
A tabu search approach for the dynamic space allocation problem.
… in reasonable time using exact methods. This research presents a mathematical formulation, a clustering algorithm based on group technology concepts and storage policies used to solve the storage layout problem, and a tabu search heuristic (TS) for solving the DSAP. In addition, a set of 72 test …
-
Application of tabu search to deterministic and stochastic optimization problems
… advances in computer science and operations research have resulted in many new optimization methods for tackling complex decision-making problems. One such method, tabu search, forms the basis of this thesis. Tabu search is a very versatile optimization heuristic that can be used for solving …
-
Using advanced tabu search techniques to solve airline disruption management problems
… original schedule. Methodologies using advanced tabu search (TS) were investigated to solve two flight rescheduling problems: the aircraft grounding problem and the reduced station capacity problem. The objectives of both problems were to minimize the schedule recovery costs associated with …
-
High Order Contingency Selection using Particle Swarm Optimization and Tabu Search
… analysis. This thesis presents a heuristic searching method based on particle swarm optimization (PSO) and tabu search to select severe high order contingencies. The original PSO algorithm gives an intelligent strategy to search the feasible solution space, but tends to find the best …
Page 1 of 16