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.

Audit risk and rent extraction: Evidence from a randomized evaluation in Brazil

We report results from a randomized policy experiment designed to test whether increasedaudit risk deters rent extraction in local public procurement and service delivery in Brazil. Ourestimates suggest that temporarily increasing annual audit risk by about 20 percentage pointsreduced the proportion of irregular local procurement processes by about 17 percentage points.This reduction was driven entirely by irregularities involving mismanagement or corruption. Incontrast, we find no evidence that increased audit risk affected the quality of publicly providedpreventive and primary health care services -measured based on user satisfaction surveys- orcompliance with national regulations of the conditional cash transfer program "Bolsa Família".

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.

Adaptive approach heuristics for the generalized assignment problem

The Generalized Assignment Problem consists in assigning a setof tasks to a set of agents with minimum cost. Each agent hasa limited amount of a single resource and each task must beassigned to one and only one agent, requiring a certain amountof the resource of the agent. We present new metaheuristics forthe generalized assignment problem based on hybrid approaches.One metaheuristic is a MAX-MIN Ant System (MMAS), an improvedversion of the Ant System, which was recently proposed byStutzle and Hoos to combinatorial optimization problems, and itcan be seen has an adaptive sampling algorithm that takes inconsideration the experience gathered in earlier iterations ofthe algorithm. Moreover, the latter heuristic is combined withlocal search and tabu search heuristics to improve the search.A greedy randomized adaptive search heuristic (GRASP) is alsoproposed. Several neighborhoods are studied, including one basedon ejection chains that produces good moves withoutincreasing the computational effort. We present computationalresults of the comparative performance, followed by concludingremarks and ideas on future research in generalized assignmentrelated problems.

Promoting rule compliance in daily-life: Evidence from a randomized field experiment in the public libraries of Barcelona

We study how to promote compliance with rules in everyday situations. Having access to unique data on the universe of users of all public libraries inBarcelona, we test the effect of sending email messages with dierent contents.We find that users return their items earlier if asked to do so in a simple email.Emails reminding users of the penalties associated with late returns are more effective than emails with only a generic reminder. We find differential treatmenteffects by user types. The characteristics we analyze are previous compliance,gender, age, and nationality.

Psychological pressure in competitive environments: Evidence from a randomized natural experiment

Much like cognitive abilities, emotional skills can have major effects on performance and economic outcomes. This paper studies the behavior of professionalsubjects involved in a dynamic competition in their own natural environment. Thesetting is a penalty shoot-out in soccer where two teams compete in a tournamentframework taking turns in a sequence of five penalty kicks each. As the kicking order is determined by the random outcome of a coin flip, the treatment and control groups are determined via explicit randomization. Therefore, absent any psychological effects, both teams should have the same probability of winning regardless of the kicking order. Yet, we find a systematic first-kicker advantage. Using data on 2,731 penalty kicks from 262 shoot-outs for a three decade period, we find that teams kicking first win the penalty shoot-out 60.5% of the time. A dynamic panel data analysis shows that the psychological mechanism underlying this result arises from the asymmetry in the partial score. As most kicks are scored, kicking first typically means having the opportunity to lead in the partial score, whereas kicking second typically means lagging in the score and having the opportunity to, at most, get even. Having a worse prospect than the opponent hinders subjects' performance.Further, we also find that professionals are self-aware of their own psychological effects. When a recent change in regulations gives winners of the coin toss the chance to choose the kicking order, they rationally react to it by systematically choosing to kick first. A survey of professional players reveals that when asked to explain why they prefer to kick first, they precisely identify the psychological mechanism for which we find empirical support in the data: they want to lead in the score inorder to put pressure on the opponent.

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.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.

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.

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.

Use of information on the manufacture of samples for the optical characterization of multilayers through a global optimization

We present a procedure for the optical characterization of thin-film stacks from spectrophotometric data. The procedure overcomes the intrinsic limitations arising in the numerical determination of manyparameters from reflectance or transmittance spectra measurements. The key point is to use all theinformation available from the manufacturing process in a single global optimization process. The method is illustrated by a case study of solgel applications.

Computer-aided procedure for optimization of layer thickness uniformity in thermal evaporation physical vapor deposition chambers for lens coating

