2024
Authors
Dias, LR; Cardoso, F; Jimenez, CM; Marques, GO; Barioni, G; Barbosa, F; Mariano, P; Cunha, P; Bonomi, A;
Publication
Computer Aided Chemical Engineering
Abstract
The expansion of ethanol production in Brazil sparks several sustainability concerns, including debates on “food versus fuel”, the environmental impacts of monocultures, and indirect land-use change. Since livestock farming occupies a significantly greater area than sugarcane for ethanol production in Brazil and has a large yield gap, sugarcane-livestock integration can be a promising alternative. This integrated system considers crop production systems, biorefinery processing and meat production in both intensive and extensive livestock farming. Optimizing this system for both economic and environmental aspects can be challenging to implement and computationally expensive as this system's complexity arises from nonlinear subsystems and their intertwining input-output flows. For these reasons, this paper develops metamodels from detailed models to: (i) Optimize the extensive livestock farming, (ii) Optimize the confined animal feeding, and (iii) Optimize the integrated system. The main objective is to maximize the Net Present Value relative to investment. This study contributes to the literature by developing innovative models for ethanol-beef integrated production systems and methods for optimizing such systems to avoid negative externalities on food security and environmental impacts. © 2024 Elsevier B.V.
2024
Authors
Casalta, M; Barbosa, F; Yamada, L; Ramos, LB;
Publication
UTILITIES POLICY
Abstract
The efficient management of assets delivers value and is essential for achieving service objectives, managing risks, and reducing costs. This paper proposes decision-support methods to help capital-intensive industries manage their assets and optimise their life cycle. Optimisation approaches were developed to support longterm investment planning by maximising the value created and minimising the budget used. Also, the trade-off for both objectives was analysed. Using the proposed models will lead to efficient management of available capital and excellent service delivery. Thus, water companies will fulfil the regulator's requirements and present well-founded decision-making. This study was applied to a Portuguese water utility.
2024
Authors
May, A; Fries, CE; Vilarinho, H; Camanho, AS;
Publication
ANNALS OF OPERATIONS RESEARCH
Abstract
The water supply and sewage sector (WSS) is essential for promoting health and providing the population with drinking water and the adequate disposal of effluents. Assessing the evolution of performance in WSS allows for highlighting the best and worst results achieved, identifying benchmarks, and pinpointing sources of improvement for water services. Brazil has a large population and immense freshwater reserves that are unevenly distributed throughout the territory. This situation emanates a challenge that requires the efficient management of water resources. This study develops a composite indicator framework based on the robust Benefit-of-the-Doubt (BoD) approach to estimate the performance of municipalities of the Brazilian State of Santa Catarina from 2009 to 2021, considering financial, operational, and quality dimensions associated with the provision of WSS services. Subsequently, the Global Malmquist Index (GMI) is applied to assess the performance evolution of the municipalities over time. The BoD results enable the quantification of the relative contribution of each sub-indicator to the performance score, allowing the assessment of the strengths and weaknesses of each municipality. The GMI results show an average performance loss of 3.3% in Santa Catarina state and considerable variability among municipalities, with scores ranging from losses of 54.2% to gains of 109.3% in the period analysed.
2024
Authors
Soares, Â; Ferreira, AR; Lopes, MP;
Publication
Lecture Notes in Mechanical Engineering
Abstract
This paper studies a real world dedicated parallel machine scheduling problem with sequence dependent setups, different machine release dates and additional resources (PMSR). To solve this problem, two previously proposed models have been adapted and a novel objective function, the minimisation of the sum of the machine completion times, is proposed to reflect the real conditions of the manufacturing environment that motivates this work. One model follows the strip-packing approach and the other is time-indexed. The solutions obtained show that the new objective function provides a compact production schedule that allows the simultaneous minimisation of machine idle times and setup times. In conclusion, this study provides valuable insights into the effectiveness of different models for solving PMSR problems in real-world contexts and gives directions for future research in this area using complementary approaches such as matheuristics. © 2024, The Author(s), under exclusive license to Springer Nature Switzerland AG.
2023
Authors
Cherri, AC; Cherri, LH; Oliveira, BB; Oliveira, JF; Carravilla, MA;
Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
In cutting processes, one of the strategies to reduce raw material waste is to generate leftovers that are large enough to return to stock for future use. The length of these leftovers is important since waste is expected to be minimal when cutting these objects in the future. However, in several situations, future demand is unknown and evaluating the best length for the leftovers is challenging. Furthermore, it may not be economically feasible to manage a stock of leftovers with multiple lengths that may not result in minimal waste when cut. In this paper, we approached the cutting stock problem with the possibility of generating leftovers as a two-stage stochastic program with recourse. We approximated the demand levels for the different items by employing a finite set of scenarios. Also, we modeled different decisions made before and after uncertainties were revealed. We proposed a mathematical model to represent this problem and developed a column generation approach to solve it. We ran computational experi-ments with randomly generated instances, considering a representative set of scenarios with a varying probability distribution. The results validated the efficiency of the proposed approach and allowed us to derive insights on the value of modeling and tackling uncertainty in this problem. Overall, the results showed that the cutting stock problem with usable leftovers benefits from a modeling approach based on sequential decision-making points and from explicitly considering uncertainty in the model and the solution method. (c) 2022 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY-NC-ND license ( http://creativecommons.org/licenses/by-nc-nd/4.0/ )
2023
Authors
Salem, KH; Silva, E; Oliveira, JF; Carravilla, MA;
Publication
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
In this paper, we consider the two-dimensional Variable-Sized Cutting Stock Problem (2D-VSCSP) with guillotine constraint, applied to the home textile industry. This is a challenging class of real-world prob-lems where, given a set of predefined widths of fabric rolls and a set of piece types, the goal is to de-cide the widths and lengths of the fabric rolls to be produced, and to generate the cutting patterns to cut all demanded pieces. Each piece type considered has a rectangular shape with a specific width and length and a fixed demand to be respected. The main objective function is to minimize the total amount of the textile materials produced/cut to satisfy the demand. According to Wascher, Hau ss ner, & Schu-mann (2007), the addressed problem is a Cutting Stock Problem (CSP), as the demand for each item is greater than one. However, in the real-world application at stake, the demand for each item type is not very high (below ten for all item types). Therefore, addressing the problem as a Bin-Packing Problem (BPP), in which all items are considered to be different and have a unitary demand, was a possibility. For this reason, two approaches to solve the problems were devised, implemented, and tested: (1) a CSP model, based on the well-known Lodi and Monaci (2003) model (3 variants), and (2) an original BPP-based model. Our research shows that, for this level of demand, the new BPP model is more competitive than CSP models. We analyzed these different models and described their characteristics, namely the size and the quality of the linear programming relaxation bound for solving the basic mono-objective variant of the problem. We also propose an epsilon-constraint approach to deal with a bi-objective extension of the problem, in which the number of cutting patterns used must also be minimized. The quality of the models was evaluated through computational experiments on randomly generated instances, yielding promising results.(c) 2022 Published by Elsevier B.V.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.