Two modifications of the least cost per period heuristic for dynamic lot-sizing

This paper proposes two constructive heuristics for the well-known single-level uncapacitated dynamic lot-sizing problem. The proposed heuristics, called net least period cost (nLPC) and nLPC(i), are developed by modifying the average period cost concept from Silver and Meal's heuristic, commonly known as least period cost (LPC). An improved tie-breaking stopping rule and a locally optimal decision rule are proposed in the second heuristic to enhance performance. We test the effectiveness of the proposed heuristics by using 20 benchmarking test problems frequently used in the literature. Furthermore, we perform a large-scale simulation study involving three factors, 50 experimental conditions, and 100?000 randomly generated problems to evaluate the proposed heuristics against LPC and six other well-known constructive heuristics in the literature. The simulation results show that both nLPC and nLPC(i) produce average holding and setup costs lower than or equal to those of LPC in every one of the 50 experimental conditions. The proposed heuristics also outperform each of the six other heuristics evaluated in all experimental conditions, without an increase in computational requirements. Lastly, considering that both nLPC and nLPC(i) are fairly simple for practitioners to understand and that lot-sizing heuristics have been commonly used in practice, there should be a very good chance for practical applications of the proposed heuristics.     

BRST cohomology and highest weight vectors. I

We initiate a program to study certain recent problems in non-compact coset CFT by the BRST approach. We derive a reduction formula for the BRST cohomology by making use of a twisting by highest weight modules. As illustrations, we apply the formula to the bosonic string model and a rank one non-compact coset model [DPL]. Our formula provides a completely new approach to non-compact coset construction.Partially supported by NSF Grant DMS-8703581     

Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

The application of a vehicle routing model to a waste-collection problem: two case studies

In this paper we suggest a unique model for estimating the operating cost of each of three waste-collection systems. Under the traditional system, which is widely used, waste is typically collected in plastic bags and a three-man crew is needed on each vehicle. The other two systems require a one-man crew for vehicle collecting street containers. The side-loader system with fixed body automatically empties street containers into the vehicle body and empties the load at the disposal site. The side-loader system with demountable body allows the separation of the waste collection phase from transport to the disposal site, since the vehicle body can be demounted. We also present two case studies and show how the estimation of operating costs is a critical issue in decisions regarding the type of system to be used for waste collection.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

Scale Invariance Properties in the Simulated Annealing Algorithm

The Boltzmann distribution used in the steady-state analysis of the simulated annealing algorithm gives rise to several scale invariant properties. Scale invariance is first presented in the context of parallel independent processors and then extended to an abstract form based on lumping states together to form new aggregate states. These lumped or aggregate states possess all of the mathematical characteristics, forms and relationships of states (solutions) in the original problem in both first and second moments. These scale invariance properties therefore permit new ways of relating objective function values, conditional expectation values, stationary probabilities, rates of change of stationary probabilities and conditional variances. Such properties therefore provide potential applications in analysis, statistical inference and optimization. Directions for future research that take advantage of scale invariance are also discussed.     

The study and applications of photochemical-dynamical gravity wave model II

A nonlinear, compressible, non-isothermal gravity wave model that involves photochemistry is used to study the effects of gravity wave on atmospheric chemical species distributions in this paper. The changes in the distributions of oxygen compound and hydrogen compound density induced by gravity wave propagation are simulated. The results indicate that when a gravity wave propagates through a mesopause region, even if it does not break, it can influence the background distributions of chemical species. The effect of gravity wave on chemical species at night is larger than in daytime.     

Linear and nonlinear optical susceptibilities of orthorhombic rare earth molybdates RE2(MoO4)3

The dielectric responses (i.e. the refractive indices and the second order nonlinear susceptibilities) of all orthorhombic rare earth molybdates have been studied on the basis of the relationship between dielectric responses and the average atomic number of constituent atoms of crystals. Both the linear and second order nonlinear optical responses at 1.064 μm decrease with increasing atomic number from La to Lu.     

Frequency dependence of ionic conductivity and dielectric relaxation studies in Na3H(SO4)2 single crystal

Electrical impedance measurements of Na₃H(SO₄)₂ were performed as a function of both temperature and frequency. The electrical conductivity and dielectric relaxation have been evaluated. The temperature dependence of electrical conductivity reveals that the sample crystals transformed to the fast ionic state in the high temperature phase. The dynamical disordering of hydrogen and sodium atoms and the orientation of SO₄ tetrahedra results in fast ionic conductivity. In addition to the proton conduction, the possibility of a Na⁺ contribution to the conductivity in the high temperature phase is proposed. The frequency dependence of AC conductivity is proportional to ω^s. The value of the exponent, s, lies between 0.85 and 0.46 in the room temperature phase, whereas it remains almost constant, 0.6, in the high-temperature phase. The dielectric dispersion is examined using the modulus formalism. An Arrhenius-type behavior is observed when the crystal undergoes the structural phase transition.