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 30 for “"Greedy heuristics"”.
-
Virtual Machine Migration: Greedy Heuristics and Mathematical Models
… work, we propose a set of solutions based on greedy heuristics for the VM migration problem. We have selected four possible criteria to base scheduling decisions on, and we evaluate the total migration time degree of completion of the planned migrations next to a baseline algorithm. …
-
A hybrid genetic-greedy approach to the skills management problem.
… to solve through brute force. Already several greedy heuristics have been produced, though their performance degrades for larger data sets. As Genetic Algorithms (GA) are effective for large combinatorial problems, their application to the task assignment problem may prove successful. The …
-
Dynamic Prescriptive Analytics for Logistics Service Providers
… rollout-based algorithms that outperform greedy heuristics. In chapter 4, we discuss the development of a simulation model that allows a deeper understanding of the trade-off between order consolidation and timely order fulfillment in multi-order picking systems in warehouses. We propose a …
-
Conditional covering problem: Study of complexity and optimization methods
… solutions for general graphs. We applied both greedy heuristics and metaheuristics to determine near-optimal solutions. Building off our understanding of optimal solutions on tree structures, we incorporate the idea of trees into our heuristic search. We found that greedy heuristics provide …
-
Optimization in Geometric Graphs: Complexity and Approximation
… theoretical justifications for several greedy heuristics. Unit ball graphs, which are defined in the three dimensional Euclidian space, have several application areas such as computational geometry, facility location and, particularly, wireless communication networks. Efficient operation …
-
Análise da alocação de embarcações de apoio offshore com o uso de heurísticas e simulação de eventos discretos
… one known as FIFO rule, two allocation greedy heuristics and one exact optimization method. To be possible compare the approaches the development of a discrete-event system simulator, which represents the operating conditions of Brazilian offshore scenario, was necessary. Associate with …
-
Energy Efficiency in Optical Network Planning
… using Mixed Integer Linear Programming (MILP), greedy heuristics and sophisticated meta-heuristics. Results show that an appropriate design can increase energy efficiency in fixed-grid WDM and flexible-grid elastic optical networks. The problem of power-efficient design of IP-over-WDM networks …
-
On social event organization
… heuristic algorithms that improve upon simple greedy algorithms by incorporating the notion of phantom events and by using look-ahead estimation. Using synthetic datasets and three real datasets including those from the platforms Meetup and Plancast, we experimentally demonstrate that our …
-
Statistical model-based methods for observation selection in wireless sensor networks and for feature selection in classification
… traffic signal controls by employing two greedy heuristics, entropy and submodular mutual information, based on Gaussian process models. We demonstrate their performance in a simulated traffic road networking map. Experimental results reveal insights of the two heuristics. We also compare …
-
Efficient algorithms for solving multi-objective optimization and large-scale transportation problems
… instances, we design and implement two heuristics: (1) a metaheuristic, and (2) a hybrid matheuristic. In Chapter 4, we introduce a novel incremental network design problem: the \textit{incremental network design problem with multi-commodity flows}. We model the problem as an integer …
-
Analysis of a proposal to implement the readiness-based sparing process in the Brazilian Navy
… a range of efficient solutions computed using greedy heuristics. The results indicate that the analyzed inventory could be dramatically reduced, while the expected average system availability would not be adversely affected. Moreover, potential cost savings could be leveraged if the proposed …
-
Efficient heuristics for the consecutive zeros problem in sparse Jacobian matrix determination
… of ACO (Zp-Hybrid and Zp-Estimator), and several greedy heuristics (Exhaustive Approach, Selective Exhaustive, and Single Attempt). The computational results from a subset of benchmark test matrices clearly demonstrate the effectiveness of the proposed approaches.
-
A complementary heuristic for the unbounded knapsack problem
… the performance analysis of density-ordered greedy heuristic, weight-ordered greedy heuristic, value-ordered greedy heuristic, extended greedy heuristic and total-value heuristic has been done. Empirical experiments on different test problems have been analysed and reported. Problem instances …
-
An effective guidance strategy for abstraction-guided simulation
… simulation — different guidance heuristics and formal tools are easily inserted — while providing the capacity, speed, and Verilog compatibility of a leading industry-standard (logic-simulation) tool, Synopsys VCS. Then, we start by exploring some greedy heuristics and find that …
-
Matching buying and selling of skills: An optimal skill selection problem in an online market
… it using both the commercial solver CPLEX and greedy heuristics.
-
IAB Network Planning: A Deep Learning Framework for 6G Wireless Systems
… Linear Programming (MILP) formulations and greedy heuristics, achieving near-optimal solutions for networks with up to 30 nodes while exposing exponential computational growth for larger deployments. To improve scalability, we develop Deep Q-Network (DQN) variants with action elimination, …
-
Optimization and Scheduling Methodologies to Enable Low Earth Orbit Nano-satellite Communication
… Comparisons are also made to simple greedy heuristics to demonstrate the value of optimization.
-
Sparse and Accurate Models Towards Interpretable Machine Learning
… time frame, overcoming the limitations of greedy heuristics. \item In survival analysis, we provide two novel approaches: a method for learning provably-optimal sparse survival trees and a new optimization framework for sparse Cox Proportional Hazards models that avoids the common issue of …
-
Employee training and assignment for team-based manufacturing systems
… and tasks. Several solution methods including greedy heuristics, beam search, filtered beam search, and simulated annealing techniques are developed for solving the mathematical models. They are tested and compared to a standard optimization software for a set of test problems. Results indicate …
Page 1 of 2