Mixed-Integer Linear Programming Approach for Life-Cycle Carpet Profit

This paper proposes an mixed-integer linear programming (MILP) model to accurately represent a product life-cycle design considering profit maximization. The model that takes into account the effects on the demand lev-el and a measure of the customer utility considering recycled raw materials and prices of the traditional and modular products. Demand functions for traditional and modular products are considered. Given the presence of bilinear terms in the formulation (for example due to the multiplication of product price for the demand), the multi-parametric disaggregation technique is used to obtain a line-ar model. The developed model is applied to a company that produces tradition-al carpets and it wants to manufacture carpets based on a new modular design where recycled materials must be incorporated. The objective of the company is to maximize the total profit taking into account the design specifications and the selling prices for traditional and modular carpets. In addition, the amount of square meters of traditional carpets must be determined and the take-back rate must be considered. The practical behavior of the formulation is analyzed through computational experiments exploring the analyzed case-study.Sociedad Argentina de Informática e Investigación Operativ

Mixed-Integer Linear Programming Approach for Life-Cycle Carpet Profit

This paper proposes an mixed-integer linear programming (MILP) model to accurately represent a product life-cycle design considering profit maximization. The model that takes into account the effects on the demand lev-el and a measure of the customer utility considering recycled raw materials and prices of the traditional and modular products. Demand functions for traditional and modular products are considered. Given the presence of bilinear terms in the formulation (for example due to the multiplication of product price for the demand), the multi-parametric disaggregation technique is used to obtain a line-ar model. The developed model is applied to a company that produces tradition-al carpets and it wants to manufacture carpets based on a new modular design where recycled materials must be incorporated. The objective of the company is to maximize the total profit taking into account the design specifications and the selling prices for traditional and modular carpets. In addition, the amount of square meters of traditional carpets must be determined and the take-back rate must be considered. The practical behavior of the formulation is analyzed through computational experiments exploring the analyzed case-study.Sociedad Argentina de Informática e Investigación Operativ

Mixed-Integer Linear Programming Approach for Life-Cycle Carpet Profit

This paper proposes an mixed-integer linear programming (MILP) model to accurately represent a product life-cycle design considering profit maximization. The model that takes into account the effects on the demand lev-el and a measure of the customer utility considering recycled raw materials and prices of the traditional and modular products. Demand functions for traditional and modular products are considered. Given the presence of bilinear terms in the formulation (for example due to the multiplication of product price for the demand), the multi-parametric disaggregation technique is used to obtain a line-ar model. The developed model is applied to a company that produces tradition-al carpets and it wants to manufacture carpets based on a new modular design where recycled materials must be incorporated. The objective of the company is to maximize the total profit taking into account the design specifications and the selling prices for traditional and modular carpets. In addition, the amount of square meters of traditional carpets must be determined and the take-back rate must be considered. The practical behavior of the formulation is analyzed through computational experiments exploring the analyzed case-study.Sociedad Argentina de Informática e Investigación Operativ

Non-parametric modeling in non-intrusive load monitoring

Non-intrusive Load Monitoring (NILM) is an approach to the increasingly important task of residential energy analytics. Transparency of energy resources and consumption habits presents opportunities and benefits at all ends of the energy supply-chain, including the end-user. At present, there is no feasible infrastructure available to monitor individual appliances at a large scale. The goal of NILM is to provide appliance monitoring using only the available aggregate data, side-stepping the need for expensive and intrusive monitoring equipment. The present work showcases two self-contained, fully unsupervised NILM solutions: the first featuring non-parametric mixture models, and the second featuring non-parametric factorial Hidden Markov Models with explicit duration distributions. The present implementation makes use of traditional and novel constraints during inference, showing marked improvement in disaggregation accuracy with very little effect on computational cost, relative to the motivating work. To constitute a complete unsupervised solution, labels are applied to the inferred components using a Res-Net-based deep learning architecture. Although this preliminary approach to labelling proves less than satisfactory, it is well-founded and several opportunities for improvement are discussed. Both methods, along with the labelling network, make use of block-filtered data: a steady-state representation that removes transient behaviour and signal noise. A novel filter to achieve this steady-state representation that is both fast and reliable is developed and discussed at length. Finally, an approach to monitor the aggregate for novel events during deployment is developed under the framework of Bayesian surprise. The same non-parametric modelling can be leveraged to examine how the predictive and transitional distributions change given new windows of observations. This framework is also shown to have potential elsewhere, such as in regularizing models against over-fitting, which is an important problem in existing supervised NILM

Hierarchical feature extraction from spatiotemporal data for cyber-physical system analytics

