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.

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.

Adaptive dynamics and the implementation problem with complete information

This paper studies the equilibrating process of several implementationmechanisms using naive adaptive dynamics. We show that the dynamics convergeand are stable, for the canonical mechanism of implementation in Nash equilibrium.In this way we cast some doubt on the criticism of ``complexity'' commonlyused against this mechanism. For mechanisms that use more refined equilibrium concepts,the dynamics converge but are not stable. Some papers in the literatureon implementation with refined equilibrium concepts have claimed that themechanisms they propose are ``simple'' and implement ``everything'' (incontrast with the canonical mechanism). The fact that some of these ``simple''mechanisms have unstable equilibria suggests that these statements shouldbe interpreted with some caution.

Complete Nucleotide Sequence of Mouse Mammary Tumor Virus from JYG Chinese Wild Mice: Absence of Bacterial Insertion Sequences in the Cloned Viral gag Gene.

Mammary tumors of a newly isolated strain of Chinese wild mouse (JYG mouse) harbor exogenous mouse mammary tumor virus (MMTV). The complete nucleotide sequence of exogenous JYG-MMTV was determined on the proviral 5' long terminal repeat (LTR)(partial)-gag-pol-env-3' LTR (partial) fragment cloned into a plasmid vector and the cDNA sequence from JYG-MMTV producing cells. Similarly to the other MMTV species the LTR of JYG-MMTV contains an open reading frame (ORF). The amino acid sequence of the JYG-MMTV ORF resembles that of SW-MMTV (92% identity) and endogenous Mtv-7 (93% identity) especially at the C-terminal region. Thus, a functional similarity in T-cell receptor V beta recognition as a superantigen is implicated among these MMTV species. Analysis of the viral gag nucleotide sequence revealed that this gene is not disrupted by the bacterial insertion sequence IS1 or IS2, which have been reported to be present in the majority of the plasmids containing the gag region. Comparison of amino acid sequences of JYG-MMTV with those of BR6-MMTV showed that over 96% of the amino acids of gag, pol, protease and env products are identical. These results suggest the intact nature of the nucleotide sequence of the near full-length MMTV genome cloned in the plasmid.

Taking "Galton's problem" Seriously : Towards a Theory of Policy Diffusion

This article builds on the recent policy diffusion literature and attempts to overcome one of its major problems, namely the lack of a coherent theoretical framework. The literature defines policy diffusion as a process where policy choices are interdependent, and identifies several diffusion mechanisms that specify the link between the policy choices of the various actors. As these mechanisms are grounded in different theories, theoretical accounts of diffusion currently have little internal coherence. In this article we put forward an expected-utility model of policy change that is able to subsume all the diffusion mechanisms. We argue that the expected utility of a policy depends on both its effectiveness and the payoffs it yields, and we show that the various diffusion mechanisms operate by altering these two parameters. Each mechanism affects one of the two parameters, and does so in distinct ways. To account for aggregate patterns of diffusion, we embed our model in a simple threshold model of diffusion. Given the high complexity of the process that results, strong analytical conclusions on aggregate patterns cannot be drawn without more extensive analysis which is beyond the scope of this article. However, preliminary considerations indicate that a wide range of diffusion processes may exist and that convergence is only one possible outcome.

A diagram of public spaces within urban landscape as a strategy for sustainable urban planning in Chinese cities

Destruction of historical urban fabric in many Chinese cities and towns, without the possibility of its recovery as an urban asset, leads us to consider alternative strategies and criteria for formulating new urban projects, using creative urban planning instruments and strategies to provide a sense of place and identity to the urban landscape. The challenge is to set up an urban structure that constitutes a spatial reference system, a structure consisting of a set of urban landmarks that construct a system of related public spaces, endowed with collective significance and identity. Such a network could include a wide variety of urban typologies and natural elements. An important result of this strategy would be the recovery of the social and cultural values attached to the natural landscape in Chinese civilization. Hangzhou city will be analyzed as a case study

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