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.     

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.     

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.     

掺钕聚甲基丙烯酸甲酯的光学特性

研究了制备的掺钕螯合物Nd(DBM)3Phen材料的吸收光谱、激发光谱、荧光光谱,应用Judd-Ofelt理论计算了该材料的强度参量．分析了钕离子激发态4F3／2的辐射寿命(631 μs)和4F3／2→4IJ′跃迁的受激发射截面和荧光分支比．     

关于一类具有相同非负群逆和M-P逆的非负矩阵的进一步研究

1引言设A是n阶非负方阵．设矩阵方程(1)AXA=A,(2)XAX=X,(3)(AX)~T= AX,(4)(XA)~T=XA,(5)AX=XA．A具有非负广义逆是指存在非负方阵X满足方程(1)～(4),并记为A~(?)．A具有非负群逆是指存在非负方阵X满足方程(1),(2),(5),并记为A~#．在A~(?)存在的前提下,两者相同的充分必要条件有(a)AA~(?)=A~(?)A；(b)A~(?)=p(A),其     

Polyhedral <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">2</Emphasis></Subscript>

 Using elementary graded automorphisms of polytopal algebras (essentially the coordinate rings of projective toric varieties) polyhedral versions of the group of elementary matrices and the Steinberg and Milnor groups are defined. They coincide with the usual K-theoretic groups in the special case when the polytope is a unit simplex and can be thought of as compact/polytopal substitutes for the tame automorphism groups of polynomial algebras. Relative to the classical case, many new aspects have to be taken into account. We describe these groups explicitly when the underlying polytope is 2-dimensional. Already this low-dimensional case provides interesting classes of groups. Received: 13 December 2001 / Revised version: 24 June 2002 The second author was supported by the Deutsche Forschungsgemeinschaft, INTAS grant 99-00817 and TMR grant ERB FMRX CT-97-0107 Mathematics Subject Classification (2000): 14L27, 14M25, 19C09, 52B20     

Singularity conjecture and constructions of Jacobi forms

This paper verifies the singularity conjecture for Jacobi forms with higher degree in some typical cases, and gives constructions for the Jacobi cusp forms whose Fourier coefficients can be expressed by some kind of Rankin-typeL-series.     

模糊对向传播网络数据融合目标识别方法

重点研究了模糊对向传播网络 (FCPN)模型。针对数据融合和目标识别的特点 ,提出了基于模糊对向传播网络的融合目标识别方法和改进的模糊对向传播网络 (MFCPN)融合结构。利用仿真数据对网络的训练算法和融合结构进行了实验研究。结果表明 ,模糊对向传播网络较误差后向传播网络 (BPN)能够有效地实现融合识别 ;改进的模糊对向传播网络融合结构是可行的。同时还对FCPN和MFCPN应用于前视红外 (FLIR)和可见光摄像机目标跟踪系统进行了应用研究。     

Instability of quark matter core in a compact newborn neutron star with moderately strong magnetic field

It is explicitly shown that if phase transition occurs at the core of a newborn neutron star with moderately strong magnetic field strength, which populates only the electron’s Landau levels, then in the β -equilibrium condition, the quark core is energetically much more unstable than the neutron matter of identical physical condition.