Decomposition-based approximation algorithms for the one-warehouse multi-retailer problem with concave batch order costs

We study the one-warehouse multi-retailer problem under deterministic dynamic demand and concave batch order costs, where order batches have an identical capacity and the order cost function for each facility is concave within the batch. Under appropriate assumptions on holding cost structure, we obtain lower bounds via a decomposition that splits the two-echelon problem into single-facility subproblems, then propose approximation algorithms by judiciously recombining the subproblem solutions. For piecewise linear concave batch order costs with a constant number of slopes we obtain a constant-factor approximation, while for general concave batch costs we propose an approximation within a logarithmic factor of optimality. We also extend some results to subadditive order and/or holding costs.     

系统与应用相结合 加强科学计算研究

科学计算是计算机学科和应用学科交叉融合的产物。文章阐述了科学计算的内涵和作用,论述了其科学基础和关键技术,及其对高性能计算机技术的挑战,提出了从科学计算应用基础研究和艾级计算机关键技术研究着手,加强科学计算交叉研究和复合型人才培养的思考。     

战时铁路运输油料抢收模拟优化

战时,铁路运输油料抢收是一个受到各种随机因素影响的复杂过程,很难采用数学方法建立模型求解。以运筹学的排队论为建模指导思想,采用GPSSW语言对这一动态过程进行模拟,并对模拟结果进行统计分析,结合实际情况采用优化技术对模拟结果作出改进,从而得到最佳的抢收方案。结果表明,该模拟方法适用于解决此类半结构化问题,可为战时铁路运输油料抢收提供有效的决策支持。     

某型高射机枪机匣校正产生破断的原因分析

某型高射机枪机匣经调质后,在校正时发生破断。采用化学分析和宏微观断口观察等方法,对破断件进行了分析。结果表明,破断件断口上有局部过烧区,且在晶界上形成疏松孔,并伴有严重的氧化。在外力作用下即发生沿晶界脆性破断。     

层次分析法在民用客机项目供应商选择中的应用

本文根据项目评价的一般原则,结合大飞机项目的特点,建立了大飞机项目的评价指标体系,确立了企业能力、服务程度、合作水平等三项指标,设计了大飞机项目供应商选择的程序和方法,并给出了应用范例。     

Branch‐and‐price‐and‐cut for the manpower routing problem with synchronization constraints

In this article, we propose a branch‐and‐price‐and‐cut (BPC) algorithm to exactly solve the manpower routing problem with synchronization constraints (MRPSC). Compared with the classical vehicle routing problems (VRPs), the defining characteristic of the MRPSC is that multiple workers are required to work together and start at the same time to carry out a job, that is, the routes of the scheduling subjects are dependent. The incorporation of the synchronization constraints increases the difficulty of the MRPSC significantly and makes the existing VRP exact algorithm inapplicable. Although there are many types of valid inequalities for the VRP or its variants, so far we can only adapt the infeasible path elimination inequality and the weak clique inequality to handle the synchronization constraints in our BPC algorithm. The experimental results at the root node of the branch‐and‐bound tree show that the employed inequalities can effectively improve the lower bound of the problem. Compared with ILOG CPLEX, our BPC algorithm managed to find optimal solutions for more test instances within 1 hour. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 138–171, 2016     

大型稀疏线性代数迭代库在YH 机上的高效实现

本文讨论了大型稀疏线性代数方程组的迭代算法、加速方法、存贮技术及并行算法。结合向量机特点,采取有效程序优化措施,开发研制了标量和向量库程序。在ＹＨ系列机上试算结果表明：大型稀疏线性代数向量迭代库比标量迭代库速度有较大提高。当Ｎ≥１００时,在ＹＨ─１机上加速比约２～８;在ＹＨ─２机上约２～７;当迭代次数增加时,加速比提高更明显;库中共轭梯度（ＣＧ）加速方法能有效地加快收敛,可减少迭代次数一半以上。     

一种通用有效的神经网络映射算法

首先分析了神经网络映射的本质,神经网络拓扑结构和神经计算过程,在充分考虑负载均衡与通讯开销的基础上,引入了时间步的思想,提出了一种通用有效的神经网络映射算法,最后给出的对多种拓扑结构的神经网络的测试结果证明了该算法的通用性和有效性。     

三维数据场的可视化

三维数据场是普遍存在的。本文给出一个三维标量场和矢量场的可视化方法：对计算或实测产生的离散数据重构三维连续场的分布,构造数据场的整体发光模型,并根据发光模型计算视屏投影区域上各象素点的光强值,采用直接体绘制（ｄｉｒｅｃｔｖｏｌｕｍｅｒｅｎｄｅｒｉｎｇ）及视觉增强处理绘制出场的可视化图象,通过特征面处理绘制出场的局部分布图象。图象层次及细节丰富,反映了场的分布信息。系统具有较强的交互功能,静态、动态显示功能及友好的用户界面。     

一种Fuzzy优化模型及其满意解

本文给出了一种目标函数和约束条件都具有模糊性的优化模型。采用求条件极值的方法,得到了求这一模型的满意解。