Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Supply chain coordination with product line design and a revenue sharing scheme

Many manufacturers sell their products through retailers and share the revenue with those retailers. Given this phenomenon, we build a stylized model to investigate the role of revenue sharing schemes in supply chain coordination and product variety decisions. In our model, a monopolistic manufacturer serves two segments of consumers, which are distinguished by their willingness to pay for quality. In the scenario with exogenous revenue sharing ratios, when the potential gain from serving the low segment is substantial (e.g., the low‐segment consumers' willingness to pay is high enough or the low segment takes a large enough proportion of the market), the retailer is better off abandoning the revenue sharing scheme. Moreover, when the potential gain from serving the low (high) segment is substantial enough, the manufacturer finds it profitable to offer a single product. Furthermore, when revenue sharing ratios are endogenous, we divide our analysis into two cases, depending on the methods of cooperation. When revenue sharing ratios are negotiated at the very beginning, the decentralized supply chain causes further distortion. This suggests that the central premise of revenue sharing—the coordination of supply chains—may be undermined if supply chain parties meticulously bargain over it.     

新疆兵团中小学双语教育质量调查及对策研究--以兵团第三师为例

双语教育质量是兵团民族教育的关键,直接影响高素质少数民族人才的培养。本文在深入调查的基础上,研究兵团中小学双语教育质量及其现状,通过对影响双语教育质量的各个因素进行分析,总结双语教育中存在的问题,并在此基础上提出加强校本培训和师资队伍建设,完善双语教材及考核评价体系等对策。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

New inequalities for finite and infinite group problems from approximate lifting

In this paper, we derive new families of facet‐defining inequalities for the finite group problem and extreme inequalities for the infinite group problem using approximate lifting. The new valid inequalities for the finite group problem include two‐ and three‐slope facet‐defining inequalities as well as the first family of four‐slope facet‐defining inequalities. The new valid inequalities for the infinite group problem include families of two‐ and three‐slope extreme inequalities. These new inequalities not only illustrate the diversity of strong inequalities for the finite and infinite group problems, but also provide a large variety of new cutting planes for solving integer and mixed‐integer programming problems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Estimating failure time distribution and its parameters based on intermediate data from a Wiener degradation model

Instead of measuring a Wiener degradation or performance process at predetermined time points to track degradation or performance of a product for estimating its lifetime, we propose to obtain the first‐passage times of the process over certain nonfailure thresholds. Based on only these intermediate data, we obtain the uniformly minimum variance unbiased estimator and uniformly most accurate confidence interval for the mean lifetime. For estimating the lifetime distribution function, we propose a modified maximum likelihood estimator and a new estimator and prove that, by increasing the sample size of the intermediate data, these estimators and the above‐mentioned estimator of the mean lifetime can achieve the same levels of accuracy as the estimators assuming one has failure times. Thus, our method of using only intermediate data is useful for highly reliable products when their failure times are difficult to obtain. Furthermore, we show that the proposed new estimator of the lifetime distribution function is more accurate than the standard and modified maximum likelihood estimators. We also obtain approximate confidence intervals for the lifetime distribution function and its percentiles. Finally, we use light‐emitting diodes as an example to illustrate our method and demonstrate how to validate the Wiener assumption during the testing. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

VC实现故障诊断的智能化

针对大规模集成电路或非线性电路的故障诊断存在着定位困难和诊断速度低的问题,而且传统电路专家诊断系统有一定的缺陷.结合神经网络用于诊断的优点和VC程序的通用性强等特点,构造了一种神经网络的故障诊断系统,并且介绍了该系统的设计思想、实现过程及诊断实例.     

基于灰色关联分析的水下航行器效能评估

根据水下航行器的自身特点和主要任务,建立了以机动、探测、追踪、抗干扰、通信为基本特征能力的评估结构体系.运用灰色关联分析理论,以水下航行器各项能力指标的关联度为评估准则,提出了水下航行器的综合评估方法.通过实例验证了该方法的正确性、有效性,为水下航行器系统的技术优化和使用效能的提高提供了科学决策依据.     

HLA 海上编队对抗仿真系统构建

建立了具有通用性的基于HLA的作战仿真试验平台,在此基础之上,构建了基于HLA的海上编队对抗仿真模型.介绍了该仿真系统对象类和交互类的设计开发,并给出了仿真系统的工作流程.该对抗系统可设定为自动运行,也可人员参与指挥.通过对真实装备的模拟和现实作战环境的仿真,系统可以对每次演练进行评估和回演标定,并给出参战武器在作战性能方面的鉴定结果.该仿真系统可作为理论性辅助设备用于人员训练、作战与指挥研究和装备的性能测试评估.