3 resultados para dynamic programming decomposition
em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo
Resumo:
In this study, a dynamic programming approach to deal with the unconstrained two-dimensional non-guillotine cutting problem is presented. The method extends the recently introduced recursive partitioning approach for the manufacturer's pallet loading problem. The approach involves two phases and uses bounds based on unconstrained two-staged and non-staged guillotine cutting. The method is able to find the optimal cutting pattern of a large number of pro blem instances of moderate sizes known in the literature and a counterexample for which the approach fails to find known optimal solutions was not found. For the instances that the required computer runtime is excessive, the approach is combined with simple heuristics to reduce its running time. Detailed numerical experiments show the reliability of the method. Journal of the Operational Research Society (2012) 63, 183-200. doi: 10.1057/jors.2011.6 Published online 17 August 2011
Resumo:
The influence of the partial pressure of carbon dioxide (CO2) on the thermal decomposition process of a calcite (CI) and a dolomite (DP) is investigated in this paper using a thermogravimetric analyser. The tests were non-isothermal at five different heating rates in dynamic atmosphere of air with 0% and 15% carbon dioxide (CO2). In the atmosphere without CO2, the average activation energies (E-alpha) were 197.4 kJ mol(-1) and 188.1 kJ mol(-1) for CI and DP, respectively. For the DP with 15% CO2, two decomposition steps were observed, indicating a change of mechanism. The values of E-alpha for 15% CO2 were 378.7 kJ mol(-1) for the CI, and 299.8 kJ mol(-1) (first decomposition) and 453.4 kJ mol(-1) (second decomposition) for the DP, showing that the determination of E-alpha for DP should in this case be considered separately in those two distinct regions. The results obtained in this study are relevant to understanding the behaviour changes in the thermal decomposition of limestones with CO2 partial pressure when applied to technologies, such as carbon capture and storage (CCS), in which carbon dioxide is present in high concentrations.
Resumo:
In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.