Joint rolling-horizon scheduling of materials processing and lot-sizing with sequence-dependent setups

A lot sizing and scheduling problem from a foundry is considered in which key materials are produced and then transformed into many products on a single machine. A mixed integer programming (MIP) model is developed, taking into account sequence-dependent setup costs and times, and then adapted for rolling horizon use. A relax-and-fix (RF) solution heuristic is proposed and computationally tested against a high-performance MIP solver. Three variants of local search are also developed to improve the RF method and tested. Finally the solutions are compared with those currently practiced at the foundry.

Combining artificial intelligence and human problem solving: Proposing a new architecture for ITS's

This paper shows a comparative study between the Artificial Intelligence Problem Solving and the Human Problem Solving. The study is based on the solution by many ways of problems proposed via multiple-choice questions. General techniques used by humans to solve this kind of problems are grouped in blocks and each block is divided in steps. A new architecture for ITS - Intelligent Tutoring System is proposed to support experts' knowledge representation and novices' activities. Problems are represented by a text and feasible answers with particular meaning and form, to be rigorously analyzed by the solver to find the right one. Paths through a conceptual space of states represent each right solution.

Distribution network planning using a constructive heuristic algorithm

An optimization technique to solve distribution network planning (DNP) problem is presented. This is a very complex mixed binary nonlinear programming problem. A constructive heuristic algorithm (CHA) aimed at obtaining an excellent quality solution for this problem is presented. In each step of the CHA, a sensitivity index is used to add a circuit or a substation to the distribution network. This sensitivity index is obtained solving the DNP problem considering the numbers of circuits and substations to be added as continuous variables (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an efficient nonlinear optimization solver. A local improvement phase and a branching technique were implemented in the CHA. Results of two tests using a distribution network are presented in the paper in order to show the ability of the proposed algorithm. ©2009 IEEE.

Dependência estrutural da capacidade de rotação plástic em vigas de concreto armado

Summary In this work the structural dependence of plastic rotation capacity in RC beams is evaluated using the Finite Element Method. The objective is to achieve a better understanding of the non-linear behavior of reinforced concrete members and perform extensive parameter studies, using a rational model developed by Bigaj [1] to analyze the phenomenon of plastic rotation capacity in reinforced concrete members. It is assumed that only bending failure is relevant due to sufficient member resistance against shear and torsion. The paper begins with the physical and theoretical background of the phenomenon of plastic hinge development in RC structures. Special emphasis is laid on the issue of structural dependence of deformation capacity of plastic hinges in RC members. Member size dependence and influence of properties of construction materials were emphasized as well. The essential components of the Bigajs model for calculating the plastic rotation capacity are discussed. The behaviour of the plastic hinge is analysed taking into account the strain localisation in the damage zones of the hinge region. The Fictitious Crack Model (FCM) and the Compressive Damage Zone Model (CDZ) are adopted in a Fracture Mechanics approach to model the behaviour of concrete in tension and compression, respectively. The approach is implemented in FEMOOP, a FEM in-house solver under development, and applied to evaluate ductility in 2D beams. The models were generated with GiD, a pre-processor and post-processor developed by CIMNE, and analyzed with the capabilities implemented in FEMOOP. © Universitat Politècnica de Catalunya, Barcelona, España 2010.

Strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem

This paper proposes strategies to reduce the number of variables and the combinatorial search space of the multistage transmission expansion planning problem (TEP). The concept of the binary numeral system (BNS) is used to reduce the number of binary and continuous variables related to the candidate transmission lines and network constraints that are connected with them. The construction phase of greedy randomized adaptive search procedure (GRASP-CP) and additional constraints, obtained from power flow equilibrium in an electric power system are employed for more reduction in search space. The multistage TEP problem is modeled like a mixed binary linear programming problem and solved using a commercial solver with a low computational time. The results of one test system and two real systems are presented in order to show the efficiency of the proposed solution technique. © 1969-2012 IEEE.

Implementation of an AC model for transmission expansion planning considering reliability constraints

In this paper, a hybrid heuristic methodology that employs fuzzy logic for solving the AC transmission network expansion planning (AC-TEP) problem is presented. An enhanced constructive heuristic algorithm aimed at obtaining a significant quality solution for such complicated problems considering contingency is proposed. In order to indicate the severity of the contingency, 2 performance indices, namely the line flow performance index and voltage performance index, are calculated. An interior point method is applied as a nonlinear programming solver to handle such nonconvex optimization problems, while the objective function includes the costs of the new transmission lines as well as the real power losses. The performance of the proposed method is examined by applying it to the well-known Garver system for different cases. The simulation studies and result analysis demonstrate that the proposed method provides a promising way to find an optimal plan. Obtaining the best quality solution shows the capability and the viability of the proposed algorithm in AC-TEP. © Tübi̇tak..

Metodologia para o planejamento da operação de sistemas hidrotérmicos em mercado elétrico competitivo

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Planejamento da expansão de sistemas de distribuição usando a metaheurística de busca em vizinhança variável

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Algoritmo GRASP especializado aplicado ao problema de reconfiguração de alimentadores em sistemas de distribuição radial

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

Geração algébrica de malhas bidimensionais

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

Avaliação do desempenho da saúde pública com aplicação de métodos de auxílio à tomada de decisão e de gestão estratégica

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

Planejamento estocástico da expansão da rede de transmissão de energia elétrica multiestágio considerando restrições de segurança

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

Análise de novos modelos matemáticos para o problema de planejamento da expansão de sistemas de transmissão

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

Otimização multiobjetivo no planejamento agregado da produção e na cogeração de energia elétrica de usina do setor sucroenergético

Pós-graduação em Engenharia Mecânica - FEG

Métodos de solução para um problema de sequenciamento da produção com sincronismo de execução de tarefas

Pós-graduação em Engenharia Mecânica - FEG