Utilização de inteligência competitiva, da gestão de riscos e da computação aplicada para ganhos de competitividade em instituição organizadora de concursos

Dissertação (mestrado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2015.

Numerical enclosures of the optimal cost of the Kantorovitch’s mass transportation problem

International audience

Lot production size problem and simulation of urban transport

OBJECTIVES AND STUDY METHOD: There are two subjects in this thesis: “Lot production size for a parallel machine scheduling problem with auxiliary equipment” and “Bus holding for a simulated traffic network”. Although these two themes seem unrelated, the main idea is the optimization of complex systems. The “Lot production size for a parallel machine scheduling problem with auxiliary equipment” deals with a manufacturing setting where sets of pieces form finished products. The aim is to maximize the profit of the finished products. Each piece may be processed in more than one mold. Molds must be mounted on machines with their corresponding installation setup times. The key point of our methodology is to solve the single period lot-sizing decisions for the finished products together with the piece-mold and the mold-machine assignments, relaxing the constraint that a single mold may not be used in two machines at the same time. For the “Bus holding for a simulated traffic network” we deal with One of the most annoying problems in urban bus operations is bus bunching, which happens when two or more buses arrive at a stop nose to tail. Bus bunching reflects an unreliable service that affects transit operations by increasing passenger-waiting times. This work proposes a linear mathematical programming model that establishes bus holding times at certain stops along a transit corridor to avoid bus bunching. Our approach needs real-time input, so we simulate a transit corridor and apply our mathematical model to the data generated. Thus, the inherent variability of a transit system is considered by the simulation, while the optimization model takes into account the key variables and constraints of the bus operation. CONTRIBUTIONS AND CONCLUSIONS: For the “Lot production size for a parallel machine scheduling problem with auxiliary equipment” the relaxation we propose able to find solutions more efficiently, moreover our experimental results show that most of the solutions verify that molds are non-overlapping even if they are installed on several machines. We propose an exact integer linear programming, a Relax&Fix heuristic, and a multistart greedy algorithm to solve this problem. Experimental results on instances based on real-world data show the efficiency of our approaches. The mathematical model and the algorithm for the lot production size problem, showed in this research, can be used for production planners to help in the scheduling of the manufacturing. For the “Bus holding for a simulated traffic network” most of the literature considers quadratic models that minimize passenger-waiting times, but they are harder to solve and therefore difficult to operate by real-time systems. On the other hand, our methodology reduces passenger-waiting times efficiently given our linear programming model, with the characteristic of applying control intervals just every 5 minutes.

Exact solutions for the agricultural and the two-dimensional packing problems

Objectives and study method: The objective of this study is to develop exact algorithms that can be used as management tools for the agricultural production planning and to obtain exact solutions for two of the most well known twodimensional packing problems: the strip packing problem and the bin packing problem. For the agricultural production planning problem we propose a new hierarchical scheme of three stages to improve the current agricultural practices. The objective of the first stage is to delineate rectangular and homogeneous management zones into the farmer’s plots considering the physical and chemical soil properties. This is an important task because the soil properties directly affect the agricultural production planning. The methodology for this stage is based on a new method called “Positions and Covering” that first generates all the possible positions in which the plot can be delineated. Then, we use a mathematical model of linear programming to obtain the optimal physical and chemical management zone delineation of the plot. In the second stage the objective is to determine the optimal crop pattern that maximizes the farmer’s profit taken into account the previous management zones delineation. In this case, the crop pattern is affected by both management zones delineation, physical and chemical. A mixed integer linear programming is used to solve this stage. The objective of the last stage is to determine in real-time the amount of water to irrigate in each crop. This stage takes as input the solution of the crop planning stage, the atmospheric conditions (temperature, radiation, etc.), the humidity level in plots, and the physical management zones of plots, just to name a few. This procedure is made in real-time during each irrigation period. A linear programming is used to solve this problem. A breakthrough happen when we realize that we could propose some adaptations of the P&C methodology to obtain optimal solutions for the two-dimensional packing problem and the strip packing. We empirically show that our methodologies are efficient on instances based on real data for both problems: agricultural and two-dimensional packing problems. Contributions and conclusions: The exact algorithms showed in this study can be used in the making-decision support for agricultural planning and twodimensional packing problems. For the agricultural planning problem, we show that the implementation of the new hierarchical approach can improve the farmer profit between 5.27% until 8.21% through the optimization of the natural resources. An important characteristic of this problem is that the soil properties (physical and chemical) and the real-time factors (climate, humidity level, evapotranspiration, etc.) are incorporated. With respect to the two-dimensional packing problems, one of the main contributions of this study is the fact that we have demonstrate that many of the best solutions founded in literature by others approaches (heuristics approaches) are the optimal solutions. This is very important because some of these solutions were up to now not guarantee to be the optimal solutions.

Texto guía para docentes enfocado en el bloque de matemáticas discretas en el primero B.G.U.

El presente trabajo de titulación denominado Texto Guía para Docentes enfocado en el bloque de Matemáticas Discretas del Primero B.G.U, ha sido desarrollado con la finalidad de presentar un aporte significativoy de ayuda al docente de Matemáticas de Primero de Bachillerato, anhelando un mejor desenvolvimiento dentro del aula de clase. Este documento está elaborado en base a la legislación educativa ecuatoriana vigente y de los documentos oficiales del Ministerio de Educación, el tema propuesto corresponde al tercer bloque curricular del primer año de Bachillerato General Unificado en la asignatura de Matemáticas. Nuestro trabajo de titulación se compone de tres capítulos. En el capítulo uno, se presenta una síntesis de temas como la evolución de la educación ecuatoriana, los modelos pedagógicos, los métodos de enseñanza, didáctica de la matemática y programación lineal, considerados como base para el desarrollo de la propuesta. En el capítulo dos, se detalla la investigación estadística realizada mediante una encuesta aplicada a docentes de Matemáticas de Primer año de Bachillerato, pertenecientes a la Coordinación Zonal 6 de Educación, Distrito Norte. Los resultados encontrados cimentaron la propuesta de la implementación del texto guía para el aprendizaje de Matemáticas Discretas. En el capítulo tres se elabora la propuesta del texto guía, estructurado en seis guías didácticas, cada una corresponde al desarrollo de una destreza con criterio de desempeñopara el tema planteado. Al final de este capítulo, se detallan conclusiones y recomendaciones dirigidas para el docente de matemáticas.

Short-Term Trading for a Wind-PV Power Producer in an Electricity Market

This paper deals with the problem of coordinated trading of wind and photovoltaic systems in order to find the optimal bid to submit in a pool-based electricity market. The coordination of wind and photovoltaic systems presents uncertainties not only due to electricity market prices, but also with wind and photovoltaic power forecast. Electricity markets are characterized by financial penalties in case of deficit or excess of generation. So, the aim o this work is to reduce these financial penalties and maximize the expected profit of the power producer. The problem is formulated as a stochastic linear programming problem. The proposed approach is validated with real data of pool-based electricity market of Iberian Peninsula.

Bidding and Optimization Strategies for Wind-PV Systems in Electricity Markets

The variability in non-dispatchable power generation raises important challenges to the integration of renewable energy sources into the electricity power grid. This paper provides the coordinated trading of wind and photovoltaic energy to mitigate risks due to the wind and solar power variability, electricity prices, and financial penalties arising out the generation shortfall and surplus. The problem of wind-photovoltaic coordinated trading is formulated as a linear programming problem. The goal is to obtain the optimal bidding strategy that maximizes the total profit. The wind-photovoltaic coordinated operation is modeled and compared with the uncoordinated operation. A comparison of the models and relevant conclusions are drawn from an illustrative case study of the Iberian day-ahead electricity market.

Coordinated Scheduling of Wind-Thermal Gencos in Day-Ahead Markets

This paper presents a stochastic mixed-integer linear programming approach for solving the self-scheduling problem of a price-taker thermal and wind power producer taking part in a pool-based electricity market. Uncertainty on electricity price and wind power is considered through a set of scenarios. Thermal units are modeled by variable costs, start-up costs and technical operating constraints, such as: ramp up/down limits and minimum up/down time limits. An efficient mixed-integer linear program is presented to develop the offering strategies of the coordinated production of thermal and wind energy generation, aiming to maximize the expected profit. A case study with data from the Iberian Electricity Market is presented and results are discussed to show the effectiveness of the proposed approach.

Bidding and Optimization Strategies for Wind-PV Systems in Electricity Markets Assisted by CPS

The variability in non-dispatchable power generation raises important challenges to the integration of renewable energy sources into the electricity power grid. This paper provides the coordinated trading of wind and photovoltaic energy assisted by a cyber-physical system for supporting management decisions to mitigate risks due to the wind and solar power variability, electricity prices, and financial penalties arising out the generation shortfall and surplus. The problem of wind-photovoltaic coordinated trading is formulated as a stochastic linear programming problem. The goal is to obtain the optimal bidding strategy that maximizes the total profit. The wind-photovoltaic coordinated operation is modelled and compared with the uncoordinated operation. A comparison of the models and relevant conclusions are drawn from an illustrative case study of the Iberian day-ahead electricity market.

Bidding Decision of Wind-Thermal GenCo in Day-Ahead Market

This paper deals with the self-scheduling problem of a price-taker having wind and thermal power production and assisted by a cyber-physical system for supporting management decisions in a day-ahead electric energy market. The self-scheduling is regarded as a stochastic mixed-integer linear programming problem. Uncertainties on electricity price and wind power are considered through a set of scenarios. Thermal units are modelled by start-up and variable costs, furthermore constraints are considered, such as: ramp up/down and minimum up/down time limits. The stochastic mixed-integer linear programming problem allows a decision support for strategies advantaging from an effective wind and thermal mixed bidding. A case study is presented using data from the Iberian electricity market.

Bidding strategy of wind-thermal energy producers

This paper presents a stochastic mixed-integer linear programming approach for solving the self-scheduling problem of a price-taker thermal and wind power producer taking part in a pool-based electricity market. Uncertainty on electricity price and wind power is considered through a set of scenarios. Thermal units are modelled by variable costs, start-up costs and technical operating constraints, such as: forbidden operating zones, ramp up/down limits and minimum up/down time limits. An efficient mixed-integer linear program is presented to develop the offering strategies of the coordinated production of thermal and wind energy generation, having as a goal the maximization of profit. A case study with data from the Iberian Electricity Market is presented and results are discussed to show the effectiveness of the proposed approach.

Optimal Wind Bidding Strategies in Day-Ahead Markets

This paper presents a computer application for wind energy bidding in a day-ahead electricity market to better accommodate the variability of the energy source. The computer application is based in a stochastic linear mathematical programming problem. The goal is to obtain the optimal bidding strategy in order to maximize the revenue. Electricity prices and financial penalties for shortfall or surplus energy deliver are modeled. Finally, conclusions are drawn from an illustrative case study, using data from the day-ahead electricity market of the Iberian Peninsula.

Impactes do Preço da Água na Agricultura no Perímetro Irrigado do Vale de Caxito

O aumento da pressão sobre os recursos hídricos tem levado muitos países a reconsiderarem os mecanismos utilizados na indução do uso eficiente da água, especialmente na agricultura irrigada. Estabelecer o preço correto da água é um dos mecanismos de tornar mais eficiente a alocação da água. O presente trabalho tem como objetivo a análise dos impactes económicos, sociais e ambientais de políticas de preço da água. A metodologia utilizada foi a Programação Linear, aplicada ao Perímetro Irrigado do Vale de Caxito, Província do Bengo, a 45 km de Luanda, que tem como fonte o rio Dande. Foram testados três cenários relativos a políticas de tarifação de água: tarifa volumétrica simples, tarifa volumétrica variável, e tarifa fixa por superfície. As principais conclusões mostram que, do ponto de vista do uso eficiente da água na agricultura, os melhores resultados obtêm-se com a tarifa volumétrica variável; do ponto de vista social, a tarifação volumétrica simples apresenta os melhores resultados; o método de tarifa volumétrica variável foi o mais penalizador, reduzindo rapidamente a área das culturas mais consumidoras de água, sendo o melhor do ponto de vista ambiental. Qualquer um dos métodos traz aspetos negativos relativamente à redução da margem bruta total. Palavras-chaves: Recursos hídricos; Preço da água; Programação linear. Abstract: Increased pressure on water resources has led many countries to reconsider the mechanisms used in the induction of efficient water use, especially for irrigated agriculture, a major consumer of water. Establishing the correct price of water is one of the mechanisms for more efficient allocation of water. This paper aims to analyze the economic, social and essenenvironmental impacts of water price policies. The methodology used is the linear programming, applied to the Irrigated Valley Caxito, in Bengo Province, 45 kilometers from Luanda, which has the river Dande as its source. Three scenarios concerning water price policies were tested: simple volumetric rate, variable volumetric rate and flat rate per surface. The main findings show that from the point of view of the efficient use of water in agriculture, the best results are obtained with variable volumetric rate; from the social point of view, the simple volumetric rate has the best results; the volume variable rate method proved to be the most penalizing, quickly reducing the area of most water consuming cultures, being the method in which the environmental objectives would be more readily achieved. Either methods bring negative aspects in relation to the reduction of total gross margin. Key-words: Water resources; Water price; Linear programming.

Modeling and optimization techniques for advanced vehicular networking

This thesis deals with optimization techniques and modeling of vehicular networks. Thanks to the models realized with the integer linear programming (ILP) and the heuristic ones, it was possible to study the performances in 5G networks for the vehicular. Thanks to Software-defined networking (SDN) and Network functions virtualization (NFV) paradigms it was possible to study the performances of different classes of service, such as the Ultra Reliable Low Latency Communications (URLLC) class and enhanced Mobile BroadBand (eMBB) class, and how the functional split can have positive effects on network resource management. Two different protection techniques have been studied: Shared Path Protection (SPP) and Dedicated Path Protection (DPP). Thanks to these different protections, it is possible to achieve different network reliability requirements, according to the needs of the end user. Finally, thanks to a simulator developed in Python, it was possible to study the dynamic allocation of resources in a 5G metro network. Through different provisioning algorithms and different dynamic resource management techniques, useful results have been obtained for understanding the needs in the vehicular networks that will exploit 5G. Finally, two models are shown for reconfiguring backup resources when using shared resource protection.

Exact Combinatorial Optimization with Graph Convolutional Neural Networks

Combinatorial optimization problems are typically tackled by the branch-and-bound paradigm. We propose to learn a variable selection policy for branch-and-bound in mixed-integer linear programming, by imitation learning on a diversified variant of the strong branching expert rule. We encode states as bipartite graphs and parameterize the policy as a graph convolutional neural network. Experiments on a series of synthetic problems demonstrate that our approach produces policies that can improve upon expert-designed branching rules on large problems, and generalize to instances significantly larger than seen during training.