A computer-aided method to improve the thickness uniformity attainable when coating multiple substrates inside a thermal evaporation physical vapor deposition unit is presented. The study is developed for the classical spherical (dome-shaped) calotte and also for a plane sector reversible holder setup. This second arrangement is very useful for coating both sides of the substrate, such as antireflection multilayers on lenses. The design of static correcting shutters for both kinds of configurations is also discussed. Some results of using the method are presented as an illustration.

Optimization of laser interferometers for the detection of gravitational waves from coalescing binaries

Coalescing compact binary systems are important sources of gravitational waves. Here we investigate the detectability of this gravitational radiation by the recently proposed laser interferometers. The spectral density of noise for various practicable configurations of the detector is also reviewed. This includes laser interferometers with delay lines and Fabry-Prot cavities in the arms, both in standard and dual recycling arrangements. The sensitivity of the detector in all those configurations is presented graphically and the signal-to-noise ratio is calculated numerically. For all configurations we find values of the detector's parameters which maximize the detectability of coalescing binaries, the discussion comprising Newtonian- as well as post-Newtonian-order effects. Contour plots of the signal-to-noise ratio are also presented in certain parameter domains which illustrate the interferometer's response to coalescing binary signals.

Community pharmacist intervention in depressed primary care patients (PRODEFAR study): randomized controlled trial protocol.

Background: Treatment of depression, the most prevalent and costly mental disorder, needs to be improved. Non-concordance with clinical guidelines and non-adherence can limit the efficacy of pharmacological treatment of depression. Through pharmaceutical care, pharmacists can improve patients' compliance and wellbeing. The aim of this study is to evaluate the effectiveness and costeffectiveness of a community pharmacist intervention developed to improve adherence and outcomes of primary care patients with depression. Methods/design: A randomized controlled trial, with 6-month follow-up, comparing patients receiving a pharmaceutical care support programme in primary care with patients receiving usual care. The total sample comprises 194 patients (aged between 18 and 75) diagnosed with depressive disorder in a primary care health centre in the province of Barcelona (Spain). Subjects will be asked for written informed consent in order to participate in the study. Diagnosis will be confirmed using the SCID-I. The intervention consists of an educational programme focused on improving knowledge about medication, making patients aware of the importance of compliance, reducing stigma, reassuring patients about side-effects and stressing the importance of carrying out general practitioners' advice. Measurements will take place at baseline, and after 3 and 6 months. Main outcome measure is compliance with antidepressants. Secondary outcomes include; clinical severity of depression (PHQ-9), anxiety (STAI-S), health-related quality of life (EuroQol-5D), satisfaction with the treatment received, side-effects, chronic physical conditions and sociodemographics. The use of healthcare and social care services will be assessed with an adapted version of the Client Service Receipt Inventory (CSRI). Discussion: This trial will provide valuable information for health professionals and policy makers on the effectiveness and cost-effectiveness of a pharmaceutical intervention programme in the context of primary care. Trial registration: NCT00794196

Nadolol plus isosorbide mononitrate alone or associated with band ligation in the prevention of recurrent bleeding: A multicenter randomized controlled trial.

Background and aims: Previous clinical trials suggest that adding non-selective beta-blockers improves the efficacy of endoscopic band ligation (EBL) in the prevention of recurrent bleeding, but no study has evaluated whether EBL improves the efficacy of beta-blockers + isosorbide-5-mononitrate. The present study was aimed at evaluating this issue in a multicentre randomised controlled trial (RCT) and to correlate changes in hepatic venous pressure gradient (HVPG) during treatment with clinical outcomes. Methods: 158 patients with cirrhosis, admitted because of variceal bleeding, were randomised to receive nadolol+isosorbide-5-mononitrate alone (Drug: n=78) or combined with EBL (Drug+EBL; n=80). HVPG measurements were performed at randomisation and after 4¿6 weeks on medical therapy. Results: Median follow-up was 15 months. One-year probability of recurrent bleeding was similar in both groups (33% vs 26%: p=0.3). There were no significant differences in survival or need of rescue shunts. Overall adverse events or those requiring hospital admission were significantly more frequent in the Drug+EBL group. Recurrent bleeding was significantly more frequent in HVPG non-responders than in responders (HVPG reduction ¿20% or ¿12 mm Hg). Among non-responders recurrent bleeding was similar in patients treated with Drugs or Drugs+EBL. Conclusions: Adding EBL to pharmacological treatment did not reduce recurrent bleeding, the need for rescue therapy, or mortality, and was associated with more adverse events. Furthermore, associating EBL to drug therapy did not reduce the high rebleeding risk of HVPG non-responders.