12 results on '"Alessandro Maddaloni"'
Search Results
2. Machine Learning-Based Models for Supporting Optimal Exploitation of Process Off-Gases in Integrated Steelworks
- Author
-
Marco Vannocci, Alessandro Maddaloni, Andreas Wolff, Claudio Mocci, Stefano Dettori, Ruben Matino, Ismael Matino, Valentina Colla, and Angelo Castellano
- Subjects
Decision support system ,Model predictive control ,Computer science ,Process (engineering) ,business.industry ,Control (management) ,Production (economics) ,Reuse ,Energy source ,Process engineering ,business ,Term (time) - Abstract
Within integrated steelworks, several sub-processes produce off-gases, which are suitable for reuse as energy sources for other internal processes as well as for the production of energy. An adequate and optimal distribution of these gases among their users allows valorizing at best their energy content by minimizing the need to both burn them through torches due to storage issues and to acquire natural gas to satisfy the internal energetic demand. To this purpose, the volume and energetic value of produced gases as well as the demands from internal users must be known in advance, in order to implement model-predictive control strategies aimed at satisfying the demands on the short-medium term based on the production scheduling. Such forecasting knowledge also enhances the capability to react to the variability of the process scheduling as well as to other unforeseen events.
- Published
- 2021
- Full Text
- View/download PDF
3. On the Performance of the ORTHOMADS Algorithm on Continuous and Mixed-Integer Optimization Problems
- Author
-
Marie-Ange Dahito, Laurent Genest, Alessandro Maddaloni, and José Neto
- Published
- 2021
- Full Text
- View/download PDF
4. Pre-Processing for Neural Model Design in A Real Industrial Problem
- Author
-
Silvia Cateni, Antonella Vignali, Valentina Colla, and Alessandro Maddaloni
- Subjects
Modeling and Simulation ,Software - Published
- 2019
- Full Text
- View/download PDF
5. Disjoint Paths in Decomposable Digraphs
- Author
-
Jørgen Bang-Jensen, Tilde My Christiansen, and Alessandro Maddaloni
- Subjects
010201 computation theory & mathematics ,010102 general mathematics ,Discrete Mathematics and Combinatorics ,0102 computer and information sciences ,Geometry and Topology ,0101 mathematics ,01 natural sciences - Published
- 2016
- Full Text
- View/download PDF
6. Intelligent control station for improved quality management in flat steel production**The research leading to these results has received funding from the European Community’s Research Fund for Coal and Steel (RFCS) under Grant Agreement No. RFS-CT-2012-00037
- Author
-
Valentina Colla, N. Holzknecht, Alessandro Maddaloni, Gianluca Nastasi, T. Heckenthaler, and G. Hartmann
- Subjects
Engineering ,Decision support system ,Quality management ,business.industry ,020209 energy ,media_common.quotation_subject ,02 engineering and technology ,Manufacturing engineering ,Product (business) ,Control and Systems Engineering ,0202 electrical engineering, electronic engineering, information engineering ,Added value ,Production (economics) ,Use case ,Quality (business) ,business ,Intelligent control ,media_common - Abstract
Reaching the maximum yield of produced stainless flat products is an important aim to be successful in the competitive market. This paper describes a solution to optimise the allocation of orders to coils taking into account the actual product quality as well as the quality expected by the customer. In opposite to already available solutions also the appearance of over-quality products is taken into account. Especially for high quality stainless flat products the re-allocation of over-quality products to orders with higher demands can increase the added value distinctly. Another topic is the processing of Manufacturing Specifications (MS). A concept for the digitization of usually freely formulated MS is presented as well as a systematic monitoring, if the MS are really considered by the plant operators. The shown use cases were implemented at the German sites of Outokumpu Oyj, the Finnish producer of stainless flat products sited in Espoo.
- Published
- 2016
- Full Text
- View/download PDF
7. Arc-Disjoint Directed and Undirected Cycles in Digraphs
- Author
-
Sven Simonsen, Alessandro Maddaloni, Matthias Kriesell, and Jørgen Bang-Jensen
- Subjects
Discrete mathematics ,Dicycle ,020206 networking & telecommunications ,Digraph ,0102 computer and information sciences ,02 engineering and technology ,Disjoint sets ,01 natural sciences ,Arc (geometry) ,Combinatorics ,Set (abstract data type) ,010201 computation theory & mathematics ,Transversal (combinatorics) ,Bounded function ,0202 electrical engineering, electronic engineering, information engineering ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Undirected graph ,Mathematics - Abstract
The dicycle transversal number of a digraph D is the minimum size of a dicycle transversal of D, that is a set of vertices of D, whose removal from D makes it acyclic. An arc a of a digraph D with at least one cycle is a transversal arc if a is in every directed cycle of D (making acyclic). In [3] and [4], we completely characterized the complexity of following problem: Given a digraph D, decide if there is a dicycle B in D and a cycle C in its underlying undirected graph such that . It turns out that the problem is polynomially solvable for digraphs with a constantly bounded number of transversal vertices (including cases where ). In the remaining case (allowing arbitrarily many transversal vertices) the problem is NP-complete. In this article, we classify the complexity of the arc-analog of this problem, where we ask for a dicycle B and a cycle C that are arc-disjoint, but not necessarily vertex-disjoint. We prove that the problem is polynomially solvable for strong digraphs and for digraphs with a constantly bounded number of transversal arcs (but possibly an unbounded number of transversal vertices). In the remaining case (allowing arbitrarily many transversal arcs) the problem is NP-complete.
- Published
- 2015
- Full Text
- View/download PDF
8. Sufficient Conditions for a Digraph to be Supereulerian
- Author
-
Alessandro Maddaloni and Jørgen Bang-Jensen
- Subjects
Discrete mathematics ,Mathematics::Combinatorics ,Conjecture ,Graph theory ,Eulerian path ,Digraph ,Combinatorics ,Multipartite ,symbols.namesake ,Computer Science::Discrete Mathematics ,symbols ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Computer Science::Data Structures and Algorithms ,Undirected graph ,Hamiltonian (quantum mechanics) ,Mathematics ,Independence number - Abstract
A digraph is supereulerian if it contains a spanning eulerian subdigraph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomasse and the first author: if the arc-connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.
- Published
- 2014
- Full Text
- View/download PDF
9. Exploitation of Multi-objective Optimization in Retrofit Analysis: A Case Study for the Iron and Steel Production
- Author
-
G. F. Porzio, Teresa Annunziata Branca, Gianluca Nastasi, Valentina Colla, and Alessandro Maddaloni
- Subjects
Engineering ,Waste management ,business.industry ,Process (engineering) ,Energy consumption ,Multi-objective optimization ,Manufacturing engineering ,industrial energy system ,Energy(all) ,multi-objective optimization ,CO2 emissions reduction ,Steel industry ,Process integration ,Sustainability ,process simulation and optimization ,cost savings ,Production (economics) ,Process optimization ,business ,Efficient energy use - Abstract
Over the past few decades the issues related to the energy consumption and the climate change have been increased and they have achieved a significant position on the sustainability agenda of the steel industry. Steel production is among the largest energy-intensive industrial processes in the world, as well as one of the most important CO2 emission sources. However, the major role of steel utilisation in the modern society is undeniable. The challenges of industrial energy systems aim at achieving CO2 minimization, without neglecting energy efficiency as well as the development of effective models and strategies for process optimization. The application of Process Integration (PI) methods to the integrated steelmaking route, aims at achieving a reduction in the CO2 emission by optimizing material and energy systems. The work presented in this paper is devoted to the development of a model for optimal exploitation of energy resources and by-products in integrated steelworks through application of multi-objective optimisation techniques. Cases of exploitation of the system within the management of the process gases are presented in a retrofit scenario and compared to the case of nominal operation.
- Published
- 2014
- Full Text
- View/download PDF
10. Arc-Disjoint Paths in Decomposable Digraphs
- Author
-
Jørgen Bang-Jensen and Alessandro Maddaloni
- Subjects
Discrete mathematics ,Class (set theory) ,Polynomial ,Mathematics::Combinatorics ,Disjoint sets ,Polynomial algorithm ,Combinatorics ,Arc (geometry) ,Computer Science::Discrete Mathematics ,Bounded function ,Discrete Mathematics and Combinatorics ,Geometry and Topology ,Computer Science::Data Structures and Algorithms ,Mathematics ,Independence number - Abstract
We prove that the weak k-linkage problem is polynomial for every fixed k for totally i¾?-decomposable digraphs, under appropriate hypothesis on i¾?. We then apply this and recent results by Fradkin and Seymour on the weak k-linkage problem for digraphs of bounded independence number or bounded cut-width to get polynomial algorithms for some classes of digraphs like quasi-transitive digraphs, extended semicomplete digraphs, locally semicomplete digraphs all of which contain the class of semicomplete digraphs as a subclass and directed cographs.
- Published
- 2013
- Full Text
- View/download PDF
11. A Bin Packing Algorithm for Steel Production
- Author
-
Marco Del Seppia, Alessandro Maddaloni, Vincenzo Iannino, Valentina Colla, and Gianluca Nastasi
- Subjects
0209 industrial biotechnology ,Engineering ,Mathematical optimization ,021103 operations research ,Product design ,Bin packing problem ,business.industry ,media_common.quotation_subject ,0211 other engineering and technologies ,ComputerApplications_COMPUTERSINOTHERSYSTEMS ,02 engineering and technology ,Nonlinear system ,020901 industrial engineering & automation ,Product (mathematics) ,Steel mill ,Production (economics) ,Quality (business) ,business ,Integer (computer science) ,media_common - Abstract
The paper presents a novel method for steel cutting optimization, which is performed by means of a two dimensional bin packing algorithm, with bins of different sizes. Our model extends previous mixed integer programs for bin packing, accounting for many of the issues arising in the steel manufacturing industry. In particular the proposed method can satisfy customer requirements on product quality. The developed algorithm can also deal with parameters variability occurring after the rolling processes. The final problem is formulated as a mixed integer non linear program (MINLP). This model directly applies to steel cutting, but it can be easily adapted in all of its parts, or just some of them, to other (industrial) rectangular cutting problems on different surfaces.
- Published
- 2016
- Full Text
- View/download PDF
12. A quadratic programming model for the optimization of off-gas networks in integrated steelworks
- Author
-
Ismael Matino, Ruben Matino, Stefano Dettori, Antonella Zaccara, Valentina Colla, and Alessandro Maddaloni
- Subjects
Quadratically constrained quadratic program ,Decision support system ,Mathematical optimization ,Optimization problem ,Linear programming ,Computer science ,020209 energy ,02 engineering and technology ,Energy consumption ,021001 nanoscience & nanotechnology ,0202 electrical engineering, electronic engineering, information engineering ,General Materials Science ,Minification ,Quadratic programming ,Minimum-cost flow problem ,0210 nano-technology - Abstract
The European steel industry is constantly promoting developments, which can increase efficiency and lower the environmental impact of the steel production processes. In particular, a strong focus refers to the minimization of the energy consumption. This paper presents part of the work of the research project entitled “Optimization of the management of the process gas network within the integrated steelworks” (GASNET), which aims at developing a decision support system supporting energy managers and other concerned technical personnel in the implementation of an optimized off-gases management and exploitation considering environmental and economic objectives. A mathematical model of the network as a capacitated digraph with costs on arcs is proposed and an optimization problem is formulated. The objective of the optimization consists in minimizing the wastes of process gases and maximizing the incomes. Several production constraints need to be accounted. In particular, different types of gases are mixing in the same network. The constraints that model the mixing make the problem computationally difficult: it is a non-convex quadratically constrained quadratic program (QCQP). Two formulations of the problem are presented: the first one is a minimum cost flow problem, which is a linear program and is thus computationally fast to solve, but suitable only for a single gas network. The second formulation is a quadratically constrained quadratic program, which is slower, but covers more general cases, such as the ones, which are characterized by the interaction among multiple gas networks. A user-friendly graphical interface has been developed and tests over existing plant networks are performed and analyzed.
- Published
- 2019
- Full Text
- View/download PDF
Catalog
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.