Accelerating benders decomposition with heuristicmaster problem solutions

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.

Development of plurimetallic electrocatalysts prepared by decomposition of polymeric precursors for EtOH/O2 fuel cell

This work aimed to develop plurimetallic electrocatalysts composed of Pt, Ru, Ni, and Sn supported on C by decomposition of polymeric precursors (DPP), at a constant metal:carbon ratio of 40:60 wt.%, for application in direct ethanol fuel cell (DEFC). The obtained nanoparticles were physico-chemically characterized by X-ray diffraction (XRD) and energy dispersive X-ray spectroscopy (EDX). XRD results revealed a face-centered cubic crystalline Pt with evidence that Ni, Ru, and Sn atoms were incorporated into the Pt structure. Electrochemical characterization of the nanoparticles was accomplished by cyclic voltammetry (CV) and chronoamperometry (CA) in slightly acidic medium (0.05 mol L-1 H2SO4), in the absence and presence of ethanol. Addition of Sn to PtRuNi/C catalysts significantly shifted the ethanol and CO onset potentials toward lower values, thus increasing the catalytic activity, especially for the quaternary composition Pt64Sn15Ru13Ni8/C. Electrolysis of ethanol solutions at 0.4 V vs. RHE allowed determination of acetaldehyde and acetic acid as the main reaction products. The presence of Ru in alloys promoted formation of acetic acid as the main product of ethanol oxidation. The Pt64Sn15Ru13Ni8/C catalyst displayed the best performance for DEFC.

The evolution of health status and chronic conditions in Catalonia, 1994-2006: the paradox of health revisited using the Blinder - Oaxaca decomposition

[EN] Background: The paradox of health refers to the improvement in objective measures of health and the increase in the reported prevalence of chronic conditions. The objective of this paper is to test the paradox of health in Catalonia from 1994 to 2006. Methods: Longitudinal cross-sectional study using the Catalonia Health Interview Survey of 1994 and 2006. The approach used was the three-fold Blinder - Oaxaca decomposition, separating the part of the differential in mean visual analogue scale value (VAS) due to group differences in the predictors (prevalence effect), due to differences in the coefficients (severity effect), and an interaction term. Variables included were the VAS value, education level, labour status, marital status, all common chronic conditions over the two cross-sections, and a variable for non-common chronic conditions and other conditions. Sample weights have been applied. Results: Results show that there is an increase in mean VAS for men aged 15-44, and a decrease in mean VAS for women aged 65-74 and 75 and more. The increase in mean VAS for men aged 15-44 could be explained by a decrease in the severity effect, which offsets the increase in the prevalence effect. The decrease in mean VAS for women aged 65-74 and 75 and more could be explained by an increase in the prevalence effect, which does not offset the decrease in the severity effect. Conclusions: The results of the present analysis corroborate the paradox of health hypothesis for the population of Catalonia, and highlight the need to be careful when measuring population health over time, as well as their usefulness to detect population's perceptions.

Calculation of the eigenfunctions of the two-group neutron diffusion equation and application to modal decomposition of BWR instabilities

In this thesis, numerical methods aiming at determining the eigenfunctions, their adjoint and the corresponding eigenvalues of the two-group neutron diffusion equations representing any heterogeneous system are investigated. First, the classical power iteration method is modified so that the calculation of modes higher than the fundamental mode is possible. Thereafter, the Explicitly-Restarted Arnoldi method, belonging to the class of Krylov subspace methods, is touched upon. Although the modified power iteration method is a computationally-expensive algorithm, its main advantage is its robustness, i.e. the method always converges to the desired eigenfunctions without any need from the user to set up any parameter in the algorithm. On the other hand, the Arnoldi method, which requires some parameters to be defined by the user, is a very efficient method for calculating eigenfunctions of large sparse system of equations with a minimum computational effort. These methods are thereafter used for off-line analysis of the stability of Boiling Water Reactors. Since several oscillation modes are usually excited (global and regional oscillations) when unstable conditions are encountered, the characterization of the stability of the reactor using for instance the Decay Ratio as a stability indicator might be difficult if the contribution from each of the modes are not separated from each other. Such a modal decomposition is applied to a stability test performed at the Swedish Ringhals-1 unit in September 2002, after the use of the Arnoldi method for pre-calculating the different eigenmodes of the neutron flux throughout the reactor. The modal decomposition clearly demonstrates the excitation of both the global and regional oscillations. Furthermore, such oscillations are found to be intermittent with a time-varying phase shift between the first and second azimuthal modes.

Decomposition and reformulation of integer linear programming problems

