Single row facility layout problem using a permutation-based genetic algorithm

In this paper, a permutation-based genetic algorithm (GA) is applied to the NP-hard problem of arranging a number of facilities on a line with minimum cost, known as the single row facility layout problem (SRFLP). The GA individuals are obtained by using some rule-based as well as random permutations of the facilities, which are then improved towards the optimum by means of specially designed crossover and mutation operators. Such schemes led the GA to handle the SRFLP as an unconstrained optimization problem. In the computational experiments carried out with large-size instances of sizes from 60 to 80, available in the literature, the proposed GA improved several previously known best solutions.     

An integrated fuzzy simulation-fuzzy data envelopment analysis algorithm for job-shop layout optimization: The case of injection process with ambiguous data

This paper puts forward an integrated fuzzy simulation-fuzzy data envelopment analysis (FSFDEA) algorithm to cope with a special case of single-row facility layout problem (SRFLP). Discrete-event-simulation, a powerful tool for analyzing complex and stochastic systems, is employed for modeling different layout formations. Afterwards, a range-adjusted measure (RAM) is used as a data envelopment analysis (DEA) model for ranking the simulation results and finding the optimal layout design. Due to ambiguousness associated with the processing times, fuzzy sets theory is incorporated into the simulation model. Since the results of simulation are in the form of possibility distributions, the DEA model is treated on a fuzzy basis; therefore, a recent possibilistic programming approach is used to convert the fuzzy DEA model to an equivalent crisp one. The proposed FSFDEA algorithm is capable of modeling and optimizing small-sized SRFLP’s in stochastic, uncertain, and non-linear environments. The solution quality is inspected through a real case study in a refrigerator manufacturing company.     

手性络合物[M(bpy)_2(phen)]~(2+)和[M(phen)_2(bpy)]~(2+)(M=Ru,Os)圆二色谱的理论解析

应用密度泛函理论,在B3LYP/LanL2DZ水平上对C2对称性的混配络合物[M(bpy)2(phen)]2+和[M(phen)2(bpy)]2+(M=Ru、Os;bpy=2,2'-bipyridine;phen=1,10-phenanthroline)在水溶液中的几何构型进行了优化,并用TDDFT/B3LYP方法和相同的基组计算了其激发能、旋转强度和振子强度,绘制了相应的圆二色谱(CD).在分析有关跃迁性质的基础上,对实验圆二色谱的谱带进行了明确的解析和指认,同时讨论了短波区激子裂分的规律性.结果表明:四种络合物在长波区(λ>320nm)的CD吸收带主要是由d-π*跃迁产生的荷移谱带;短波区(λ<320nm)则是配体上平行于长轴的π-π*跃迁产生的激子耦合带,且对于Λ构型表现为正的手性激子裂分.其中,[M(bpy)2(phen)]2+只显示出正负两个激子带,分属于联吡啶和邻菲咯啉配体;而[M(phen)2(bpy)]2+则有三个激子带,其中左侧的两个(一负一正)属于邻菲咯啉配体,右侧的正带则属于联吡啶配体.此外,尽管激子耦合属于远程相互作用,但用TDDFT计算的激子裂分样式仍是正确的.这些结论对于深入理解有...     

不确定条件下的乡村中小学布局优化

学校的合理规划布局是实现教育资源优化配置、提高办学效益和推动教育均衡发展的重要途径。已有许多学者研究了学校的布局问题,但基本上都忽略了交通网络条件以及不确定因素对学校布局的影响。本研究将在前人研究基础上,重点考虑交通网络对乡村中小学选址的影响,并假设旅行时间具有不确定性,从而以最小化学生旅行成本、学校建设、道路修建和道路升级成本为目标,构建不确定条件下的设施区位设计模型。在算法求解方面提出混合模拟退火算法,用于确定新建学校的最佳位置,以及新道路的修建和原有道路的升级情况。最后,将提出的模型和算法应用到实际案例中。     

An approximation algorithm for a facility location problem with stochastic demands and inventories

We propose a 2-approximation algorithm for a facility location problem with stochastic demands. At open facilities, inventory is kept such that arriving requests find a zero inventory with (at most) some pre-specified probability. Costs incurred are expected transportation costs, facility operating costs and inventory costs.     

最弱受约束电子势模型下PbⅡ离子Rydberg态能级研究

在最弱受约束电子势模型理论框架下,通过对最弱受约束电子的识别,将Martin关于单价原子量子亏损的公式推广到了多价原子(离子)系统.本文依此计算了PbⅡ离子的几个Rydberg系列能级,结果与实验值符合较好.     

逐步增加的Ⅱ型截尾下系统可靠性的Bayes分析及寿命预测

在逐步增加的型截尾模型下,研究部件寿命服从双参数指数分布的冷贮备串联系统可靠性指标的Bayes估计及单样本场合未来观测值的预测问题.在两个参数均未知的情形下,分别在平方损失(SE)、LINEX损失和熵(General Entropy,GE)损失函数下给出两个参数及可靠性指标的Bayes估计,对于超参数的确定,给出一种新的方法;并讨论了单样本场合未来观测值的预测问题,给出预测分布及预测区间;最后利用随机模拟方法进行比较,并对结果进行了讨论.     

一种水下运动目标被动报警的新算法

根据矢量水听器的测向原理和算法，提出了一种目标方位角的变化实现水下运动目标低频高精度的报警方法。该报警系统以水下设施为平台，对靠近设施的运动目标的方位进行跟踪测量，并在目标距离水下设施最近时给出报警信号，以达到有效地避免事故的目的。与传统的利用声级变化报警或主动回波测距报警方法相比，该方法具有低频、作用距离远和高精度的特点。     

质子治癌进展

一些国家利用质子治癌取得良好疗效，质子束的优良剂量分布特性使剂量集中于肝瘤，减少了对周围正常组织不必要的伤害。文章介绍了治疗装置，治疗过程及其最近的发展。     

Single facility location on a network under mill and delivered pricing

^** E-mail: pelegrin{at}um.es Firms normally use either a mill price or a delivered pricepolicy, depending on market conditions (type of good, transportationway, customers location, costs, etc). In this paper, the problemof selecting the best location for an entering firm in competitionwith some pre-existing firms, under each price policy, is studiedon a network for the first time. With mill pricing, an equilibriumin price rarely exists and it is assumed that all competingfirms set a common mill price for all customers. With deliveredpricing, there exists a Nash equilibrium in price and it isassumed that the equilibrium price in each area is offered tothe customers in that area. In both cases, we consider thatcustomers buy from the cheapest facility and the same rulesare used for tie breaking in the lowest cost. While the profitmaximization problem for the entering firm always has optimalsolutions under mill pricing, this problem might not have anoptimal solution under delivered pricing. We show some discretizationresults and give procedures to find the full set of optimal,or -optimal, solutions to the problem under the two price policies.A comparison of results with the two price policies is givenby using an illustrative example.