Inventory-routing model, for a multi-period problem with stochastic and deterministic demand

The need for integration in the supply chain management leads us to considerthe coordination of two logistic planning functions: transportation andinventory. The coordination of these activities can be an extremely importantsource of competitive advantage in the supply chain management. The battle forcost reduction can pass through the equilibrium of transportation versusinventory managing costs. In this work, we study the specific case of aninventory-routing problem for a week planning period with different types ofdemand. A heuristic methodology, based on the Iterated Local Search, isproposed to solve the Multi-Period Inventory Routing Problem with stochasticand deterministic demand.

The donor problem

Donors often rely on local intermediaries to deliver benefits to target beneficiaries. Each selected recipient observes if the intermediary under-delivers to them, so they serve as natural monitors. However, they may withhold complaints when feeling unentitled or grateful to the intermediary for selecting them. Furthermore, the intermediary may distort selection (e.g. by picking richer recipients who feel less entitled) to reduce complaints. We design an experimental game representing the donor s problem. In one treatment, the intermediary selects recipients. In the other, selection is random - as by an uninformed donor. In our data, random selection dominates delegation of the selection task to the intermediary. Selection distortions are similar, but intermediaries embezzle more when they have selection power and (correctly) expect fewer complaints.

A simple optimised search heuristic for the job-shop scheduling problem

This paper presents a simple Optimised Search Heuristic for the Job Shop Scheduling problem that combines a GRASP heuristic with a branch-and-bound algorithm. The proposed method is compared with similar approaches and leads to better results in terms of solution quality and computing times.

Substances psychoactives au volant: quelle conduite ? [Psychoactive substances and driving: which approach?]

Les problèmes médicaux concernant la conduite automobile deviennent de plus en plus compliqués et de plus en plus fréquents. Dans la plupart des cantons suisses, chaque médecin peut potentiellement être interpellé en tant que médecin-conseil d'un de ses patients. Le présent article s'intéresse particulièrement aux problèmes de toxicodépendance dans le cadre du contexte législatif actuel et de la complexité croissante des soins. Medical problems involving driving aptitude are more and more common nowadays. Each doctor in Switzerland could be asked to give a certificate of driving aptitude for one of his/her patient. This paper relates to the problem of substance abusers in the current legal context and the growing complexity of care.

Metaheuristics for the bus-driver scheduling problem

We present new metaheuristics for solving real crew scheduling problemsin a public transportation bus company. Since the crews of thesecompanies are drivers, we will designate the problem by the bus-driverscheduling problem. Crew scheduling problems are well known and severalmathematical programming based techniques have been proposed to solvethem, in particular using the set-covering formulation. However, inpractice, there exists the need for improvement in terms of computationalefficiency and capacity of solving large-scale instances. Moreover, thereal bus-driver scheduling problems that we consider can present variantaspects of the set covering, as for example a different objectivefunction, implying that alternative solutions methods have to bedeveloped. We propose metaheuristics based on the following approaches:GRASP (greedy randomized adaptive search procedure), tabu search andgenetic algorithms. These metaheuristics also present some innovationfeatures based on and genetic algorithms. These metaheuristics alsopresent some innovation features based on the structure of the crewscheduling problem, that guide the search efficiently and able them tofind good solutions. Some of these new features can also be applied inthe development of heuristics to other combinatorial optimizationproblems. A summary of computational results with real-data problems ispresented.

Thyroid hormone enhances transected axonal regeneration and muscle reinnervation following rat sciatic nerve injury.

