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 40 for “"Local search algorithms"”.

  1. 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 …

    vt Repository record for Assessing the Finite-Time Performance of Local Search Algorithms (opens in a new tab)

  2. An integrated White+Black box approach for designing and tuning stochastic local search algorithms

    This thesis addresses two related Stochastic Local Search (SLS) engineering problems: the Design and Tuning Problem (DTP). The SLS DTP can be informally defined as a meta-level problem of finding a good SLS algorithm which has been tuned for a given class of Combinatorial Optimization Problems …

    nus Repository record for An integrated White+Black box approach for designing and tuning stochastic local search algorithms (opens in a new tab) Download file for An integrated White+Black box approach for designing and tuning stochastic local search algorithms (opens in a new tab)

  3. Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem

    Local search algorithms are among the most effective approaches for locating high-quality solutions to a wide range of combinatorial optimization problems. However, our theoretical understanding of these algorithms is very limited, leading to significant problems for both researchers and …

    colostate Repository record for Empirical modeling and analysis of local search algorithms for the job-shop scheduling problem (opens in a new tab)

  4. Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour

    … problems have been the focus of extensive research for several decades. The propositional satisfiability problem (SAT), in particular, has been the focus of a vast amount of research, and a class of algorithms known as stochastic local search (SLS) algorithms has emerged as the state-of-the …

    ubc Repository record for Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour (opens in a new tab) Download PDF for Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour (opens in a new tab)

  5. Using improvement location and improvement preference to create meta-heuristics

    Local search algorithms are used to produce solutions to combinatorial logistics problems such as the vehicle routing problem. Where the algorithms aim to minimise the number of vehicles needed to deliver goods. Local search creates a first solution and that solution is the best until the heuristic …

    city-london Download PDF for Using improvement location and improvement preference to create meta-heuristics (opens in a new tab)

  6. Oblivious and Non-oblivious Local Search for Combinatorial Optimization

    Standard local search algorithms for combinatorial optimization problems repeatedly apply small changes to a current solution to improve the problem's given objective function. In contrast, non-oblivious local search algorithms are guided by an auxiliary potential function, which is distinct from …

    toronto-retro Repository record for Oblivious and Non-oblivious Local Search for Combinatorial Optimization (opens in a new tab)

  7. 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 …

    vt Repository record for A Probabilistic Study of 3-SATISFIABILITY (opens in a new tab)

  8. 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 …

    vt Repository record for Simultaneous Generalized Hill Climbing Algorithms for Addressing Sets of Discrete Optimization Problems (opens in a new tab)

  9. Routing products or people: single and multiobjective constrained shortest path and related problems

    … thesis is to define, model and solve three research questions at the tactical and operational levels of decision making, the former arising in the context of intermodal service network design and the latter two in passenger transportation, by using integer programming, dynamic programming and …

    soton Download PDF for Routing products or people: single and multiobjective constrained shortest path and related problems (opens in a new tab)

  10. Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης

    The objective of this thesis is the study and research of effective algorithmic approaches for addressing computationally hard optimization problems, through the analysis and the proposal of hybrid evolutionary methods and the formulation of the framework for applying them to specific problems. …

    greece Repository record for Υβριδικοί εξελικτικοί αλγόριθμοι βελτιστοποίησης και εφαρμογές σε προβλήματα συνδυαστικής βελτιστοποίησης (opens in a new tab)

  11. Fitness landscape analysis of a class of np-hard problems

    … problems are empirically studied in this research. We believe that the studied properties give insight into the structure of the problem landscape and can be representative of the problem difficulty, in particular with respect to local search algorithms. The properties include: types of …

    birmingham Download PDF for Fitness landscape analysis of a class of np-hard problems (opens in a new tab)

  12. Examining the role of local optima and schema processing in genetic search

    Several factors contribute to making search problems easy or difficult. One of these factors is the modality of the fitness landscape. Quite often, when local search algorithms fail to locate the global optimum, it is because the algorithm converged to a local optimum. The majority of local search …

    colostate Repository record for Examining the role of local optima and schema processing in genetic search (opens in a new tab)

  13. Integrating SAT with MDG for Efficient Invariant Checking

    … (SAT) has been the subject of intensive research in recent years, with significant theoretical and practical contributions. From a practical perspective, a large number of very effective SAT solvers have recently been proposed, most of which based on improvements made to the original …

    concordia Download PDF for Integrating SAT with MDG for Efficient Invariant Checking (opens in a new tab)

  14. 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 …

    soton Download PDF for Polynomially searchable exponential neighbourhoods for sequencing problems in combinatorial optimisation (opens in a new tab)

  15. Static and Dynamic Structural Model Updating through Branch-and-Bound Optimizations

    … problem is nonconvex, this thesis explores algorithms of the branch-and-bound type, including a primal-relaxed dual (P-RD) decomposition approach. Contrary to local search algorithms, these branch-and-bound methods exploit a problem’s mathematical structure and provide a range, defined by an …

    gatech Repository record for Static and Dynamic Structural Model Updating through Branch-and-Bound Optimizations (opens in a new tab)

  16. 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 …

    adelaide Repository record for Diversity optimization and parameterized analysis of heuristic search methods for combinatorial optimization problems (opens in a new tab)

  17. Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems

    Evolutionary algorithms are general problem solvers that have been successfully used in solving combinatorial optimization problems. However, due to the great amount of randomness in these algorithms, theoretical understanding of them is quite challenging. In this thesis we analyse the …

    adelaide Repository record for Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems (opens in a new tab)

  18. Approximation algorithms for independent set problems on hypergraphs

    This thesis deals with approximation algorithms for the Maximum Independent Set and the Minimum Hitting Set problems on hypergraphs. As a hypergraph is a generalization of a graph, the question is whether the best known approximations on graphs can be extended to hypergraphs. We consider greedy, …

    reykjavik Repository record for Approximation algorithms for independent set problems on hypergraphs (opens in a new tab)

  19. Fair and diverse data representation in machine learning

    The work contains two major lines of research: subset selection and multi-criteria dimensionality reduction with an application to fairness. Subset selection can be applied to a classical problem of optimal design in statistics and many others in machine learning when learning is subject to a …

    gatech Repository record for Fair and diverse data representation in machine learning (opens in a new tab)

Page 1 of 2