Flavoured leptogenesis in the CTP formalism

Within the Closed Time Path (CTP) framework, we derive kinetic equations for particle distribution functions that describe leptogenesis in the presence of several lepton flavours. These flavours have different Standard-Model Yukawa couplings, which induce flavour-sensitive scattering processes and thermal dispersion relations. Kinetic equilibrium, which is rapidly established and maintained via gauge interactions, allows to simplify these equations to kinetic equations for the matrix of lepton charge densities. In performing this simplification, we notice that the rapid flavour-blind gauge interactions damp the flavour oscillations of the leptons. Leptogenesis turns out to be in the parametric regime where the flavour oscillations are overdamped and flavour decoherence is mainly induced by flavour sensitive scatterings. We solve the kinetic equations for the lepton number densities numerically and show that they interpolate between the unflavoured and the fully flavoured regimes within the intermediate parametric region, where neither of these limits is applicable.     

Integrated production and distribution scheduling with lifespan constraints

We consider an integrated production and distribution scheduling problem in a make-to-order business scenario. A product with a short lifespan (e.g., perishable or seasonal) is produced at a single production facility with a limited production rate. This means that the product expires in a constant time after its production is finished. Orders are received from a set of geographically dispersed customers, where a demand for the product and a time window for the delivery is associated with each customer for the planning period. A single vehicle with non-negligible traveling times between the locations is responsible for the deliveries. Due to the limited production and distribution resources, possibly not all customers may be supplied within their time windows or the lifespan. The problem consists in finding a selection of customers to be supplied such that the total satisfied demand is maximized. We extend the work by Armstrong et al. (Annals of Operations Research 159(1):395–414, 2008) on the problem for fixed delivery sequences by pointing out an error in their branch and bound algorithm and presenting a corrected variant. Furthermore, we introduce model extensions for handling delays of the production start as well as for variable production and distribution sequences. Efficient heuristic solution algorithms and computational results for randomly generated instances are presented.     

Limit theorems for strongly and intermediately supercritical branching processes in random environment with linear fractional offspring distributions

In the present paper, we characterize the behavior of supercritical branching processes in random environment with linear fractional offspring distributions, conditioned on having small, but positive values at some large generation. As it has been noticed in previous works, there is a phase transition in the behavior of the process. Here, we examine the strongly and intermediately supercritical regimes The main result is a conditional limit theorem for the rescaled associated random walk in the intermediately case.     

Implicit depot assignments and rotations in vehicle routing heuristics

Vehicle routing variants with multiple depots and mixed fleet present intricate combinatorial aspects related to sequencing choices, vehicle type choices, depot choices, and depots positioning. This paper introduces a dynamic programming methodology for efficiently evaluating compound neighborhoods combining sequence-based moves with an optimal choice of vehicle and depot, and an optimal determination of the first customer to be visited in the route, called rotation. The assignment choices, making the richness of the problem, are thus no more addressed in the solution structure, but implicitly determined during each move evaluation. Two meta-heuristics relying on these concepts, an iterated local search and a hybrid genetic algorithm, are presented. Extensive computational experiments demonstrate the remarkable performance of these methods on classic benchmark instances for multi-depot vehicle routing problems with and without fleet mix, as well as the notable contribution of the implicit depot choice and positioning methods to the search performance. New state-of-the-art results are obtained for multi-depot vehicle routing problems (MDVRP), and multi-depot vehicle fleet mix problems (MDVFMP) with unconstrained fleet size. The proposed concepts are fairly general, and widely applicable to many other vehicle routing variants.     

A survey of recent research on location-routing problems

The design of distribution systems raises hard combinatorial optimization problems. For instance, facility location problems must be solved at the strategic decision level to place factories and warehouses, while vehicle routes must be built at the tactical or operational levels to supply customers. In fact, location and routing decisions are interdependent and studies have shown that the overall system cost may be excessive if they are tackled separately. The location-routing problem (LRP) integrates the two kinds of decisions. Given a set of potential depots with opening costs, a fleet of identical vehicles and a set of customers with known demands, the classical LRP consists in opening a subset of depots, assigning customers to them and determining vehicle routes, to minimize a total cost including the cost of open depots, the fixed costs of vehicles used, and the total cost of the routes. Since the last comprehensive survey on the LRP, published by Nagy and Salhi (2007), the number of articles devoted to this problem has grown quickly, calling a review of new research works. This paper analyzes the recent literature (72 articles) on the standard LRP and new extensions such as several distribution echelons, multiple objectives or uncertain data. Results of state-of-the-art metaheuristics are also compared on standard sets of instances for the classical LRP, the two-echelon LRP and the truck and trailer problem.     

