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 477 for “"heuristic algorithms"”.

  1. Heuristic algorithms for motion planning

    … only if it can run fast enough.</p><p>Many heuristic planners have been created in an attempt to achieve the necessary speeds in off-line (or more ambitiously, on-line) processing. This thesis aims to show that different types of heuristic planners can be designed to take advantage of …

    oxford Repository record for Heuristic algorithms for motion planning (opens in a new tab)

  2. Heuristic algorithms for districting problems

    … methods for districting have so far focused on heuristics. However, upon review we find that methods are typically developed independently, with a focus on appli cations. In the second part of this thesis we look at districting from an application independent point of view. We propose an …

    brazil-ufrgs Repository record for Heuristic algorithms for districting problems (opens in a new tab)

  3. Sensitivity Analysis for Heuristic Algorithms

    Made available in DSpace on 2014-12-13T18:02:05Z (GMT). No. of bitstreams: 1 7913460.pdf: 4996780 bytes, checksum: 24e22abdab2c0b330dae4d5195c86768 (MD5) Previous issue date: 1978

    uiuc Repository record for Sensitivity Analysis for Heuristic Algorithms (opens in a new tab)

  4. Heuristic Algorithms for Nurse Rostering Problem /

    In the dissertation the nurse rostering problem is investigated. The formulation of the problem is based on real-world data of one of the largest healthcare centers in Lithuania. Most recent publications that tackle the nurse rostering problem and the methods for solving the nurse rostering problem …

    vilnius Repository record for Heuristic Algorithms for Nurse Rostering Problem / (opens in a new tab)

  5. Heuristic algorithms for wireless mesh network planning

    … of the problem. We propose four types of heuristic algorithms that uses greedy, local search, variable neighborhood search and Lagrangian relaxation based approaches for the problem. We evaluate the algorithms on database of network instances of 500-5000 nodes, some of which are randomly …

    lethbridge Repository record for Heuristic algorithms for wireless mesh network planning (opens in a new tab)

  6. Heuristic Algorithms For Broadcasting In Cactus Graphs

    … k-restricted cactus graphs. We then provide four heuristic algorithms that solves broadcasting on a k-cycle graph. A k-cycle graph is a collection of k cycles of arbitrary lengths all connected to a central vertex. Finally, we run simulations of these heuristic algorithms on different sized k-cycle …

    concordia Download PDF for Heuristic Algorithms For Broadcasting In Cactus Graphs (opens in a new tab)

  7. Improving Market Risk Management with Heuristic Algorithms

    … active portfolio optimisation techniques with heuristic algorithms to manage new regulatory challenges faced in risk management. We first study if heuristic algorithms can support risk management to find global optimal solutions to reduce the regulatory capital requirements. In a benchmark …

    essex Download PDF for Improving Market Risk Management with Heuristic Algorithms (opens in a new tab)

  8. Optimal distribution network reconfiguration using meta-heuristic algorithms

    … added to the distribution network. The heuristic optimization algorithm which is proposed in Chapter 3 and is improved in Chapter 5 is implemented on a smaller case study in Chapter 6 to demonstrate that the identified solution through the optimization process is the same with the …

    ucf Repository record for Optimal distribution network reconfiguration using meta-heuristic algorithms (opens in a new tab)

  9. Heuristic algorithms for the generalized vehicle dispatch problem

    "A heuristic algorithm, called the sweep algorithm, is developed for the vehicle dispatch problem with distance and load constraints for each vehicle. A mathematical development and a step procedure for the sweep algorithm is given. Also given are eight problems and their solutions derived by the …

    must-thes Repository record for Heuristic algorithms for the generalized vehicle dispatch problem (opens in a new tab)

  10. Heuristic algorithms for payment models in project scheduling

    … schedule. This dissertation aims to develop algorithms, which optimize the project NPV under different restrictions, by means of five studies. The first paper chapter focuses on NPV optimization subject to precedence and resource restrictions. It is furthermore assumed that both cash inflows …

    ghent Repository record for Heuristic algorithms for payment models in project scheduling (opens in a new tab)

  11. Heuristic algorithms for distributed processor scheduling with limited memory

    This thesis studies a heuristic approach to scheduling •on a 2-processor distributed system when one processor has a limited memory. A program is assumed to consist of a set of sequentially executing modules and is represented by Stone's graph model. It is desired to assign these modules to the …

    rice Repository record for Heuristic algorithms for distributed processor scheduling with limited memory (opens in a new tab)

  12. Heuristic Algorithms for Real Crane Scheduling Problems in Container Yards

    [ES] El transporte de contenedores es un factor clave en el comercio moderno, representando el segmento de más rápido crecimiento en el transporte marítimo, lo que ejerce una inmensa presión sobre los terminales portuarios, especialmente en las grúas de patio. Esta tesis aborda un problema realista …

    upv Repository record for Heuristic Algorithms for Real Crane Scheduling Problems in Container Yards (opens in a new tab)

  13. Selective harmonic elimination in multilevel converters using meta-heuristic algorithms

    … to boundary conditions. In this scenario, meta-heuristic algorithms such as Particle Swarm Optimization (PSO) and Genetic Algorithm (GA) have been employed as robust optimization strategies for the problem. This work proposes an approach based on these meta-heuristics with three main …

    brazil-ufrgs Repository record for Selective harmonic elimination in multilevel converters using meta-heuristic algorithms (opens in a new tab)

  14. Enhancing meta-heuristic algorithms using center-based sampling at population level

    … enhance the efficiency and effectiveness of meta-heuristic algorithms. The strategy of center-based sampling can be utilized at either the operation and/or population levels. Despite the overall efficiency of the center-based sampling in population-based algorithms, utilization at the operation …

    uoit Repository record for Enhancing meta-heuristic algorithms using center-based sampling at population level (opens in a new tab)

  15. Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting

    … and analysis of several approximation algorithms for Block Sorting, little or no work has been carried out thus far on the implementation of the proposed approximation algorithms. The conceptualization of an implementation framework and illustrating its use by experimenting with the …

    unf Repository record for Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting (opens in a new tab) Download PDF for Implementation and Performance Comparison of Some Heuristic Algorithms for Block Sorting (opens in a new tab)

  16. Heuristic algorithms for solving a class of multiobjective zero-one programming problems

    … is devoted to the design and development of heuristics for solving multiobjective zero-one integer linear programming problems. We present some useful concepts and propose some heuristic methods for finding the epsilon-nondominated solutions. The proposed method decomposes a multiobjective …

    nus Repository record for Heuristic algorithms for solving a class of multiobjective zero-one programming problems (opens in a new tab) Download file for Heuristic algorithms for solving a class of multiobjective zero-one programming problems (opens in a new tab)

Page 1 of 24