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 “"Local Search Algorithms"”.
-
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 …
-
Computational experiments for local search algorithms for binary and mixed integer optimization
In this thesis, we implement and test two algorithms for binary optimization and mixed integer optimization, respectively. We fine tune the parameters of these two algorithms and achieve satisfactory performance. We also compare our algorithms with CPLEX on large amount of fairly large-size …
-
A Probabilistic Study of 3-SATISFIABILITY
… function value assigned to each solution. Local search algorithms provide useful tools for addressing a wide variety of intractable discrete optimization problems. Each such algorithm offers a distinct set of rules to intelligently exploit the solution space with the hope of finding an …
-
Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems
Generalized hill climbing (GHC) algorithms provide a framework for using local search algorithms to address intractable discrete optimization problems. Many well-known local search algorithms can be formulated as GHC algorithms, including simulated annealing, threshold accepting, Monte Carlo …
-
Combining search strategies for distributed constraint satisfaction.
… terms of related subproblems, called a complex local problem (CLP), which are dispersed over a number of locations, each with its own constraints on the values their variables can take. An agent knows the variables in its CLP plus the variables (and their current value) which are directly …
-
Hybrid algorithms for distributed constraint satisfaction.
… is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and corresponding domains of its local problem together with the constraints relating its own variables (intra-agent constraints) and the constraints …
-
Multi-target tracking via mixed integer optimization
… of mixed integer optimization (MIO) models and local search algorithms that are (a) scalable, as they provide near optimal solutions for six targets and ten time periods in milliseconds to seconds, (b) general, as they make no assumptions on the data, (c) robust, as they can accommodate missed …
-
New neighborhood search algorithms based on exponentially large neighborhoods
… problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computational time. An improvement algorithm is an approximation algorithm which starts with a feasible solution and iteratively attempts to obtain a better solution. …
-
Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation
… neighbourhoods of exponential size that can be searched in polynomial time. Such neighbourhoods are used in local search algorithms for classes of combinatorial optimisation problems. We introduce a method, called dynasearch, of constructing new neighbourhoods, and of viewing some previously …
-
Novel Memetic Computing Structures for Continuous Optimisation
This thesis studies a class of optimisation algorithms, namely Memetic Computing Structures, and proposes a novel set of promising algorithms that move the first step towards an implementation for the automatic generation of optimisation algorithms for continuous domains. This thesis after a …
-
Heuristics for the Cutting Stock with Setup Cost and Blood Collection Problems
The application of Operations Research techniques enables decision makers to come up with better decisions for a wide range of problems in different industries. During last decades, Operations Research solution methods have been attained a huge interest in production planning, supply chain …
-
An analysis of combinatorial search spaces for a class of NP-hard problems
… maximize (or minimize) ƒ. Many combinatorial search algorithms employ some perturbation operator to hill-climb in the search space. Such perturbative local search algorithms are state of the art for many classes of NP-hard combinatorial optimization problems such as maximum k-satisfiability, …
-
Land Leveling Using Optimal Earthmoving Vehicle Routing
… [2000]. The SRCFP is a discrete optimization search problem, proven to be NP-hard. The SRCFP describes the process of reshaping terrain through a series of cuts and fills. This process is commonly done when leveling land for building homes, parking lots, etc. The model used to represent this …