Navegação por Assunto "Otimizacao combinatoria"
Resultados 1-15 de 15
-
Abordagem heurística para solução do problema de alocação de médicos do HCPA
(2018) [Trabalho de conclusão de graduação]O Problema de Escalonamento de Profissionais possui diversas variações e aplicações em diferentes contextos. A versão específica desse problema tratada neste trabalho é o Problema de Alocação de Médicos do Hospital de ... -
Applying dynamic programming to assembly line balancing and sequencing problems
(2013) [Trabalho de conclusão de graduação]Este trabalho apresenta dois algoritmos de Programação Dinâmica que tratam os problemas Simple Assembly Line Balancing Problem (SALBP) e Bin-Packing Problem with Precedence Constraints (BPP-P). Enquanto o primeiro problema ... -
Formulations and algorithms for the optimum communication spanning tree problem
(2021) [Trabalho de conclusão de graduação]The Optimum Communication Spanning Tree problem (OCT) has applications in many fields of study such as logistics, telecommunications and bioinformatics. This problem receives as input an undirected graph with weighted edges ... -
A genetic algorithm for fair land allocation
(2018) [Dissertação]The goal of agrarian reform projects is the redistribution of farmland from large latifundia to smaller, often family farmers. One of the main problems the Brazilian National Institute of Colonization and Agrarian Reform ... -
A matheuristic approach for solving the high school timetabling problem
(2015) [Tese]The school timetabling is a classic optimization problem that has been extensively studied due to its practical and theoretical importance. It consists in scheduling a set of class-teacher meetings in a prefixed period of ... -
Minimizing the weighted number of late jobs on a single machine with equal processing times and agreeable release and due dates
(2022) [Trabalho de conclusão de graduação]Consider the problem of a set of n jobs which needs to be processed by a single ma chine. The processing time for each job is identical to all the others, and predefined. Once on the machine, preemptions are not allowed. ... -
Multi-point search for combinatorial optimization problems
(2013) [Trabalho de conclusão de graduação]Neste trabalho propomos e testamos maneiras de aplicar os princípios por traz do go with the winners, em problemas de otimização combinatória. Go with the winners foi proposto como um algorítimo para mover partículas em ... -
Network monitoring optimization : problem, models and solutions
(2018) [Trabalho de conclusão de graduação]As data traffic grows, service providers are faced with the challenge of how to best use their infrastructure while trying to obtain statistics about their environment. The existing solutions to monitor such networks are ... -
Uma Proposta de especificação formal e fundamentação teórica para simulated annealing
(2000) [Dissertação]Os algoritmos baseados no paradigma Simulated Annealing e suas variações são atualmente usados de forma ampla na resolução de problemas de otimização de larga escala. Esta popularidade é resultado da estrutura extremamente ... -
Solving the dial-a-ride problem with the firefly metaheuristic
(2016) [Trabalho de conclusão de graduação]O problema Dial-a-ride (DARP) é um problema de otimização combinatória NP-difícil com aplicações práticas em transporte público orientado a usuário. O DARP é um problema de roteamento de veículos cujas instâncias consistem ... -
Statistical mechanics and optimization in complex scenarios
(2021) [Dissertação]Combinatorial optimization problems, such as the process of searching for extrema of a function over a discrete domain, are ubiquitous in science and engineering. Despite its ubiquity, some of these problems are notably ... -
A study onshop sceduling problems
(2018) [Tese]Shop scheduling is a combinatorial optimization type of problem in which we must allocate machines to jobs for specific periods time. A set of constraints defines which schedules are valid, and we must select one that ... -
The pickup and delivery problem with time windows : algorithms, instances, and solutions
(2019) [Dissertação]This work considers the Pickup and Delivery Problem with Time Windows. It is a hard combinatorial optimization problem that generalizes a number of vehicle routing problem and finds applications in courier and dial-a-ride ... -
The state of the art in MILP formulations for the guillotine 2D knapsack and related problems
(2022) [Tese]This thesis advances the state of the art in Mixed-Integer Linear Programming (MILP) formulations for Guillotine 2D Cutting Problems by (i) proposing a (re-)formulation that improves on a state-of-the-art formulation by ... -
The unbounded knapsack problem : a critical review
(2017) [Dissertação]A review of the algorithms and datasets in the literature of the Unbounded Knapsack Problem (UKP) is presented in this master's thesis. The algorithms and datasets used are brie y described in this work to provide the ...
