面向对象计算机系统若干问题的研究

现有面向对象的软件环境大都建立在传统的Von Neumann 型计算机结构上,其执行效率很低。传统系统是无法支持面向对象风格高效实现的。很有必要开发新型的体系结构以支持这种良好的程序设计风格。本文从介绍面向对象程序设计的基本思想入手,建立面向对象思想与计算机系统的联系,阐述有关研究问题并给出初步的解决办法。     

Prolog 编译器中暂时变量分配方法研究

文中研究对prolog 编译器的暂时变量的分配,介绍了回溯分配法,着重介绍了一种高效的无回溯分配法的实现原理及其优点。     

未知最优值线性规划的修正 Karmarkar算法

本文对未知最优值的Karmarkar型线性规划,得到了一种复杂性为O(n~(3.5)L)的修正Karmarkar 算法;通过讨论加边矩阵和秩1修正矩阵的LDL~T 分解,得到了一种计算Q—斜投影的有效方法。最后,从理论上分析了算法的收敛性和复杂性。     

另一类分配问题及其求解方法

本文对规划论中分配问题的目标要求稍作变动,产生了另一类分配问题,并提出了在特定的求解数表中,通过找闭回路即可求得最优分配方案的一种有效的求解方法。     

弹药处废点布局和处废能力设计研究

以“军械供应工程”项目中的子题目“弹药处废系统工程”为研究背景,运用多目标线性规则理论,建立弹药处度点布局和处废能力设计的决策模型,并对模型的求解进行研究。     

多机实时通信系统及其程序自动生成器的设计

介绍了多机实时通信系统的设计方法,并在此基础上介绍了多机实时通信系统自动生成器的设计原理和方法。     

A decomposition algorithm applied to planning the interdiction of stochastic networks

We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267–287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

汽油调合优化模型

为了提高炼油厂制订成品油调合方案的科学性,研究了汽油调合优化的非线性规划模型,给出了目标函数和约束条件的具体形式。根据模型特征,选用模拟退火算法对模型求解。最后,通过某炼油厂的一个应用实例验证了上述成品油调合优化模型的有效性。     

What you should know about the vehicle routing problem

In the Vehicle Routing Problem (VRP), the aim is to design a set of m minimum cost vehicle routes through n customer locations, so that each route starts and ends at a common location and some side constraints are satisfied. Common applications arise in newspaper and food delivery, and in milk collection. This article summarizes the main known results for the classical VRP in which only vehicle capacity constraints are present. The article is structured around three main headings: exact algorithms, classical heuristics, and metaheuristics. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015