With the advent of ubiquitous sensing, robust communication and advanced computation, data-driven modeling is increasingly becoming popular for many engineering problems. Eliminating difficulties of physics-based modeling, avoiding simplifying assumptions and ad hoc empirical models are significant among many advantages of data-driven approaches, especially for large-scale complex systems. While classical statistics and signal processing algorithms have been widely used by the engineering community, advanced machine learning techniques have not been sufficiently explored in this regard. This study summarizes various categories of machine learning tools that have been applied or may be a candidate for addressing engineering problems. While there are increasing number of machine learning algorithms, the main steps involved in applying such techniques to the problems consist in: data collection and pre-processing, feature extraction, model training and inference for decision-making. To support decision-making processes in many applications, hierarchical feature extraction is key. Among various feature extraction principles, recent studies emphasize hierarchical approaches of extracting salient features that is carried out at multiple abstraction levels from data. In this context, the focus of the dissertation is towards developing hierarchical feature extraction algorithms within the framework of machine learning in order to solve challenging cyber-physical problems in various domains such as electromechanical systems and agricultural systems. Furthermore, the feature extraction techniques are described using the spatial, temporal and spatiotemporal data types collected from the systems. The wide applicability of such features in solving some selected real-life domain problems are demonstrated throughout this study

Assessment of Lagrangean decomposition for short-term planning of integrated refinery-petrochemical operations

We present an integrated methodology for optimal short-term planning of integrated refinery-petrochemical complexes (IRPCs) and demonstrate it on a full-scale industrial case study under four realistic planning scenarios. The large-scale mixed-integer quadratically constrained optimization models are amenable to a spatial Lagrangean decomposition through dividing the IRPC into multiple subsections, which comprise crude management, refinery, fuel blending, and petrochemical production. The decomposition algorithm creates virtual markets for trading crude blends and intermediate petrochemical streams within the IRPC and seeks an optimal tradeoff in such markets, with the Lagrange multipliers acting as transfer prices. The best results are obtained for decompositions with two or three subsections, achieving optimality gaps below 4% in all four planning scenarios. The Lagrangean decomposition provides tighter primal and dual bounds than the global solvers BARON and ANTIGONE, and it also improves the dual bounds computed using piecewise linear relaxation strategies

Parallel software tool for decomposing and meshing of 3d structures

An algorithm for automatic parallel generation of three-dimensional unstructured computational meshes based on geometrical domain decomposition is proposed in this paper. Software package build upon proposed algorithm is described. Several practical examples of mesh generation on multiprocessor computational systems are given. It is shown that developed parallel algorithm enables us to reduce mesh generation time significantly (dozens of times). Moreover, it easily produces meshes with number of elements of order 5 · 107, construction of those on a single CPU is problematic. Questions of time consumption, efficiency of computations and quality of generated meshes are also considered

Global optimisation of large-scale quadratic programs: application to short-term planning of industrial refinery-petrochemical complexes

This thesis is driven by an industrial problem arising in the short-term planning of an integrated refinery-petrochemical complex (IRPC) in Colombia. The IRPC of interest is composed of 60 industrial plants and a tank farm for crude mixing and fuel blending consisting of 30 additional units. It considers both domestic and imported crude oil supply, as well as refined product imports such as low sulphur diesel and alkylate. This gives rise to a large-scale mixed-integer quadratically constrained quadratic program (MIQCQP) comprising about 7,000 equality constraints with over 35,000 bilinear terms and 280 binary variables describing operating modes for the process units. Four realistic planning scenarios are recreated to study the performance of the algorithms developed through the thesis and compare them to commercial solvers. Local solvers such as SBB and DICOPT cannot reliably solve such large-scale MIQCQPs. Usually, it is challenging to even reach a feasible solution with these solvers, and a heuristic procedure is required to initialize the search. On the other hand, global solvers such as ANTIGONE and BARON determine a feasible solution for all the scenarios analysed, but they are unable to close the relaxation gap to less than 40% on average after 10h of CPU runtime. Overall, this industrial-size problem is thus intractable to global optimality in a monolithic way. The first main contribution of the thesis is a deterministic global optimisation algorithm based on cluster decomposition (CL) that divides the network into groups of process units according to their functionality. The algorithm runs through the sequences of clusters and proceeds by alternating between: (i) the (global) solution of a mixed-integer linear program (MILP), obtained by relaxing the bilinear terms based on their piecewise McCormick envelopes and a dynamic partition of their variable ranges, in order to determine an upper bound on the maximal profit; and (ii) the local solution of a quadratically-constrained quadratic program (QCQP), after fixing the binary variables and initializing the continuous variables to the relaxed MILP solution point, in order to determine a feasible solution (lower bound on the maximal profit). Applied to the base case scenario, the CL approach reaches a best solution of 2.964 MMUSD/day and a relaxation gap of 7.5%, a remarkable result for such challenging MIQCQP problem. The CL approach also vastly outperforms both ANTIGONE (2.634 MMUSD/day, 32% optimality gap) and BARON (2.687 MMUSD/day, 40% optimality gap). The second main contribution is a spatial Lagrangean decomposition, which entails decomposing the IRPC short-term planning problem into a collection of smaller subproblems that can be solved independently to determine an upper bound on the maximal profit. One advantage of this strategy is that each sub-problem can be solved to global optimality, potentially providing good initial points for the monolithic problem itself. It furthermore creates a virtual market for trading crude blends and intermediate refined–petrochemical streams and seeks an optimal trade-off in such a market, with the Lagrange multipliers acting as transfer prices. A decomposition over two to four is considered, which matches the crude management, refinery, petrochemical operations, and fuel blending sections of the IRPC. An optimality gap below 4% is achieved in all four scenarios considered, which is a significant improvement over the cluster decomposition algorithm.Open Acces