This thesis deals with an investigation of Decomposition and Reformulation to solve Integer Linear Programming Problems. This method is often a very successful approach computationally, producing high-quality solutions for well-structured combinatorial optimization problems like vehicle routing, cutting stock, p-median and generalized assignment . However, until now the method has always been tailored to the specific problem under investigation. The principal innovation of this thesis is to develop a new framework able to apply this concept to a generic MIP problem. The new approach is thus capable of auto-decomposition and autoreformulation of the input problem applicable as a resolving black box algorithm and works as a complement and alternative to the normal resolving techniques. The idea of Decomposing and Reformulating (usually called in literature Dantzig and Wolfe Decomposition DWD) is, given a MIP, to convexify one (or more) subset(s) of constraints (slaves) and working on the partially convexified polyhedron(s) obtained. For a given MIP several decompositions can be defined depending from what sets of constraints we want to convexify. In this thesis we mainly reformulate MIPs using two sets of variables: the original variables and the extended variables (representing the exponential extreme points). The master constraints consist of the original constraints not included in any slaves plus the convexity constraint(s) and the linking constraints(ensuring that each original variable can be viewed as linear combination of extreme points of the slaves). The solution procedure consists of iteratively solving the reformulated MIP (master) and checking (pricing) if a variable of reduced costs exists, and in which case adding it to the master and solving it again (columns generation), or otherwise stopping the procedure. The advantage of using DWD is that the reformulated relaxation gives bounds stronger than the original LP relaxation, in addition it can be incorporated in a Branch and bound scheme (Branch and Price) in order to solve the problem to optimality. If the computational time for the pricing problem is reasonable this leads in practice to a stronger speed up in the solution time, specially when the convex hull of the slaves is easy to compute, usually because of its special structure.

Multilevel Domain Decomposition Algorithms for Monolithic Fluid-Structure Interaction Problems with Application to Haemodynamics

Finite element techniques for solving the problem of fluid-structure interaction of an elastic solid material in a laminar incompressible viscous flow are described. The mathematical problem consists of the Navier-Stokes equations in the Arbitrary Lagrangian-Eulerian formulation coupled with a non-linear structure model, considering the problem as one continuum. The coupling between the structure and the fluid is enforced inside a monolithic framework which computes simultaneously for the fluid and the structure unknowns within a unique solver. We used the well-known Crouzeix-Raviart finite element pair for discretization in space and the method of lines for discretization in time. A stability result using the Backward-Euler time-stepping scheme for both fluid and solid part and the finite element method for the space discretization has been proved. The resulting linear system has been solved by multilevel domain decomposition techniques. Our strategy is to solve several local subproblems over subdomain patches using the Schur-complement or GMRES smoother within a multigrid iterative solver. For validation and evaluation of the accuracy of the proposed methodology, we present corresponding results for a set of two FSI benchmark configurations which describe the self-induced elastic deformation of a beam attached to a cylinder in a laminar channel flow, allowing stationary as well as periodically oscillating deformations, and for a benchmark proposed by COMSOL multiphysics where a narrow vertical structure attached to the bottom wall of a channel bends under the force due to both viscous drag and pressure. Then, as an example of fluid-structure interaction in biomedical problems, we considered the academic numerical test which consists in simulating the pressure wave propagation through a straight compliant vessel. All the tests show the applicability and the numerical efficiency of our approach to both two-dimensional and three-dimensional problems.

Decomposition Methods and Network Design Problems

Decomposition based approaches are recalled from primal and dual point of view. The possibility of building partially disaggregated reduced master problems is investigated. This extends the idea of aggregated-versus-disaggregated formulation to a gradual choice of alternative level of aggregation. Partial aggregation is applied to the linear multicommodity minimum cost flow problem. The possibility of having only partially aggregated bundles opens a wide range of alternatives with different trade-offs between the number of iterations and the required computation for solving it. This trade-off is explored for several sets of instances and the results are compared with the ones obtained by directly solving the natural node-arc formulation. An iterative solution process to the route assignment problem is proposed, based on the well-known Frank Wolfe algorithm. In order to provide a first feasible solution to the Frank Wolfe algorithm, a linear multicommodity min-cost flow problem is solved to optimality by using the decomposition techniques mentioned above. Solutions of this problem are useful for network orientation and design, especially in relation with public transportation systems as the Personal Rapid Transit. A single-commodity robust network design problem is addressed. In this, an undirected graph with edge costs is given together with a discrete set of balance matrices, representing different supply/demand scenarios. The goal is to determine the minimum cost installation of capacities on the edges such that the flow exchange is feasible for every scenario. A set of new instances that are computationally hard for the natural flow formulation are solved by means of a new heuristic algorithm. Finally, an efficient decomposition-based heuristic approach for a large scale stochastic unit commitment problem is presented. The addressed real-world stochastic problem employs at its core a deterministic unit commitment planning model developed by the California Independent System Operator (ISO).

