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 28 for “"Meta-heuristic algorithm"”.

  1. A Meta-Heuristic Algorithm for Vehicle Routing Problem with Interdiction

    … both exact methods, using the CPLEX solver, and heuristic methods, particularly using the Greedy Randomized Adaptive Search Procedure (GRASP), to solve VRPI with different instance sizes. This research’s key contributions include successfully implementing the GRASP algorithm on large-scale …

    mcmaster Repository record for A Meta-Heuristic Algorithm for Vehicle Routing Problem with Interdiction (opens in a new tab)

  2. A TABU SEARCH ALGORITHM FOR FINDING CONSENSUS SEQUENCES

    … of molecules. Tabu Search method is a well known meta-heuristic algorithm. The basic concepts of Tabu Search are introduced. We also present a C++ implementation of a skeleton for Tabu Search method. The implementation provides both robustness and re-usability properties. We have instantiated the …

    nus Repository record for A TABU SEARCH ALGORITHM FOR FINDING CONSENSUS SEQUENCES (opens in a new tab) Download file for A TABU SEARCH ALGORITHM FOR FINDING CONSENSUS SEQUENCES (opens in a new tab)

  3. A contribution to model predictive controllers with fixed switching frequency and low computational cost

    … powerconverter applications, based on a recent meta-heuristic algorithm, called the Jaya algorithm, as the optimizer of MPC. The proposed solution presents three bene ts: simple implementation, viable computational cost, and xed switching frequency. The proposed MPC strategy, referred to as …

    brazil-uerj Repository record for A contribution to model predictive controllers with fixed switching frequency and low computational cost (opens in a new tab)

  4. Berth and quay crane scheduling: problems, models and solution methods

    … are considered. A lower bound and an effective meta-heuristic algorithm are proposed for a dynamic variant of the Berth Allocation Problem (BAP). The Multiple Berth Allocation Problem (MBAP) is also introduced. Different crane scheduling methods used by terminal operators are analyzed and a tabu …

    gatech Repository record for Berth and quay crane scheduling: problems, models and solution methods (opens in a new tab)

  5. High-density parking for autonomous vehicles.

    … to maximum parking density. We then propose a heuristic method to solve larger problems, and mathematically prove that the method produces near-optimal results. To improve layout designs reducing vehicular movements, we propose a use of a meta-heuristic algorithm integrated with a deep …

    louisville Repository record for High-density parking for autonomous vehicles. (opens in a new tab)

  6. Models and algorithms for the empty container repositioning and its integration with routing problems

    … Programming formulation and propose an efficient meta-heuristic algorithm able to solve it. The meta-heuristic determines the initial solution by a variant of the Clarkeand-Wright algorithm, and improves it by several local search phases, in which both node movements and truck swaps are …

    cagliari Repository record for Models and algorithms for the empty container repositioning and its integration with routing problems (opens in a new tab)

  7. EdgeDAG: a latency-aware initial operator placement strategy for edge-based distributed stream processing applications

    … a new type of optimization function and using a meta-heuristic algorithm called Grey Wolf Optimizer, we can provide a good mapping between the edge nodes and operators.

    ets-quebec Download PDF for EdgeDAG: a latency-aware initial operator placement strategy for edge-based distributed stream processing applications (opens in a new tab)

  8. Computational Methods to Optimize High-Consequence Variants of the Vehicle Routing Problem for Relief Networks in Humanitarian Logistics

    … are independently examined. An efficient meta-heuristic algorithm based on a continuous spatial partitioning scheme is presented for constructing a minimized set of vehicle routes in practical instances of the VRP that include critically high-cost penalties. Multiple optimization priority …

    unt Repository record for Computational Methods to Optimize High-Consequence Variants of the Vehicle Routing Problem for Relief Networks in Humanitarian Logistics (opens in a new tab)

  9. Variable Speed Limit Control at SAG Curves Through Connected Vehicles: Implications of Alternative Communications and Sensing Technologies

    … in the roadway capacity and congestion. A VSL algorithm is developed and implemented in a simulation environment for controlling the inflow of vehicles to a sag curve on a freeway to minimize delays and increase throughput. Both vehicle-to-vehicle (V2V) and infrastructure-to-vehicle (I2V) …

    odu Repository record for Variable Speed Limit Control at SAG Curves Through Connected Vehicles: Implications of Alternative Communications and Sensing Technologies (opens in a new tab)

  10. Runtime Analysis on the (1+1) Memetic Algorithms

    A Memetic Algorithm is a population-based meta-heuristic algorithm that combines an Evolutionary Algorithm with a set of local search algorithms. The successful experimental results have verified the advantages of Memetic Algorithms, and also motivate the desire for a better understanding of …

    auckland-ms Repository record for Runtime Analysis on the (1+1) Memetic Algorithms (opens in a new tab)

  11. Deadline-Constrained Big Data Workflow Scheduling And Execution In The Cloud

    … workflow schedule. List-based scheduling algorithms have demonstrated their efficacy in generating feasible schedules with shorter response times compared to meta-heuristic algorithms for the workflow scheduling problem. In a cloud-based environment, workflow scheduling algorithms need to …

    wayne-thes Repository record for Deadline-Constrained Big Data Workflow Scheduling And Execution In The Cloud (opens in a new tab)

  12. Ant colony optimization to price transmission rights in electricity markets

    … pricing problem. Then, I use a nature inspired meta-heuristic algorithm, Ant Colony Optimization (ACO) to compute option prices and determine future Transmission Rights payouts. Goals of this research are to see suitability of ACO to price TRs and to compute TR payouts. Both these goals are …

    manitoba Repository record for Ant colony optimization to price transmission rights in electricity markets (opens in a new tab)

  13. Traffic Scheduling in Software-defined Backhaul Network

    … to the same wireless backhaul infrastructure. An algorithm, named VNE-SDBN, is proposed to solve the virtual network embedding (VNE) problem to improve the performance of the revenue of infrastructure providers and virtual network request acceptance ratio by exploiting the unique characteristics …

    whiterose Download PDF for Traffic Scheduling in Software-defined Backhaul Network (opens in a new tab)

  14. Batch Scheduling in Supply Chains

    … coordination are even harder. Hence, heuristic algorithms may be developed to solve such problems. A good heuristic can be developed only when the specific properties of the given problem are analyzed thoroughly. Since there are many problems at the supplier level and manufacturer …

    mcmaster Repository record for Batch Scheduling in Supply Chains (opens in a new tab)

  15. Intelligent dynamic signal timing optimization program

    … an extremely large decision space. Therefore, a meta-heuristic algorithm is developed. It creates a population of candidate solutions and improves their quality over different generations. To reduce the runtime, a heuristic method was developed to create feasible solutions for the first …

    uiuc Repository record for Intelligent dynamic signal timing optimization program (opens in a new tab)

  16. USING THE VEHICLE ROUTING PROBLEM (VRP) TO PROVIDE LOGISTICS SOLUTIONS IN AGRICULTURE

    … solvable Vehicle Routing Problem (VRP). A basic heuristic algorithm (a modified form of the Clarke-Wright algorithm) and a meta-heuristic algorithm, Tabu Search, were employed to solve the VRP. The solution considered optimization of field completion time as well as improving the field …

    uky-thes Repository record for USING THE VEHICLE ROUTING PROBLEM (VRP) TO PROVIDE LOGISTICS SOLUTIONS IN AGRICULTURE (opens in a new tab)

  17. Data-Driven Optimization Models for Shared Mobility-on-Demand Systems

    … approaches, reformulation, and decomposition algorithms to optimize the resource allocation problems in shared MoD systems. The research involves three synergistic shared MoD areas. (1) Kernel density enabled stochastic programming modeling for proactive vehicle allocation and reactive …

    concordia Download PDF for Data-Driven Optimization Models for Shared Mobility-on-Demand Systems (opens in a new tab)

  18. Visual semi-automation of requirements specification to dynamic models

    … helps to solve the planning problem using a meta-heuristic algorithm that deals with each pattern constraint's complexity with score rules. This is the construction of UML sequence diagrams, representing the realisation of the use case model. The outcomes show that the high-quality sequence …

    qu-belfast Repository record for Visual semi-automation of requirements specification to dynamic models (opens in a new tab) Download PDF for Visual semi-automation of requirements specification to dynamic models (opens in a new tab)

  19. Integrated and Coordinated Relief Logistics Planning Under Uncertainty for Relief Logistics Operations

    … epsilon-constraint and Lagrangian relaxation algorithms and demonstrate the model's applicability for a case study of an earthquake. Due to uncertainty in the number of injuries needing multi-type blood-derived platelets, we apply a robust optimization version of the proposed model which …

    ottawa-retro Repository record for Integrated and Coordinated Relief Logistics Planning Under Uncertainty for Relief Logistics Operations (opens in a new tab)

  20. Definition of a Common Formulation of Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms

    … in a form which allows the application of meta-heuristic algorithms. Currently different frequency assignment systems are in use in the four areas of the military, in the categories of land, air, maritime and satellite. The tasks are to define the common aspects of the relevant frequency …

    southwales Repository record for Definition of a Common Formulation of Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms (opens in a new tab) Download PDF for Definition of a Common Formulation of Military Frequency Assignment Problems and the Application of Meta-Heuristic Algorithms (opens in a new tab)

Page 1 of 2