求解二级分销网络模型的混合微粒群算法

针对现有算法在求解二级分销网络模型时计算量大、难以适用于求解大型规划问题和易陷入局部最优等不足,提出一种求解二级分销网络模型的混合微粒群算法。该算法以二级分销网络的总成本作为适应度函数,采用一种精简的编码方式,通过将遗传算法的变异和交叉操作引入微粒群算法,实现二级分销网络模型的离散优化。算例仿真结果表明:采用提出的算法能获得全局最优解,且收敛性好,运算速度快,稳定性好,能有效避免算法的早熟收敛问题。     

分销配送网络优化模型及其求解算法

为了优化网络结构 ,寻求最佳配送策略 ,最终找出成本最小的供应链 ,针对需求拖动式供应链中 ,多供应商、多产品、多客户分销配送网络的优化设计问题 ,在考虑需求分配的情况下 ,提出了分销配送网络的优化模型。为了求解优化模型 ,提出了基于混合遗传算法求解混合 0 - 1整数规划问题的算法 ,它是用遗传算法搜索 0 - 1变量的最优解 ,将其他算法融入遗传算法中 ,对非 0 - 1变量进行求解的一种算法。最后通过两个算例进行了仿真实验 ,验证了优化模型的正确性和算法的有效性。模型简明、客观 ,算法易于扩展并具有鲁棒性、通用性     

基于仿真技术的二级分销网络成本评价模型

二级分销网络是单制造商多分销中心、多销售点的物流配送网络.提出了利用仿真方法对二级分销网络建立成本评价模型;利用Arena仿真工具建立仿真模型后对分销网络运输成本、分销网络建造成本、分销中心运营成本及分销中心库存管理成本进行评价.     

基于一种新混合群算法(MOHO-SA)的结构主动控制多目标优化研究

基于粒子群(PSO)算法和差分进化(DE)算法提出了一种新的多目标混合群优化算法,对结构主动控制系统的作动器位置、数量与控制器参数进行同步优化.首先,分别采用PSO算法与DE算法进行对应种群的进化,使用庄家法则构造非支配解集,并引入边界点几何中心leader选择机制,同时利用模拟退火算法完成个体进化的二级局部搜索;以随机地震激励下反映结构振动控制效果和控制策略优劣的双指标作为优化目标函数.最后,针对ASCE 9层benchmark模型,采用本文提出的具有二级搜索功能的多目标混合群算法(MOHO-SA)对其主动控制系统进行优化设计,并分别与多目标差分进化算法(MODE)、多目标粒子群算法(MOPSO)、普通多目标混合群算法(MOHA)的优化结果进行对比分析,表明其Pareto解集具有更优的收敛曲线及分布性.     

随机需求条件下分销系统协同库存策略研究

分销系统的库存问题研究是物流及供应链管理理论研究的重要方面,有关策略的使用影响到相关供应链整体的成本和收益,为此基于基本库存策略,研究了随机需求条件下一个分销中心和多个零售商组成的二级分销系统的协同库存和订货问题.对分销中心库存的补充订货、缺货处理以及分销系统各成员之间的关系等问题采取协同策略,建立了使分销系统期望总收益最大化的数学模型,在分析模型解的存在性的基础上,探索了相应的求解方法.并对均匀分布、指数分布和正态分布的3种需求情况在模型求解方面做了具体分析和实证研究.     

需求不确定的分销系统最小成本模型

提出一种分销系统的最小成本模型,这里的产品为单一产品,产品的需求和到达的提前期都是不确定的,且允许缺货·运用该模型研究两个制造商两个分销商组成的分销网络成本优化问题,把分销商满足市场需求时的服务水平作为优化问题的约束条件·综合考虑库存成本、订货成本、运输成本和缺货成本,给出了求解满足约束的最优订货量的算法,最后给出案例     

遗传算法解供应链中二级分销网络优化设计的随机规划模型

给出供应链中二级分销网络优化设计的改进机会约束规划模型。模型中将各个分销中心的需求量和 各工厂的生产能力设为随机参数．采用基于随机模拟的遗传算法对模型进行求解,并给出算例来说明模型及 算法的有效性,最后给出结论以及未来的研究方向。     

求解供应链分销模型的双层规划方法

以一个多仓库、多分销点的供应链二级分销网络为研究对象，分别从供应链上、下游企业的角度出发，以各自的物流成本最小化为目标，利用双层规划方法建立了供应链分销网络优化模型．讨论了该模型的求解方法，并结合分层迭代的思想给出了一个有效的算法，最后借助于计算机技术实现了对模型的仿真计算．     

需求不确定下的鲁棒供应链网络优化设计

建立了一个需求不确定的多产品,多原材料的由供应商-制造商-分销中心-零售商的构成的四级鲁棒供应链网络优化设计模型。模型中的需求不确定性区别于传统意义上的需求的波动,使用情景法描述。优化模型是一个混合整数线性规划模型,设计了基于改进遗传算法的MGAND求解算法。最后给出数值实验证明了模型及算法的有效性。     

电子商务环境下具有随机需求的闭环供应链网络的设计与优化

研究电子商务环境下具有随机需求的闭环供应链的设计与优化问题.首先,考虑顾客需求的随机性和物流过程的模糊性,以供应链系统的总费用最小为目标建立了问题的数学模型;其次,运用模糊数学理论将模型中的模糊参数转变为确定性参数,并引入产品缺货成本和积压成本调节供需失衡时物流系统的总费用;最后,通过设计遗传算法确定了网络中生产中心和分销中心的优化选址以及各个物流环节的优化运输方案.数值仿真结果表明本文设计的算法能够有效地解决闭环供应链系统的设计与优化问题.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.