Mixed Integer Problems
Mostrando 1-12 de 17 artigos, teses e dissertações.
-
1. ANALYSIS OF MIXED INTEGER PROGRAMMING FORMULATIONS FOR SINGLE MACHINE SCHEDULING PROBLEMS WITH SEQUENCE DEPENDENT SETUP TIMES AND RELEASE DATES
ABSTRACT The scheduling of jobs over a single machine with sequence dependent setups is a classical problem setting that appears in many practical applications in production planning and logistics. In this work, we analyze six mixed-integer formulation paradigms for this classical context considering release dates and two objective functions: the total weigh
Pesqui. Oper.. Publicado em: 09/05/2019
-
2. MULTICOMMODITY NETWORK FLOWS WITH NONCONVEX ARC COSTS
ABSTRACT We present a survey on nonconvex models and algorithms for multicommodity network design problems. We put in perspective the alternative modelling of these problems, traditionally represented by mixed-integer linear programs, by separable nonconvex arc cost functions. We show in particular that some problems take profit of a continuous modelling and
Pesqui. Oper.. Publicado em: 2017-09
-
3. A MODEL-BASED HEURISTIC FOR THE IRREGULAR STRIP PACKING PROBLEM
ABSTRACT The irregular strip packing problem is a common variant of cutting and packing problems. Only a few exact methods have been proposed to solve this problem in the literature. However, several heuristics have been proposed to solve it. Despite the number of proposed heuristics, only a few methods that combine exact and heuristic approaches to solve th
Pesqui. Oper.. Publicado em: 2016-12
-
4. A Heuristic Algorithm Based on Line-up Competition and Generalized Pattern Search for Solving Integer and Mixed Integer Non-linear Optimization Problems
Abstract The global optimization of integer and mixed integer non-linear problems has a lot of applications in engineering. In this paper a heuristic algorithm is developed using line-up competition and generalized pattern search to solve integer and mixed integer non-linear optimization problems subjected to various linear or nonlinear constraints. Due to i
Lat. Am. j. solids struct.. Publicado em: 2016-02
-
5. Duality results for stationary problems of open pit mine planning in a continuous function framework
Open Pit Mine Planning problems are usually considered in a Mixed Integer Programming context. Characterizing each attainable profile by a continuous function yields a continuous framework. It allows for a more detailed modeling of slope constraints and other material properties of slanted layers. Although the resulting nonlinear programming problems are in
Computational & Applied Mathematics. Publicado em: 2011
-
6. Comparative analysis of voltage regulation strategies in power distribution systems with distributed generators / Análise comparativa de estratégias para regulação de tensão em sistemas de distribuição de energia elétrica na presença de geradores distribuídos
In order to assure that the installation of distributed generation would improve the operation of distribution and subtransmission networks, its technical impacts should be carefully studied, especially in distribution networks, which were originally designed to operate with unidirectional power flow. Among these impacts, the influence of distributed generat
Publicado em: 2010
-
7. Algorithms for nonlinear programming problems with integer and continuous variables. / Algoritmos para problemas de programação não-linear com variáveis inteiras e contínuas.
Muitos problemas de otimização envolvem tanto variáveis inteiras quanto contínuas e podem ser modelados como problemas de programação não-linear inteira mista. Problemas dessa natureza aparecem com freqüência em engenharia química e incluem, por exemplo, síntese de processos, projeto de colunas de destilação, síntese de rede de trocadores de ca
Publicado em: 2009
-
8. Uma abordagem para minimização de consumo de energia em redes de sensores sem fio com sorvedouros móveis
In this work, we introduce a new network topology model and algorithms to minimize the energy consumption in Wireless Sensor Networks (WSNs) with mobile sinks. On the one hand, the proposed optimization problem explicitly minimizes the energy consumption rates due to message forwarding. On the other hand, it also attempts to keep message delay rates at low l
Publicado em: 2009
-
9. A programação de produção em fundições de pequeno porte: modelagem matemática e métodos de solução / The production planning is small-driven foundries: mathematical modeling and solution methods
Este trabalho trata de um problema de programação da produção em fundições de pequeno porte, que consiste em programar as ligas que devem ser produzidas em cada período do planejamento e como tais ligas devem ser usadas para a produção de itens sob encomenda, de modo que atrasos e custos operacionais sejam minimizados. Devido à certa incerteza nos
Publicado em: 2007
-
10. Fleet scheduling subject to multiple vessels for the each task in an offshore operation. / Programação de frota de apoio a operações offshoresujeita à requisição de múltiplas embarcações para uma mesma tarefa.
A presente pesquisa aborda um problema de roteirização e programação de veículos incorporando uma nova restrição operacional: a requisição simultânea de múltiplos veículos para atendimento da demanda. Trata-se de uma característica encontrada em operações de apoio à exploração de petróleo "offshore", em que mais de uma embarcação é requ
Publicado em: 2007
-
11. An heuiristic for the lot sizing problem in small market-driven foundries / Uma heurística para o problema de dimensionamento de lotes em fundições de mercado
The foundry sector is important to the economy as it produces basic components for many other sectors, to such an extent that its performance has a repercussion in other sectors. A recently published mixed integer-programming model for small market-driven foundries, which aims to minimize delays when delivering orders, was proposed in the literature. In this
Publicado em: 2006
-
12. Abordagens para o problema integrado de dimensionamento e sequenciamento de lotes da produção de bebidas.
The object of this study is the integrated problem of lot sizing and scheduling of the soft drink production. Such problem consists of deciding how much to produce of each drink and in each period and in which sequence, in order to satisfy the demand and to minimize the costs of storage, backlogging and changeover. The set up times of the machines are sequen
Publicado em: 2006