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 53 for “"Metaheuristics"”.

  1. Metaheuristics for Multi Criteria Path Optimisation

    In real world applications, the path-planning problem is one that is multi-criteria in nature though given the complexity of the task is one that is often condensed to a single criterion issue, either by the consideration of only a single objective or condensing several criteria into a single …

    southwales Repository record for Metaheuristics for Multi Criteria Path Optimisation (opens in a new tab)

  2. Scheduling coal handling processes using metaheuristics

    The operational scheduling at coal handling facilities is of the utmost importance to ensure that the coal consuming processes are supplied with a constant feed of good quality coal. Although the Sasol Coal Handling Facility (CHF) were not designed to perform coal blending during the coal handling …

    pretoria Repository record for Scheduling coal handling processes using metaheuristics (opens in a new tab)

  3. Metaheuristics for solving optimization industrial problems

    El contenido principal de esta tesis consiste en la aplicación de diferentes técnicas metaheurísticas en la resolución del problema MPP, centrándose principalmente en su aplicación en un entorno industrial. El trabajo realizado en la tesis analiza y evalúa las fortalezas y debilidades de diferentes …

    oviedo Repository record for Metaheuristics for solving optimization industrial problems (opens in a new tab)

  4. Metaheuristics and machine learning for joint stratification and sample allocation in survey design

    In this thesis, we propose a number of metaheuristics and machine learning techniques to solve the joint stratification and sample allocation problem. Finding the optimal solution to this problem is hard when the sampling frame is large, and the evaluation algorithm is computationally burdensome. …

    cork Repository record for Metaheuristics and machine learning for joint stratification and sample allocation in survey design (opens in a new tab)

  5. Using metaheuristics with the ranking and selection indifference-zone procedure MMY in problems with many objectives

    … and large, complex design spaces. Although metaheuristics are effective in exploring these spaces and approximating Pareto-optimal solutions, they lack statistical guarantees, making the reliability of their outputs uncertain. In contrast, ranking and selection (R&S) procedures provide …

    stellenbosch Repository record for Using metaheuristics with the ranking and selection indifference-zone procedure MMY in problems with many objectives (opens in a new tab)

  6. Explainability of non-deterministic solvers: explanatory feature generation from the data mining of the search trajectories of population-based metaheuristics.

    Evolutionary algorithms (EAs) are the principal focus of research study in Evolutionary Computing (EC). In EC, naturally occurring processes designed to drive success in nature are simulated for a similar purpose in numerical optimisation. Such processes include natural selection, genetic mutation …

    rgu Repository record for Explainability of non-deterministic solvers: explanatory feature generation from the data mining of the search trajectories of population-based metaheuristics. (opens in a new tab)

  7. Towards an Artificial Intelligence based Decision Support System to Evaluate Various Transit Projects

    … The principal conclusion for implementing these metaheuristics is that the utilization of an ensemble metaheuristic model encompassing a set of metaheuristics will be most beneficial as no dominating metaheuristics were found to outperform the others. The budget-demand sensitivity analysis …

    cuny Repository record for Towards an Artificial Intelligence based Decision Support System to Evaluate Various Transit Projects (opens in a new tab)

  8. Enabling the “Easy Button” for Broad, Parallel Optimization of Functions Evaluated by Simulation

    … stochastic constraints, choose one or more metaheuristics to solve it and run, using massively parallel function evaluation to reduce wall-clock times. </p> <p>JOBS is supported by a new language independent, application programming interface (API) for remote simulation model evaluation and …

    arkansas Repository record for Enabling the “Easy Button” for Broad, Parallel Optimization of Functions Evaluated by Simulation (opens in a new tab)

  9. Home Health Care Routing and Scheduling Problem with Genetic Algorithms

    … medical services. Despite the extensive use of metaheuristics in related routing problems, the HHCRSP has received limited attention, with only one known Genetic Algorithm (GA) and its variants reported in the literature. This thesis addresses this gap by proposing a novel GA and, for the first …

    brock Repository record for Home Health Care Routing and Scheduling Problem with Genetic Algorithms (opens in a new tab)

  10. Análise do problema de máxima geração distribuída observando o critério estático da estabilidade de tensão

    … Method combined with Scatter Search Metaheuristics. The MHC problem, invariably constrained either by overvoltages or overcurrents, may yield a solution that can lie in the bottom part of the classical PV curve in static voltage stability analysis. If this is the case, there is a need …

    brazil-uerj Repository record for Análise do problema de máxima geração distribuída observando o critério estático da estabilidade de tensão (opens in a new tab)

  11. Optimization algorithms in boiling water reactor lattice design

    … This issue may be resolved with the addition of metaheuristics to reduce the search space for GEDBS, or by an increasing computation.

    mit Repository record for Optimization algorithms in boiling water reactor lattice design (opens in a new tab)

  12. Constraint Solving and Optimizationn Using Nature-Inspired Techniques

    … when they scale up. However, one challenge with metaheuristics is their immature convergence. This issue can be addressed by keeping the exploitation and exploration of the algorithms in balance. Metaheuristics can play a significant role in the area of Constraint Satisfaction Problems (CSPs) …

    regina Repository record for Constraint Solving and Optimizationn Using Nature-Inspired Techniques (opens in a new tab)

  13. An investigation of multilevel refinement in routing and location problems

    … algorithms are collaborative techniques for metaheuristics and others are collaborative techniques for local search heuristics. Additionally, new methods of coarsening for location and routing problems and enhancements for the multilevel technique are developed. It is demonstrated that the …

    greenwich Repository record for An investigation of multilevel refinement in routing and location problems (opens in a new tab)

  14. Development of a Multi-objective Variant of the Alliance Algorithm

    … many different fields and some of them, such as metaheuristics, have often been found helpful and efficient for the resolution of practical applications where finding optimal solutions is not straightforward. Many practical applications are multi-objective optimization problems: there is more …

    cambridge Repository record for Development of a Multi-objective Variant of the Alliance Algorithm (opens in a new tab)

  15. Combining the Power of Attention Models and Many-objective Computational Intelligence Algorithms for Drug Design

    … the system proposed in this study integrates metaheuristics with ADMET prediction and latent Transformer models for solving a drug design problem. A comparative study shows effectiveness of computational intelligence towards a many-objective drug design problem, where 1718 drug-like molecules …

    brock Repository record for Combining the Power of Attention Models and Many-objective Computational Intelligence Algorithms for Drug Design (opens in a new tab)

  16. How to Use K-means for Big Data Clustering?

    … the MSSC problem without using additional metaheuristics. On the other hand, this approach can be generalized to a novel metaheuristic, providing fresh perspectives for creating new powerful optimization heuristics. This work shows that data decomposition is the basic approach to solve the …

    washington Repository record for How to Use K-means for Big Data Clustering? (opens in a new tab)

  17. Influence of Customer Locations on Heuristics and Solutions for the Vehicle Routing Problem

    … the past 60 years, multitudes of heuristics and metaheuristics have been developed in order to minimize the computational burden of solving the VRP. In order to compare the performance of VRP heuristics, researchers have developed bench-marking datasets. These datasets, however, lack properties …

    vt Repository record for Influence of Customer Locations on Heuristics and Solutions for the Vehicle Routing Problem (opens in a new tab)

  18. Metaheuristic algorithms for air-route optimization under climate change

    … turbulence using both exact algorithms and metaheuristics. We first build a transparent baseline on synthetic grids and small airport networks where edge costs are still-air travel times. This allows reproducible comparisons between Dijkstra’s algorithm (exact, nonnegative additive costs) …

    catalunya Repository record for Metaheuristic algorithms for air-route optimization under climate change (opens in a new tab)

  19. Some applications of continuous variable neighbourhood search metaheuristic (mathematical modelling)

    … C++ solver with variable neighbourhood search metaheuristics. It has been used as a starting point for this research and then adapted and modified for problems studied in this thesis. In fact, two problems have been considered, censored quantile regression and the circle packing problem. The …

    brunel Repository record for Some applications of continuous variable neighbourhood search metaheuristic (mathematical modelling) (opens in a new tab)

  20. Inverse Design and Optimization Methods for Thermophotovoltaic Emitters made of Tungsten Gratings

    … fraction is infeasible. This prompts the use of metaheuristics. It should be noted that due to the stochastic nature of these optimization methods, a globally optimal solution is not guaranteed, and instead, these methods seek to provide "close enough" solutions. Generally, metaheuristic …

    gatech Repository record for Inverse Design and Optimization Methods for Thermophotovoltaic Emitters made of Tungsten Gratings (opens in a new tab)

Page 1 of 3