An Analysis of black-box optimization problems in reinsurance: evolutionary-based approaches

Black-box optimization problems (BBOP) are de ned as those optimization problems in which the objective function does not have an algebraic expression, but it is the output of a system (usually a computer program). This paper is focussed on BBOPs that arise in the eld of insurance, and more speci cally in reinsurance problems. In this area, the complexity of the models and assumptions considered to de ne the reinsurance rules and conditions produces hard black-box optimization problems, that must be solved in order to obtain the optimal output of the reinsurance. The application of traditional optimization approaches is not possible in BBOP, so new computational paradigms must be applied to solve these problems. In this paper we show the performance of two evolutionary-based techniques (Evolutionary Programming and Particle Swarm Optimization). We provide an analysis in three BBOP in reinsurance, where the evolutionary-based approaches exhibit an excellent behaviour, nding the optimal solution within a fraction of the computational cost used by inspection or enumeration methods.

Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance

We address the problem of scheduling a multiclass $M/M/m$ queue with Bernoulli feedback on $m$ parallel servers to minimize time-average linear holding costs. We analyze the performance of a heuristic priority-index rule, which extends Klimov's optimal solution to the single-server case: servers select preemptively customers with larger Klimov indices. We present closed-form suboptimality bounds (approximate optimality) for Klimov's rule, which imply that its suboptimality gap is uniformly bounded above with respect to (i) external arrival rates, as long as they stay within system capacity;and (ii) the number of servers. It follows that its relativesuboptimality gap vanishes in a heavy-traffic limit, as external arrival rates approach system capacity (heavy-traffic optimality). We obtain simpler expressions for the special no-feedback case, where the heuristic reduces to the classical $c \mu$ rule. Our analysis is based on comparing the expected cost of Klimov's ruleto the value of a strong linear programming (LP) relaxation of the system's region of achievable performance of mean queue lengths. In order to obtain this relaxation, we derive and exploit a new set ofwork decomposition laws for the parallel-server system. We further report on the results of a computational study on the quality of the $c \mu$ rule for parallel scheduling.

Optimization of multiclass queueing networks with changeover times via the achievable region approach: Part I, the single-station case

We address the performance optimization problem in a single-stationmulticlass queueing network with changeover times by means of theachievable region approach. This approach seeks to obtainperformance bounds and scheduling policies from the solution of amathematical program over a relaxation of the system's performanceregion. Relaxed formulations (including linear, convex, nonconvexand positive semidefinite constraints) of this region are developedby formulating equilibrium relations satisfied by the system, withthe help of Palm calculus. Our contributions include: (1) newconstraints formulating equilibrium relations on server dynamics;(2) a flow conservation interpretation of the constraintspreviously derived by the potential function method; (3) newpositive semidefinite constraints; (4) new work decomposition lawsfor single-station multiclass queueing networks, which yield newconvex constraints; (5) a unified buffer occupancy method ofperformance analysis obtained from the constraints; (6) heuristicscheduling policies from the solution of the relaxations.

Optimization of multiclass queueing networks with changeover times via the achievable region method: Part II, the multi-station case

We address the problem of scheduling a multi-station multiclassqueueing network (MQNET) with server changeover times to minimizesteady-state mean job holding costs. We present new lower boundson the best achievable cost that emerge as the values ofmathematical programming problems (linear, semidefinite, andconvex) over relaxed formulations of the system's achievableperformance region. The constraints on achievable performancedefining these formulations are obtained by formulatingsystem's equilibrium relations. Our contributions include: (1) aflow conservation interpretation and closed formulae for theconstraints previously derived by the potential function method;(2) new work decomposition laws for MQNETs; (3) new constraints(linear, convex, and semidefinite) on the performance region offirst and second moments of queue lengths for MQNETs; (4) a fastbound for a MQNET with N customer classes computed in N steps; (5)two heuristic scheduling policies: a priority-index policy, anda policy extracted from the solution of a linear programmingrelaxation.

Micropatterning of single endothelial cell shape reveals a tight coupling between nuclear volume in G1 and proliferation

