Resolução do problema de carregamento e descarregamento de contêineres em terminais portuários via Beam Search

One problem that has been happening frequently in port terminals is the poor planning of the loading and unloading of containers. The reason of this problem is the lack of an efficient method that provides the best means of these operations. The main goal of this work is, to implement a method that provides the best ways to perform the loading and unloading of containers, at each port and thus bring a great saving for these terminals, since the number of moves is directly proportional to cost. To carry out this program was used the idea that the containers are placed in vertical stacks, where the access can be done only by the top of the stack, so the ship was treated as an matrix and to fill it, two rules were created for loading and two for unloading. To obtain the best sequence of rules was used Beam Search method, which is an enumeration type implicit method that analyzes only the best solution of the tree generated. Thus, the program developed in the Java language, provides the best way to perform the loading and unloading ports and the way as the ship leaves each port using a graphical interface

Desenvolvimento de solução para o problema de alocação de navios em berços de terminais portuários: aplicação de algoritmos genéticos e otimização por nuvens de partículas

This work proposes two optimization algorithms for the solution of the Berth Allocation Problem (PAB). Due to the economic development of the country, it became necessary for the improvement of means of transport, which mainly shipping. For this, you need a better system management port, you will receive a lot of ships carrying cargo. In this work the PAB is approached so that the goals are to reduce costs and time handling in ports. For this, we applied two computational techniques, genetic algorithms and optimization for cloud particles, to obtain the best results for this problem. The results obtained with each type of algorithm are compared to conclude which method is more efficient for the port system

Resolução de problema de valor no contorno associado ao projeto de reatores de fluxo disperso empregados no tratamento de efluentes

The objective of this work was to develop a numerical method to solve boundary value problems concerning to the use of dispersion model for describing the hydraulic behavior of chemical or biological reactors employed in the wastewater treatment. The numerical method was implemented in FORTRAN language generating a computational program which was applied to solve cases involving reaction kinetics of both integer and fractional orders. The developed method was able to solve the proposed problems evidencing to be a useful tool that provides more accurate design of wastewater treatment reactors

The winner takes it all: o problema da representatividade no sistema eleitoral do Reino Unido

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Um problema de corte de estoque multiobjetivo

In this paper we deal with the one-dimensional integer cutting stock problem, which consists of cutting a set of available objects in stock in order to produce ordered smaller items in such a way as to optimize a given objective function, which in this paper is composed of three different objectives: minimization of the number of objects to be cut (raw material), minimization of the number of different cutting patterns (setup time), minimization of the number of saw cycles (optimization of the saw productivity). For solving this complex problem we adopt a multiobjective approach in which we adapt, for the problem studied, a symbiotic genetic algorithm proposed in the literature. Some theoretical and computational results are presented.

Usando o ATSP na Modelagem do Problema Integrado de Produção de Bebidas

Neste trabalho, propomos um modelo integrado de dimensionamento de lotes e programação da produção monomáquina para uma fábrica de refrigerantes de pequeno porte. As decisões de dimensionamento foram baseadas em um modelo encontrado na literatura e as decisões de sequenciamento foram modeladas utilizando restrições do problema do caixeiro viajante assimétrico. Para a validação do modelo proposto foram feitos testes computacionais com exemplares gerados aleatoriamente, e também exemplares baseados em dados reais obtidos da literatura. Os exemplares foram resolvidos pelo método Branch-and-Cut incluído no pacote computacional CPLEX 10.0. Os resultados mostram que o modelo proposto representa o planejamento da produção em fábricas de bebidas monomáquinas e que, em algumas situações, produz resultados melhores que o modelo da literatura.

Relaxação Lagrangiana Aplicada ao Problema de Dimensionamento de Lotes em Máquinas Paralelas: Limitantes Inferiores

This paper addresses the single stage lot-sizing problem in parallel machines. Each item can be produced on any machine, and incurs a setup time before to start the production. The objective of this paper is to obtain lower bounds of good quality for this problem. A solution method is developed based on a reformulation of the problem and the Lagrangian relaxation of a set of constraints. Some computational results are presented comparing the proposed method with a method from the literature and with a computational package.

Resolução do problema de sequenciamento de múltiplas linhas de montagem de modelos mistos em ambiente de produção enxuta

This work deals with the sequencing of Multi-Mixed-Model Assembly Lines in a lean manufacturing environment, where an operational structure where several kanbans support several mixed-model assembly lines, so that all assembly lines can receive parts or sub-assemblies from all suppliers. To optimize this system, the sequencing seeks to minimize the distance between the real consumption and the constant ideal consumption of parts or subassemblies, thereby reducing the scaling of kanbans and intermediate stocks. To solve the sequencing problems, the method Clustering Search was applied along with the metaheuristics Variable Neighborhood Search, Simulation Annealing and Iterative Local Search. Instances from the literature and generated instances were tested, thus allowing comparing the methods to each other and with other methods presented in the literature. The performance of the Clustering Search with Iterated Local Search stands out by the quality and robustness of their solutions, and mainly for its efficiency, whereas it converges to better results at a lower computational cost

O problema do Paralelismo Psicofisiológico segundo a Epistemologia Genética

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Método primal-dual previsor-corretor de pontos interiores e exteriores com estratégias de correção de inércia e suavização hiperbólica aplicado ao problema de despacho econômico com ponto de carregamento de válvula e representação da transmissão

Pós-graduação em Engenharia Elétrica - FEB

O problema da formação (bildung) em Sobre o futuro dos nossos estabelecimentos de ensino, de Nietzsche

Pós-graduação em Filosofia - FFC

Aplicação de técnicas metaheurísticas para resolver o problema de coordenação de carregamento de veículos elétricos em sistemas de distribuição

Pós-graduação em Engenharia Elétrica - FEIS

Propostas de modelagem matemática para o problema de restauração de sistemas de distribuição de energia elétrica radiais

Pós-graduação em Engenharia Elétrica - FEIS

Algoritmo tabu search especializado para o problema de planejamento da expansao de sistemas de transmissão

Pós-graduação em Engenharia Elétrica - FEIS