Improvement of nerve regeneration and functional recovery following nerve injury is a challenging problem in clinical research. We have already shown that following rat sciatic nerve transection, the local administration of triiodothyronine (T3) significantly increased the number and the myelination of regenerated axons. Functional recovery is a sum of the number of regenerated axons and reinnervation of denervated peripheral targets. In the present study, we investigated whether the increased number of regenerated axons by T3-treatment is linked to improved reinnervation of hind limb muscles. After transection of rat sciatic nerves, silicone or biodegradable nerve guides were implanted and filled with either T3 or phosphate buffer solution (PBS). Neuromuscular junctions (NMJs) were analyzed on gastrocnemius and plantar muscle sections stained with rhodamine alpha-bungarotoxin and neurofilament antibody. Four weeks after surgery, most end-plates (EPs) of operated limbs were still denervated and no effect of T3 on muscle reinnervation was detected at this stage of nerve repair. In contrast, after 14 weeks of nerve regeneration, T3 clearly enhanced the reinnervation of gastrocnemius and plantar EPs, demonstrated by significantly higher recovery of size and shape complexity of reinnervated EPs and also by increased acetylcholine receptor (AChRs) density on post synaptic membranes compared to PBS-treated EPs. The stimulating effect of T3 on EP reinnervation is confirmed by a higher index of compound muscle action potentials recorded in gastrocnemius muscles. In conclusion, our results provide for the first time strong evidence that T3 enhances the restoration of NMJ structure and improves synaptic transmission.

Modular support for developing mobile ad hoc applications

Abstract This PhD thesis addresses the issue of alleviating the burden of developing ad hoc applications. Such applications have the particularity of running on mobile devices, communicating in a peer-to-peer manner and implement some proximity-based semantics. A typical example of such application can be a radar application where users see their avatar as well as the avatars of their friends on a map on their mobile phone. Such application become increasingly popular with the advent of the latest generation of mobile smart phones with their impressive computational power, their peer-to-peer communication capabilities and their location detection technology. Unfortunately, the existing programming support for such applications is limited, hence the need to address this issue in order to alleviate their development burden. This thesis specifically tackles this problem by providing several tools for application development support. First, it provides the location-based publish/subscribe service (LPSS), a communication abstraction, which elegantly captures recurrent communication issues and thus allows to dramatically reduce the code complexity. LPSS is implemented in a modular manner in order to be able to target two different network architectures. One pragmatic implementation is aimed at mainstream infrastructure-based mobile networks, where mobile devices can communicate through fixed antennas. The other fully decentralized implementation targets emerging mobile ad hoc networks (MANETs), where no fixed infrastructure is available and communication can only occur in a peer-to-peer fashion. For each of these architectures, various implementation strategies tailored for different application scenarios that can be parametrized at deployment time. Second, this thesis provides two location-based message diffusion protocols, namely 6Shot broadcast and 6Shot multicast, specifically aimed at MANETs and fine tuned to be used as building blocks for LPSS. Finally this thesis proposes Phomo, a phone motion testing tool that allows to test proximity semantics of ad hoc applications without having to move around with mobile devices. These different developing support tools have been packaged in a coherent middleware framework called Pervaho.

Dispersal probability distributions and the wave-front speed problem

The speed and width of front solutions to reaction-dispersal models are analyzed both analytically and numerically. We perform our analysis for Laplace and Gaussian distribution kernels, both for delayed and nondelayed models. The results are discussed in terms of the characteristic parameters of the models

Zum Problem der Übersetzung von Gedichten : auch vom Gesichtspunkt des Computers

Abstract

Identification and removal of low-complexity sites in allele-specific analysis of ChIP-seq data.

MOTIVATION: High-throughput sequencing technologies enable the genome-wide analysis of the impact of genetic variation on molecular phenotypes at unprecedented resolution. However, although powerful, these technologies can also introduce unexpected artifacts. Results: We investigated the impact of library amplification bias on the identification of allele-specific (AS) molecular events from high-throughput sequencing data derived from chromatin immunoprecipitation assays (ChIP-seq). Putative AS DNA binding activity for RNA polymerase II was determined using ChIP-seq data derived from lymphoblastoid cell lines of two parent-daughter trios. We found that, at high-sequencing depth, many significant AS binding sites suffered from an amplification bias, as evidenced by a larger number of clonal reads representing one of the two alleles. To alleviate this bias, we devised an amplification bias detection strategy, which filters out sites with low read complexity and sites featuring a significant excess of clonal reads. This method will be useful for AS analyses involving ChIP-seq and other functional sequencing assays.

Note on the blocking flow shop problem

We present some results attained with different algorithms for the Fm|block|Cmax problem using as experimental data the well-known Taillard instances.