MPI parallel programming of mixed integer optimization problems using CPLEX with COIN-OR

The aim of this technical report is to present some detailed explanations in order to help to understand and use the Message Passing Interface (MPI) parallel programming for solving several mixed integer optimization problems. We have developed a C++ experimental code that uses the IBM ILOG CPLEX optimizer within the COmputational INfrastructure for Operations Research (COIN-OR) and MPI parallel computing for solving the optimization models under UNIX-like systems. The computational experience illustrates how can we solve 44 optimization problems which are asymmetric with respect to the number of integer and continuous variables and the number of constraints. We also report a comparative with the speedup and efficiency of several strategies implemented for some available number of threads.

How much efficiency gains and price reductions for an efficiency defense? 'Quanto Basta'

Potential efficiency gains due to a merger can be used by competition authorities to judge upon proposed mergers. In a world where agents’ efforts, observable or unobservable, affect the success of a production cost reducing project that may be conducted as a stand-alone firm or in a merger, we characterize the merger decision and the type of errors a competition authority may make when it relies on an efficiency defense. In addition, we show that the occurrence of either type of errors is always smaller under the unobservable efforts assumption, than under the observable efforts one.

Scenario Cluster Lagrangian Decomposition in two stage stochastic mixed 0-1 optimization

In this paper we introduce four scenario Cluster based Lagrangian Decomposition (CLD) procedures for obtaining strong lower bounds to the (optimal) solution value of two-stage stochastic mixed 0-1 problems. At each iteration of the Lagrangian based procedures, the traditional aim consists of obtaining the solution value of the corresponding Lagrangian dual via solving scenario submodels once the nonanticipativity constraints have been dualized. Instead of considering a splitting variable representation over the set of scenarios, we propose to decompose the model into a set of scenario clusters. We compare the computational performance of the four Lagrange multiplier updating procedures, namely the Subgradient Method, the Volume Algorithm, the Progressive Hedging Algorithm and the Dynamic Constrained Cutting Plane scheme for different numbers of scenario clusters and different dimensions of the original problem. Our computational experience shows that the CLD bound and its computational effort depend on the number of scenario clusters to consider. In any case, our results show that the CLD procedures outperform the traditional LD scheme for single scenarios both in the quality of the bounds and computational effort. All the procedures have been implemented in a C++ experimental code. A broad computational experience is reported on a test of randomly generated instances by using the MIP solvers COIN-OR and CPLEX for the auxiliary mixed 0-1 cluster submodels, this last solver within the open source engine COIN-OR. We also give computational evidence of the model tightening effect that the preprocessing techniques, cut generation and appending and parallel computing tools have in stochastic integer optimization. Finally, we have observed that the plain use of both solvers does not provide the optimal solution of the instances included in the testbed with which we have experimented but for two toy instances in affordable elapsed time. On the other hand the proposed procedures provide strong lower bounds (or the same solution value) in a considerably shorter elapsed time for the quasi-optimal solution obtained by other means for the original stochastic problem.

Dynamic optimization of track components to minimize rail corrugation

In this paper, the influence on corrugation of the most significant track parameters has been examined. After this parametric study, the optimization of the track parameters to minimize the undulatory wear growth has been achieved. Finally, the influence of the dispersion of the track and contact parameters on corrugation growth has been studied. A method has been developed to obtain an optimal solution of the track parameters which minimizes corrugation growth, thus ensuring that this solution remains optimum despite dispersion of track parameters and wheel-rail contact uncertainties. This work is based on the computer application RACING (RAil Corrugation INitiation and Growth) which has been developed by the authors to predict rail corrugation features.

Generating cluster submodels from a multistage stochastic mixed integer optimization model using break stage

We present a scheme to generate clusters submodels with stage ordering from a (symmetric or a nonsymmetric one) multistage stochastic mixed integer optimization model using break stage. We consider a stochastic model in compact representation and MPS format with a known scenario tree. The cluster submodels are built by storing first the 0-1 the variables, stage by stage, and then the continuous ones, also stage by stage. A C++ experimental code has been implemented for reordering the stochastic model as well as the cluster decomposition after the relaxation of the non-anticipativiy constraints until the so-called breakstage. The computational experience shows better performance of the stage ordering in terms of elapsed time in a randomly generated testbed of multistage stochastic mixed integer problems.

Design,optimization and in vivo evaluation of non-viral vectors for gene therapy. Applications in ocular disorders

227 págs.

Metabolic efficiency with fast spiking in the squid axon

Fundamentally, action potentials in the squid axon are consequence of the entrance of sodium ions during the depolarization of the rising phase of the spike mediated by the outflow of potassium ions during the hyperpolarization of the falling phase. Perfect metabolic efficiency with a minimum charge needed for the change in voltage during the action potential would confine sodium entry to the rising phase and potassium efflux to the falling phase. However, because sodium channels remain open to a significant extent during the falling phase, a certain overlap of inward and outward currents is observed. In this work we investigate the impact of ion overlap on the number of the adenosine triphosphate (ATP) molecules and energy cost required per action potential as a function of the temperature in a Hodgkin–Huxley model. Based on a recent approach to computing the energy cost of neuronal action potential generation not based on ion counting, we show that increased firing frequencies induced by higher temperatures imply more efficient use of sodium entry, and then a decrease in the metabolic energy cost required to restore the concentration gradients after an action potential. Also, we determine values of sodium conductance at which the hydrolysis efficiency presents a clear minimum.

