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 8 of 8 for “"Meta-RaPS"”.

  1. Meta-raps: Parameter Setting And New Applications

    Recently meta-heuristics have become a popular solution methodology, in terms of both research and application, for solving combinatorial optimization problems. Meta-heuristic methods guide simple heuristics or priority rules designed to solve a particular problem. Meta-heuristics enhance these …

    ucf Repository record for Meta-raps: Parameter Setting And New Applications (opens in a new tab)

  2. Meta-RaPS Hybridization with Machine Learning Algorithms

    This dissertation focuses on advancing the Metaheuristic for Randomized Priority Search algorithm, known as Meta-RaPS, by integrating it with machine learning algorithms. Introducing a new metaheuristic algorithm starts with demonstrating its performance. This is accomplished by using the new …

    odu Repository record for Meta-RaPS Hybridization with Machine Learning Algorithms (opens in a new tab)

  3. Incorporating Memory and Learning Mechanisms Into Meta-RaPS

    … challenge can be through the implementation of metaheuristic approaches. However, a more powerful answer might be reached by incorporating intelligence into metaheuristics. Meta-RaPS (Metaheuristic for Randomized Priority Search) is a metaheuristic that creates high quality solutions for …

    odu Repository record for Incorporating Memory and Learning Mechanisms Into Meta-RaPS (opens in a new tab)

  4. Skills management heuristics.

    … techniques: a Greedy Assignment Algorithm, Meta-RaPS Greedy Heuristic, and Meta-RaPS Shortest Augmenting Path (SAP) Heuristic. Meta-RaPS is a meta-heuristic that is used to improve the performance of algorithms by strategically infusing randomness which allows the exploration of more of the …

    louisville Repository record for Skills management heuristics. (opens in a new tab)

  5. A modified greedy algorithm for the task assignment problem.

    … by combining the Greedy Algorithm with the Meta-RaPS method. The Greedy Algorithm is a near-sighted assignment procedure that chooses the best assignment at each step until a full solution is found. Although the Greedy Algorithm finds a good solution for small to medium sized problems, …

    louisville Repository record for A modified greedy algorithm for the task assignment problem. (opens in a new tab)

  6. A multi-objective decision support system for worker-task assignments and workforce training.

    … objective function independently of the others. Meta-RaPS—a modified greedy algorithm—is used to find these solutions. The user selects one of these solutions to carry into the second stage: compromise programming. The second stage uses input from the user in an iterative and intuitive fashion. …

    louisville Repository record for A multi-objective decision support system for worker-task assignments and workforce training. (opens in a new tab)

  7. Approximate Algorithms for the Combined arrival-Departure Aircraft Sequencing and Reactive Scheduling Problems on Multiple Runways

    … Priority Index (FPI) are proposed. Moreover, metaheuristics including Simulated Annealing (SA) and the Metaheuristic for Randomized Priority Search (Meta-RaPS) are introduced to improve solutions initially constructed by the proposed greedy algorithms. The performance (solution quality and …

    odu Repository record for Approximate Algorithms for the Combined arrival-Departure Aircraft Sequencing and Reactive Scheduling Problems on Multiple Runways (opens in a new tab)