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 43 for “"Local search algorithm"”.
-
A Local Search Algorithm Approach to Analyzing the Complexity of Discrete Optimization Problems
… neighborhood functions have arbitrarily poor local optima.
-
Algorithms for minimum bipartite fill-in and the gene-duplication problem
… bipartite fill-in problem and develop a faster local search algorithm which speeds up heuristics for the gene-duplication problem.</p>
-
Optimal state assignment of sequential circuits using a genetic local search with flexible cost functions
… problem using an implementation of a genetic local search algorithm (GLS) that selectively targets design goals with the use of flexible cost functions. Our GLS quickly converges toward a globally optimal state encoding, producing high quality solutions. We explore the properties of …
-
ΕΥΡΕΤΙΚΗ ΠΡΟΣΕΓΓΙΣΗ ΣΤΟ ΠΡΟΒΛΗΜΑ ΤΟΥ ΣΧΕΔΙΑΣΜΟΥ ΔΙΚΤΥΟΥ ΜΕ ΠΑΓΙΑ ΚΑΙ ΜΕΤΑΒΛΗΤΑ ΣΤΟΙΧΕΙΑ ΚΟΣΤΟΥΣ
… PLANNING OF TRANSPORTATION SYSTEMS. WEDEVELOP A LOCAL SEARCH ALGORITHM FOR THE MNDP IN WHICH THE AMELIORATION OF THECURRENT SOLUTION IS DONE WITH ADDITIONS AND EXCHANGES OF THE EDGES' SUBSETS. WE ALSO ANALYSE THE COMPUTATIONAL EXPERIENCE OF THE SEARCH ALGORITHM IN A LARGE NUMBER OF GRAPHS …
-
Application of traveling salesman problem in generating a collision-free tool path in drilling
… non-flat surfaces. This thesis introduces a new algorithm based on Travelling Salesman Problem (TSP). The proposed local search algorithm generates an optimum collision free tool path in drilling operations. The developed optimization algorithm considers multiple constraints such as location of …
-
On accelerating the searches for compilation sequences in an adaptive compiler
Recent research show that adaptive compiler can produce consistent improvement over a traditional fixed-sequence compiler by conducting feedback-directed searches for good compilation sequences for specific programs, machines and performance objectives. However, such improvement is usually achieved …
-
DATA DRIVEN ALGORITHMS AND DISTRIBUTED COMPUTING FOR AUTOMATIC MIP DECOMPOSITIONS
… purpose solvers, we address a fundamental research question, that is how to exploit Dantzig-Wolfe decomposition methods for generic Mixed Integer Programs (MIP). In the first part of the thesis, we research how to obtain such decompositions in an automatic fashion. We investigate, with …
-
A Motion Graph Approach for Interactive 3D Animation using Low-cost Sensors
… human motions, namely \emph{motion graph}. Our local search algorithm utilizes noise prone and rapidly varying input sensor signals for querying a large database in real-time. The ability to waive the controllers for producing high quality animation provides a simple 3D user interface that is …
-
A strategy for ambulance system designs : an investigation of the ambulance system in the greater Vancouver regional district
… are conducted using this Simulation Model and a Local Search Algorithm which determined optimal locations to evaluate the effect of the following on system performance: number of ambulances; dispatching policies; demand rate. Results from the above experiments lead to the following …
-
Decentralized Transportation Model In Vehicle Sharing
… assumptions. The primary contributions of this research include the formulation of the DRAP and the derivation of theoretical results that facilitate its transformation into a lower-dimensional global optimization problem. This transformation enables efficient exploration using modern search …
-
OPTIMAL GEOGRAPHIC ALIGNMENT OF U.S. ARMY RECRUITING COMMAND RESOURCES TO REDUCE MISSION RISK
… Market Analysis Division in 2019. We implement a local search algorithm to conduct station-company exchanges and systematically explore station-to-company realignments that reduce this risk. Our algorithm operates on a spatial network of USAREC stations to realign stations to companies while …
-
Algorithms for Derivative-Free Optimization
… problem set. Then, we develop Model and Search (M&S), a new local search algorithm for derivative-free optimization. M&S performs a local search from a given point. The search is guided by identifying descent directions from a quadratic model fitted around the best known point, while …
-
Modeling and Solution Methodologies for Mixed-Model Sequencing in Automobile Industry
… with a subset of options. We present four local search metaheuristics adapting efficient transformation operators to solve CSP. The computational experiments show that the Adaptive Local Search provides a significant advantage by not requiring tuning on the operator weights due to its …
-
Analysis of the fitness landscape for the class of combinatorial optimisation problems
… optimisation problems is studied in this research and the similarities and the differences between their landscapes are pointed out. In this research we target the analysis of the fitness landscape for MAX-SAT, Graph-Colouring, Travelling Salesman and Quadratic Assignment problems. Belonging …
-
Profit Optimization Models in Healthcare and E-Commerce Operations
… set forms a partition matroid, and develop a local-search algorithm with a provable performance guarantee. Computational experiments show that the approach performs close to optimal solutions on small instances and scales effectively to realistic full-day clinic configurations. The second and …
-
An advanced tabu search approach to the intratheater airlift operations problem with split loading
This dissertation details an algorithm to solve the Intratheater Airlift Operations Problem (IAOP) using advanced tabu search. A solution to the IAOP determines the routes and assignment of customer requests to a fleet of aircraft over a given time horizon. This problem and other variants comprise …
-
Learning Representations With Linear-Algebraic Structure
… learning is a key step for enabling algorithms to make sense of data and output good decisions. Good data representations preserve useful information, discard irrelevant features, and simplify complex relationships between data. We approach the problem of representation learning …
-
Assessing the Finite-Time Performance of Local Search Algorithms
… to assess a priori the effectiveness of local search algorithms, which makes the process of choosing parameters to improve their performance difficult. This dissertation introduces the B-acceptable solution probability in terms of B-acceptable solutions as a finite-time performance …
-
Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems
Heuristic search algorithms belong to the most successful approaches for many combinatorial optimization problems which have wide real world applications in various areas. The heuristic algorithms usually provide solutions with acceptable quality in reasonable timeframe which is different from …
Page 1 of 3