在分离式Hopkinson拉杆实验中确定临界实验条件的经验方法

在分离式Hopkinson拉杆实验中,常常需要获得试样在经历一个拉力脉冲拉断情况下的最低应变率,而在分离式Hopkinson拉杆装置中确定对应最低应变率的发射压力需要进行多次尝试性实验。为了更好地解决这一问题,提出一种简单的经验方法,可以通过一次拉断的实验结果计算出一个拉力脉冲拉断试样需要的最小发射压力及相应的应变率,进一步可以预测不同发射压力下的应变率。对4种铝合金试样进行拉伸实验,结果表明,利用提出的经验方法得到的应变率结果与实验结果吻合较好,可以有效地对发射压力和实验应变率进行预估。     

平面动载实验中碰撞速度和倾斜度测试的一个方法

平面动载实验中 ,飞片碰撞速度和碰撞状态是加载条件的一个基本描述。本文采用电探针技术 ,给出了一个同时测得真实飞片速度和碰撞倾斜状态的探针排布设计。此设计用于化爆产生平面动载的氮化硅粉体冲击波活化研究 ,取得了较为理想的测试结果。     

可招回秘书问题

可招回秘书问题已由Yang,Petrucceol,Choe及Bal研究过。本文将这个问题纳入Snell框架,用相对最好者的位置函数Wn代替通常的相对名次,我们得到了各种招回概率下的最优停止规则,这些结果推广了文[7]—[9]。     

面向多最优解组合优化问题的决策求解算法

针对具有固定物品总和、多最优解特征的组合优化问题,以固定总和实数子集问题和购买鸡翅问题为例,给出了这类多最优解组合优化问题的形式化表示。在分析枚举等经典算法基础上,提出了基于整数状态表示和实数状态表示的0-1决策递归搜索多最优解动态规划算法。针对该算法在最优解数量较大时,时间复杂度趋向O(mⁿ)的问题,提出了基于相同决策路径合并和基于0-x决策的两种改进算法。实验中两种改进算法的计算时间基本符合与O(nb+nm)的正比关系,表明对于这类多最优解组合优化问题具有良好的求解性能。     

多芯片焊球阵列封装体受热载荷作用数值模拟

针对典型高密度多芯片BGA(焊球阵列)封装体建立三维有限元分析模型,研究不同尺寸封装体在稳态热载荷作用下的结构变形和应力情况,在此基础上引入包含等效梁和危险焊球真实几何形状和间距等在内的简化模型以进行序列分析,研究各设计参数对力学参量的影响。数值结果反映了封装体应力分布及其变化特点,表明影响封装体变形和应力的主要参数;提出的建模方法简便有效,可以方便地用来分析不同类型的BGA封装,并扩展应用至不同的分析目的,为此种结构的设计和优化提供一定参考。     

Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

当前高校教学评估中的问题及对策研究

高校教学评估是高等教育质量保障体系的重要方面,对当前我国高校教学评估中普遍存在的问题应引起足够重视并提出相应的对策。     

一类带配送中心运输问题的容量扩张模型研究

运输问题一般采用表上作业法来解决,考虑一类带配送中心的运输问题,若仍采用表上作业法,会使问题复杂化.文中采用一种构造辅助网络的方法:在运输网络中将每个配送中心均拆分成两个点,连接两点形成新弧,构造出新的网络,并给每条弧赋予参数,将此类运输问题转换为最小费用流模型来解决,可以使问题模型和运算简单化.在此基础上,考虑运输网络中配送中心和边的容量扩张问题.     

Optimizing natural gas pipeline transmission with nonuniform elevation: A new initialization approach

In this paper, we develop an iterative piecewise linear approximation approach with a novel initialization method to solve natural gas pipeline transmission problems with the nonuniform network elevation. Previous approaches, such as energy minimization methods, cannot be applied to solve problems with the nonuniform network elevation because they exclude pressure range constraints, and thus provide solutions far from optimum. We propose a new initialization model that considers pressure range constraints and improves the optimality of the solutions and the computational efficiency. Furthermore, we extend the energy minimization methods and provide the necessary conditions under which the extended methods operate in networks with the nonuniform elevation. We test the performances of the methods with previously reported pipeline networks from the literature, with the open data set GasLib, and with our industrial collaborator. The initialization approach is shown to be more efficient than the method with fixed initial breakpoints. The newly proposed initialization approach generates solutions with a higher accuracy than the extended energy minimization methods, especially in large‐size networks. The proposed method has been applied to natural gas transmission planning by the China National Petroleum Corporation and has brought a direct profit increase of 330 million U.S. dollars in 2015‐2017.     

Heuristics for the multi‐resource generalized assignment problem

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001