Desarrollo de nanopartículas sólidas lipídicas como sistemas de administración de ADN para terapia génica

290 p. (Bibliogr. 257-290) Correo electrónico de la autora: ana.delpozo@ehu.es

Permutationally invariant state reconstruction

Feasible tomography schemes for large particle numbers must possess, besides an appropriate data acquisition protocol, an efficient way to reconstruct the density operator from the observed finite data set. Since state reconstruction typically requires the solution of a nonlinear large-scale optimization problem, this is a major challenge in the design of scalable tomography schemes. Here we present an efficient state reconstruction scheme for permutationally invariant quantum state tomography. It works for all common state-of-the-art reconstruction principles, including, in particular, maximum likelihood and least squares methods, which are the preferred choices in today's experiments. This high efficiency is achieved by greatly reducing the dimensionality of the problem employing a particular representation of permutationally invariant states known from spin coupling combined with convex optimization, which has clear advantages regarding speed, control and accuracy in comparison to commonly employed numerical routines. First prototype implementations easily allow reconstruction of a state of 20 qubits in a few minutes on a standard computer

Framework for the Shape Optimization of Aerodynamic Profiles Using Genetic Algorithms

This study developed a framework for the shape optimization of aerodynamics profiles using computational fluid dynamics (CFD) and genetic algorithms. Agenetic algorithm code and a commercial CFD code were integrated to develop a CFD shape optimization tool. The results obtained demonstrated the effectiveness of the developed tool. The shape optimization of airfoils was studied using different strategies to demonstrate the capacity of this tool with different GA parameter combinations.

Optimization of solution-processed oligothiophene:fullerene based organic solar cells by using solvent additives

The optimization of solution-processed organic bulk-heterojunction solar cells with the acceptor-substituted quinquethiophene DCV5T-Bu-4 as donor in conjunction with PC61BM as acceptor is described. Power conversion efficiencies up to 3.0% and external quantum efficiencies up to 40% were obtained through the use of 1-chloronaphthalene as solvent additive in the fabrication of the photovoltaic devices. Furthermore, atomic force microscopy investigations of the photoactive layer gave insight into the distribution of donor and acceptor within the blend. The unique combination of solubility and thermal stability of DCV5T-Bu-4 also allows for fabrication of organic solar cells by vacuum deposition. Thus, we were able to perform a rare comparison of the device characteristics of the solution-processed DCV5T-Bu-4:PC61BM solar cell with its vacuum-processed DCV5T-Bu-4:C-60 counterpart. Interestingly in this case, the efficiencies of the small-molecule organic solar cells prepared by using solution techniques are approaching those fabricated by using vacuum technology. This result is significant as vacuum-processed devices typically display much better performances in photovoltaic cells. Keywords

Analytical efficiency evaluation of a network mobility management protocol for Intelligent Transportation Systems

One of the major concerns in an Intelligent Transportation System (ITS) scenario, such as that which may be found on a long-distance train service, is the provision of efficient communication services, satisfying users' expectations, and fulfilling even highly demanding application requirements, such as safety-oriented services. In an ITS scenario, it is common to have a significant amount of onboard devices that comprise a cluster of nodes (a mobile network) that demand connectivity to the outside networks. This demand has to be satisfied without service disruption. Consequently, the mobility of the mobile network has to be managed. Due to the nature of mobile networks, efficient and lightweight protocols are desired in the ITS context to ensure adequate service performance. However, the security is also a key factor in this scenario. Since the management of the mobility is essential for providing communications, the protocol for managing this mobility has to be protected. Furthermore, there are safety-oriented services in this scenario, so user application data should also be protected. Nevertheless, providing security is expensive in terms of efficiency. Based on this considerations, we have developed a solution for managing the network mobility for ITS scenarios: the NeMHIP protocol. This approach provides a secure management of network mobility in an efficient manner. In this article, we present this protocol and the strategy developed to maintain its security and efficiency in satisfactory levels. We also present the developed analytical models to analyze quantitatively the efficiency of the protocol. More specifically, we have developed models for assessing it in terms of signaling cost, which demonstrates that NeMHIP generates up to 73.47% less signaling compared to other relevant approaches. Therefore, the results obtained demonstrate that NeMHIP is the most efficient and secure solution for providing communications in mobile network scenarios such as in an ITS context.

Robust speed control for a variable speed wind turbine

Modern wind turbines are designed in order to work in variable speed opera-tions. To perform this task, these turbines are provided with adjustable speed generators, like the double feed induction generator (DFIG). One of the main advantages of adjustable speed generators is improving the system efficiency compared with _xed speed generators, because turbine speed can be adjusted as a function of wind speed in order to maximize the output power. However, this system requires a suitable speed controller in order to track the optimal reference speed of the wind turbine. In this work, a sliding mode control for variable speed wind turbines is proposed. The proposed design also uses the vector oriented control theory in order to simplify the DFIG dynamical equations. The stability analysis of the proposed controller has been carried out under wind variations and pa-rameter uncertainties using the Lyapunov stability theory. Finally, the simulated results show on the one hand that the proposed controller provides a high-performance dynamic behavior, and on the other hand that this scheme is robust with respect to parameter uncertainties and wind speed variations, which usually appear in real systems.

Failure detectors and communication efficiency in the crash and general omisión failure models

122 p.

Optimization of Organic-Inorganic Inter-phase in Hybrid Systems Based on Waterborne Polyurethanes and Silica Nanostructures

215 p.