Constraint Programming
Mostrando 1-12 de 39 artigos, teses e dissertações.
-
1. The electric boat charging problem
Abstract Paper aims This paper studies a new optimization problem called the Electric Boat Charging Problem (EBCP), which is based on the application of electric mobility in a river transport operation problem. Originality This work pioneers the studies of the electric mobility on the river operations, by proposing the EBCP. This problem includes real feat
Prod.. Publicado em: 23/09/2019
-
2. A COMPARATIVE STUDY OF STOCHASTIC QUADRATIC PROGRAMMING AND OPTIMAL CONTROL MODEL IN PRODUCTION-INVENTORY SYSTEM WITH STOCHASTIC DEMAND
ABSTRACT This study compares the optimal control model and stochastic quadratic programming (SQP) model of a production-inventory system. A single product, without shortage in the case of a periodic-review policy with stochastic demand and deterioration rate as a function of time, is discussed. The items are subjected to deterioration via storage and the inv
Pesqui. Oper.. Publicado em: 2017-01
-
3. A single loop reliability-based design optimization using EPM and MPP-based PSO
A reliability-based design optimization (RBDO) incorporates a probabilistic analysis with an optimization technique to find a best design within a reliable design space. However, the computational cost of an RBDO task is often expensive compared to a deterministic optimization, which is mainly due to the reliability analysis performed inside the optimization
Lat. Am. j. solids struct.. Publicado em: 2014-10
-
4. An efficient hybrid heuristic method for the 0-1 exact k-item quadratic knapsack problem
The 0-1 exact k-item quadratic knapsack problem (E - kQKP) consists of maximizing a quadratic function subject to two linear constraints: the first one is the classical linear capacity constraint; the second one is an equality cardinality constraint on the number of items in the knapsack. Most instances of this NP-hard problem with more than forty variables
Pesqui. Oper.. Publicado em: 2014-04
-
5. O problema do caixeiro viajante com restrições de empacotamento tridimensional / The traveling salesman problem with three-dimensional loading constraints
Nesta dissertação de mestrado apresentamos um método exato para o Problema do Caixeiro Viajante com Restrições de Empacotamento Tridimensional, que combina o Problema do Caixeiro Viajante o Problema de Empacotamento Tridimensional com Restrição de Ordem. Neste problema, um veículo deve partir carregado de um depósito e entregar caixas em pontos pré
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 14/10/2011
-
6. Optimum truss design under failure constraints combining continuous and integer programming
Publicado em: 2011
-
7. Derivative-free methods for nonlinear programming with general lower-level constraints
Augmented Lagrangian methods for derivative-free continuous optimization with constraints are introduced in this paper. The algorithms inherit the convergence results obtained by Andreani, Birgin, Martínez and Schuverdt for the case in which analytic derivatives exist and are available. In particular, feasible limit points satisfy KKT conditions under the C
Comput. Appl. Math.. Publicado em: 2011
-
8. O problema de planejamento e agendamento de operações em uma rede de oleodutos / The problem of planning and scheduling the operation of an oil pipeline
Um conjunto de órgãos distribuidores de derivados de petróleo, incluindo refinarias e terminais, possuem demandas locais e produções de diferentes produtos ao longo de um dado horizonte de tempo. No entanto, pode não haver estoque local de algum produto para satisfazer a demanda correspondente, ou pode não haver espaço nos tanques para estocar uma pr
Publicado em: 2010
-
9. Exploração de paralelismo ou em uma linguagem em lógica com restrições / OR parallelism exploitation in a constraint logic language
Este trabalho a dedicado ao estudo da exploração de paralelismo OU na programação em lógica com restrições em ambientes distribuídos. A programação em lógica, cuja linguagem mais significativa 6 Prolog, tem como premissa a utilização da lógica de predicados como linguagem computacional. A programação em lógica com restrições (CLP) é uma e
Publicado em: 2010
-
10. Sequential quadratic programming and constraint qualification / Programação quadratica sequencial e condições de qualificação
In the context of constrained optimization problems, we face the optimality conditions and also constraint qualification. Our aim is to study with details several constraint qualification, highlighting the constant positive linear dependence condition, and its influence in Sequential Quadratic Programming algorithms convergence. The relevance of this study i
Publicado em: 2009
-
11. A filter SQP algorithm without a feasibility restoration phase
In this paper we present a filter sequential quadratic programming (SQP) algorithm for solving constrained optimization problems. This algorithm is based on the modified quadratic programming (QP) subproblem proposed by Burke and Han, and it can avoid the infeasibility of the QP subproblem at each iteration. Compared with other filter SQP algorithms, our alg
Computational & Applied Mathematics. Publicado em: 2009
-
12. Derivative-free nonlinear programming / Programação não linear sem derivadas
We propose in this work a derivative-free Augmented Lagrangian algorithm for the general problem of optimization. We consider the method due to Andreani, Birgin, Martínez and Schuverdt, eliminating the derivative computations in the algorithm by making suitable modifications on the stopping criterion. The good theoretical results of the method were mantaine
Publicado em: 2009