Shape-dependent local differentials in cell proliferation are considered to be a major driving mechanism of structuring processes in vivo, such as embryogenesis, wound healing, and angiogenesis. However, the specific biophysical signaling by which changes in cell shape contribute to cell cycle regulation remains poorly understood. Here, we describe our study of the roles of nuclear volume and cytoskeletal mechanics in mediating shape control of proliferation in single endothelial cells. Micropatterned adhesive islands were used to independently control cell spreading and elongation. We show that, irrespective of elongation, nuclear volume and apparent chromatin decondensation of cells in G1 systematically increased with cell spreading and highly correlated with DNA synthesis (percent of cells in the S phase). In contrast, cell elongation dramatically affected the organization of the actin cytoskeleton, markedly reduced both cytoskeletal stiffness (measured dorsally with atomic force microscopy) and contractility (measured ventrally with traction microscopy), and increased mechanical anisotropy, without affecting either DNA synthesis or nuclear volume. Our results reveal that the nuclear volume in G1 is predictive of the proliferative status of single endothelial cells within a population, whereas cell stiffness and contractility are not. These findings show that the effects of cell mechanics in shape control of proliferation are far more complex than a linear or straightforward relationship. Our data are consistent with a mechanism by which spreading of cells in G1 partially enhances proliferation by inducing nuclear swelling and decreasing chromatin condensation, thereby rendering DNA more accessible to the replication machinery.

Improvement of the quality factor of RF integrated inductors by layout optimization

A systematic method to improve the quality (Q) factor of RF integrated inductors is presented in this paper. The proposed method is based on the layout optimization to minimize the series resistance of the inductor coil, taking into account both ohmic losses, due to conduction currents, and magnetically induced losses, due to eddy currents. The technique is particularly useful when applied to inductors in which the fabrication process includes integration substrate removal. However, it is also applicable to inductors on low-loss substrates. The method optimizes the width of the metal strip for each turn of the inductor coil, leading to a variable strip-width layout. The optimization procedure has been successfully applied to the design of square spiral inductors in a silicon-based multichip-module technology, complemented with silicon micromachining postprocessing. The obtained experimental results corroborate the validity of the proposed method. A Q factor of about 17 have been obtained for a 35-nH inductor at 1.5 GHz, with Q values higher than 40 predicted for a 20-nH inductor working at 3.5 GHz. The latter is up to a 60% better than the best results for a single strip-width inductor working at the same frequency.

Entropy change of martensitic transformations in Cu-based shape-memory alloys

We have investigated the different contributions to the entropy change at the martensitic transition of different families of Cu-based shape-memory alloys. The total entropy change has been obtained through calorimetric measurements. By measuring the evolution of the magnetic susceptibility with temperature, the entropy change associated with conduction electrons has been evaluated. The contribution of the anharmonic vibrations of the lattice has also been estimated using various parameters associated with the anharmonic behavior of these alloys, collected from the literature. The results found in the present work have been compared to values published for the martensitic transition of group-IV metals. For Cu-based alloys, both electron and anharmonic contributions have been shown to be much smaller than the overall entropy change. This finding demonstrates that the harmonic vibrations of the lattice are the most relevant contribution to the stability of the bcc phase in Cu-based alloys.

Vibrational behaviour of bcc Cu-based shape memory alloys close to the martensitic transition

Experimental data from ultrasonic and inelastic neutron scattering measurements are analyzed for different families of Cu-based shape-memory alloys. It is shown that the transition occurs at a value, independent of composition and alloy family, of the ratio between the elastic constants associated with the two shears necessary to accomplish the lattice distortion from the bcc to the close-packed structure. The zone boundary frequency of the TA2[110] branch evaluated at the transition point (TM), weakly depends, for each family, on composition. A linear relationship between this frequency and the inverse of the elastic constant C', both quantities evaluated at TM, has been found, in agreement with the prediction of a Landau model proposed for martensitic transformations.

On the stability of the bcc phase in Cu-Al-Mn shape memory alloys

Measurements of the entropy change at the martensitic transition of two composition-related sets of Cu-Al-Mn shape-memory alloys are reported. It is found that most of the entropy change has a vibrational origin, and depends only on the particular close-packed structure of the low-temperature phase. Using data from the literature for other Cu-based alloys, this result is shown to be general. In addition, it is shown that the martensitic structure changes from 18R to 2H when the ratio of conduction electrons per atom reaches the same value as the eutectoid point in the equilibrium phase diagram. This finding indicates that the structure of the metastable low-temperature phase is reminiscent of the equilibrium structure.