A synergy of multicriteria techniques to assess additive value models

The assessment of additive value functions in Multicriteria Decision Aid (MCDA) has to face issues of legitimacy and technical difficulties when real decision makers are involved. This paper presents a synergy of three complementary techniques to assess additive models on the whole criteria space. The synergy includes a revised MACBETH technique, the standard MAUT trade-off analysis and UTA-based methods for the assessment of both the marginal value functions and the weighting factors. The paper uses a set of original robustness measures and rules associated with revised MACBETH and UTA in order to manage multiple linear programming solutions and to extract robust conclusions from them. Finally, to illustrate the methods’ synergy, an application example is presented, dealing with the planning of metro extension lines.     

Commutativity of the Valdivia–Vogt table of representations of function spaces

In this article, we show that the Valdivia–Vogt structure table—containing the sequence space representations of the most used spaces of smooth functions appearing in the theory of distributions—can be interpreted as a commutative diagram, i.e., there is an isomorphism between the space of infinitely differentiable functions and the space , where s is the space of rapidly decreasing sequences, such that its restriction to the other function spaces in the structure table yields an isomorphism between these spaces of smooth functions and their sequence space representation. This result answers the corresponding question of Prof. Dietmar Vogt formulated on the conference “Functional Analysis: Applications to Complex Analysis and Partial Differential Equations” held in B?dlewo in May 2012.     

Robust vanishing of all Lyapunov exponents for iterated function systems

Given any compact connected manifold $M$ , we describe $C^2$ -open sets of iterated functions systems (IFS’s) admitting fully-supported ergodic measures whose Lyapunov exponents along $M$ are all zero. Moreover, these measures are approximated by measures supported on periodic orbits. We also describe $C^1$ -open sets of IFS’s admitting ergodic measures of positive entropy whose Lyapunov exponents along $M$ are all zero. The proofs involve the construction of non-hyperbolic measures for the induced IFS’s on the flag manifold.     

Spectral approximation of quadratic operator polynomials arising in photonic band structure calculations

Galerkin spectral approximation theory for non-self-adjoint quadratic operator polynomials with periodic coefficients is considered. The main applications are complex band structure calculations in metallic photonic crystals, periodic waveguides, and metamaterials. We show that the spectrum of the considered operator polynomials consists of isolated eigenvalues of finite multiplicity with a nonzero imaginary part. The spectral problem is equivalent to a non-compact block operator matrix and norm convergence is shown for a block operator matrix having the same generalized eigenvectors as the original operator. Convergence rates of finite element discretizations are considered and numerical experiments with the $p$ -version and the $h$ -version of the finite element method confirm the theoretical convergence rates.     

Fluorescence detected circular dichroism (FDCD) for supramolecular host–guest complexes

Fluorescence-detected circular dichroism (FDCD) spectroscopy is applied for the first time to supramolecular host–guest and host–protein systems and compared to the more known electronic circular dichroism (ECD). We find that FDCD can be an excellent choice for common supramolecular applications, e.g. for the detection and chirality sensing of chiral organic analytes, as well as for reaction monitoring. Our comprehensive investigations demonstrate that FDCD can be conducted in favorable circumstances at much lower concentrations than ECD measurements, even in chromophoric and auto-emissive biofluids such as blood serum, overcoming the sensitivity limitation of absorbance-based chiroptical spectroscopy. Besides, the combined use of FDCD and ECD can provide additional valuable information about the system, e.g. the chemical identity of an analyte or hidden aggregation phenomena. We believe that simultaneous FDCD- and ECD-based chiroptical characterization of emissive supramolecular systems will be of general benefit for characterizing fluorescent, chiral supramolecular systems due to the higher information content obtained by their combined use.

Fluorescence-detected circular dichroism (FDCD) spectroscopy is applied for the first time to supramolecular host–guest and host–protein systems and compared to the more known electronic circular dichroism (ECD).