Extracting evolutionary information from the spectral decomposition of early-type galaxies.

Holding the major share of stellar mass in galaxies and being also old and passively evolving, early-type galaxies (ETGs) are the primary probes in investigating these various evolution scenarios, as well as being useful means to provide insights on cosmological parameters. In this thesis work I focused specifically on ETGs and on their capability in constraining galaxy formation and evolution; in particular, the principal aims were to derive some of the ETGs evolutionary parameters, such as age, metallicity and star formation history (SFH) and to study their age-redshift and mass-age relations. In order to infer galaxy physical parameters, I used the public code STARLIGHT: this program provides a best fit to the observed spectrum from a combination of many theoretical models defined in user-made libraries. the comparison between the output and input light-weighted ages shows a good agreement starting from SNRs of ∼ 10, with a bias of ∼ 2.2% and a dispersion 3%. Furthermore, also metallicities and SFHs are well reproduced. In the second part of the thesis I performed an analysis on real data, starting from Sloan Digital Sky Survey (SDSS) spectra. I found that galaxies get older with cosmic time and with increasing mass (for a fixed redshift bin); absolute light-weighted ages, instead, result independent from the fitting parameters or the synthetic models used. Metallicities, instead, are very similar from each other and clearly consistent with the ones derived from the Lick indices. The predicted SFH indicates the presence of a double burst of star formation. Velocity dispersions and extinctiona are also well constrained, following the expected behaviours. As a further step, I also fitted single SDSS spectra (with SNR∼ 20), to verify that stacked spectra gave the same results without introducing any bias: this is an important check, if one wants to apply the method at higher z, where stacked spectra are necessary to increase the SNR. Our upcoming aim is to adopt this approach also on galaxy spectra obtained from higher redshift Surveys, such as BOSS (z ∼ 0.5), zCOSMOS (z 1), K20 (z ∼ 1), GMASS (z ∼ 1.5) and, eventually, Euclid (z 2). Indeed, I am currently carrying on a preliminary study to estabilish the applicability of the method to lower resolution, as well as higher redshift (z 2) spectra, just like the Euclid ones.

Curve Decomposition for Large Deflection Analysis of Fixed-Guided Beams With Application to Statically Balanced Compliant Mechanisms

Statically balanced compliant mechanisms require no holding force throughout their range of motion while maintaining the advantages of compliant mechanisms. In this paper, a postbuckled fixed-guided beam is proposed to provide the negative stiffness to balance the positive stiffness of a compliant mechanism. To that end, a curve decomposition modeling method is presented to simplify the large deflection analysis. The modeling method facilitates parametric design insight and elucidates key points on the force-deflection curve. Experimental results validate the analysis. Furthermore, static balancing with fixed-guided beams is demonstrated for a rectilinear proof-of-concept prototype.

No adverse effect of genetically modified antifungal wheat on decomposition dynamics and the soil fauna community - a field study

The cultivation of genetically modified (GM) plants has raised several environmental concerns. One of these concerns regards non-target soil fauna organisms, which play an important role in the decomposition of organic matter and hence are largely exposed to GM plant residues. Soil fauna may be directly affected by transgene products or indirectly by pleiotropic effects such as a modified plant metabolism. Thus, ecosystem services and functioning might be affected negatively. In a litterbag experiment in the field we analysed the decomposition process and the soil fauna community involved. Therefore, we used four experimental GM wheat varieties, two with a race-specific antifungal resistance against powdery mildew (Pm3b) and two with an unspecific antifungal resistance based on the expression of chitinase and glucanase. We compared them with two non-GM isolines and six conventional cereal varieties. To elucidate the mechanisms that cause differences in plant decomposition, structural plant components (i.e. C:N ratio, lignin, cellulose, hemicellulose) were examined and soil properties, temperature and precipitation were monitored. The most frequent taxa extracted from decaying plant material were mites (Cryptostigmata, Gamasina and Uropodina), springtails (Isotomidae), annelids (Enchytraeidae) and Diptera (Cecidomyiidae larvae). Despite a single significant transgenic/month interaction for Cecidomyiidae larvae, which is probably random, we detected no impact of the GM wheat on the soil fauna community. However, soil fauna differences among conventional cereal varieties were more pronounced than between GM and non-GM wheat. While leaf residue decomposition in GM and non-GM wheat was similar, differences among conventional cereals were evident. Furthermore, sampling date and location were found to greatly influence soil fauna community and decomposition processes. The results give no indication of ecologically relevant adverse effects of antifungal GM wheat on the composition and the activity of the soil fauna community.