一种考虑整数约束的环境效率评价MOISBMSE模型

传统的基于数据包络分析的环境效率评价常常忽略投入、期望产出和非期望产出为离散型变量的可能性,从而无法精确处理现实中存在的具有整数特征的指标数据,一直以来影响着评价结果的精确性.本文以混合导向的整数DEA为基础,对超效率SBM模型进行拓展,构建了一种能够同时兼顾整数约束和非期望产出指标数据的超效率SBM模型,并在实例中采用搜索算法,对该模型进行求解并通过Bootstrap方法对结果进行修正.将每一个最优整数点与被评价决策单元之间的距离进行比较,可以找出最短距离所对应的最优整数点,即为其帕累托改进方向.该模型将为环境效率评价提供了适用范围更广泛的测度方法.     

并行工程产品开发过程定量化建模与计划制订

由于现有的一些并行工程定量化模型中修改设计微循环的细节特征描述得还不够充分 ,本文提出了一种新的基于产品 -工艺设计活动对网络的定量化模型来描述并行工程产品开发过程 ,并且给出了产品 -工艺设计活动对平均持续时间与产品或工艺设计活动资源占用率的计算方法 .在此基础上 ,将并行工程产品开发过程的计划制订问题建模成一个有资源约束的项目调度问题 .与其它此类问题不同的是 ,在本文中 ,分配给产品开发项目的各类资源的数量不是事先给定的 ,而是与最优产品开发计划一起获得的 ,所以这是一个资源分配与计划制订的集成优化问题 .本文提出了一种新的基于分枝定界的算法来解决此问题并引入一个启发式规则来提高算法的搜索效率     

考虑实时预倒箱的出口箱堆场多场桥调度优化

在出口集装箱堆场的实际作业过程中,倒箱是制约场桥作业效率的瓶颈之一。为提高出口箱堆场的作业效能,减少船舶装船作业时间,采用实时预倒来降低倒箱的影响,研究出口箱堆场多场桥调度优化问题。考虑待提箱作业次序固定、场桥间保持安全距离及不可跨越的现实约束,兼顾内集卡的等待上限,侧重场桥作业过程中的实时预倒箱,构建了以带惩罚因子的内集卡总等待时间最少为目标的混合整数线性规划模型。基于问题自身的特点设计了混合和声模拟退火算法,得出了各场桥的行走路径与实时预倒箱方案。在算例实验中,通过与不考虑实时预倒箱的方案、FCFS方案以及下界进行对比,验证了考虑实时预倒箱的场桥调度模型及算法的有效性,为集装箱码头出口箱堆场的场桥调度提供参考。     

集成化物流管理中库存路径问题研究综述

综合国内外多种参考文献,介绍了IRP的基本概念及其主要特征,从常见模型、求解策略及算法2个维度综述了当前国内外关于IRP的主要研究进展,最后指出了该研究领域在未来研究中应予以重视的几个研究方向,为进一步的研究奠定了基础.     

求解输出为有界随机数的排序择优问题

目的/意义排序择优问题是仿真优化领域的经典研究问题。该问题的目标是设计统计采样算法,通过在有限个统计分布中进行采样并观测随机采样结果从而找到真实均值最大的分布。在该问题的研究中,现有文献大多假设对不同分布进行采样时输出为正态分布随机数,进而基于正态分布随机数相关性质进行算法设计。但在现实中,该假设通常不成立,一旦假设不成立,现有算法的统计有效性将会大受影响。设计/方法将正态假设进行拓展,即假设对不同分布为有界域分布,进而开展算法设计。结论/发现设计出一类顺序淘汰式算法求解输出为有界域随机数的排序择优问题,数值实验验证,此算法效率远高于现有的SE、ME和lil′DCB算法。     

Fitting competing risks data to bivariate Pareto models

This paper revisits two bivariate Pareto models for fitting competing risks data. The first model is the Frank copula model, and the second one is a bivariate Pareto model introduced by Sankaran and Nair (1993 Sankaran, P. G., and N. U. Nair. 1993. A bivariate Pareto model and its applications to reliability. Naval Research Logistics 40 (7):1013–1020. doi:10.1002/1520-6750(199312)40:7%3c1013::AID-NAV3220400711%3e3.0.CO;2-7.[Crossref], [Web of Science ®] , [Google Scholar]). We discuss the identifiability issues of these models and develop the maximum likelihood estimation procedures including their computational algorithms and model-diagnostic procedures. Simulations are conducted to examine the performance of the maximum likelihood estimation. Real data are analyzed for illustration.     

党政机构微博在突发事件中传播效果的影响因素及策略

在分析铁路货运量预测方法的基础上，针对标准BP神经网络的不足，提出改进的BP神经网络预测模型。首先,利用动态陡度因子来改变激励函数的陡峭程度，以此来得到更好的激励函数响应特征以及更好的非线性表达能力；其次，利用附加动量因子，通过对以前经验的积累，既降低了神经网络对误差曲面的局部细节敏感特性，又较好的遏制了神经网络易于限于局部最小的缺陷；最后，采取改变学习率的方法，给定一个较大的学习率初始值，在学习的过程中学习率不断减小，网络最终趋于稳定。改进BP算法既可以得到更优的解，还能够缩短训练时间。利用全国铁路货运     

The competing risks analysis for parallel and series systems using Type-II progressive censoring

Abstract

Recently, the study of the lifetime of systems in reliability and survival analysis in the presence of several causes of failure (competing risks) has attracted attention in the literature. In this paper, series and parallel systems with exponential lifetime for each item of the system are considered. Several causes of failure independently affect lifetime distributions and observations of failure times of the systems are considered under progressive Type-II censored scheme. For series systems, the maximum likelihood estimates of parameters are computed and confidence intervals for parameters of the model are obtained using Fisher information matrix. For parallel systems, the generalized EM algorithm which uses the Newton-Raphson algorithm inside the EM algorithm is used to compute the maximum likelihood estimates of parameters. Also, the standard errors of the maximum likelihood estimates are computed by using the supplemented EM algorithm. The simulation study confirms the good performance of the introduced approach.     

The Effects of Multitasking on Operations Scheduling

This study considers a typical scheduling environment that is influenced by the behavioral phenomenon of multitasking. Under multitasking, the processing of a selected job suffers from interruption by other jobs that are available but unfinished. This situation arises in a wide variety of applications; for example, administration, manufacturing, and process and project management. Several classical solution methods for scheduling problems no longer apply in the presence of multitasking. The solvability of any scheduling problem under multitasking is no easier than that of the corresponding classical problem. We develop optimal algorithms for some fundamental and practical single machine scheduling problems with multitasking. For other problems, we show that they are computationally intractable, even though in some cases the corresponding problem in classical scheduling is efficiently solvable. We also study the cost increase and value gained due to multitasking. This analysis informs companies about how much it would be worthwhile to invest in measures to reduce or encourage multitasking.     

Implementing Monte Carlo tests with p-value buckets

Software packages usually report the results of statistical tests using p-values. Users often interpret these values by comparing them with standard thresholds, for example, 0.1, 1, and 5%, which is sometimes reinforced by a star rating (***, **, and *, respectively). We consider an arbitrary statistical test whose p-value p is not available explicitly, but can be approximated by Monte Carlo samples, for example, by bootstrap or permutation tests. The standard implementation of such tests usually draws a fixed number of samples to approximate p. However, the probability that the exact and the approximated p-value lie on different sides of a threshold (the resampling risk) can be high, particularly for p-values close to a threshold. We present a method to overcome this. We consider a finite set of user-specified intervals that cover [0, 1] and that can be overlapping. We call these p-value buckets. We present algorithms that, with arbitrarily high probability, return a p-value bucket containing p. We prove that for both a bounded resampling risk and a finite runtime, overlapping buckets need to be employed, and that our methods both bound the resampling risk and guarantee a finite runtime for such overlapping buckets. To interpret decisions with overlapping buckets, we propose an extension of the star rating system. We demonstrate that our methods are suitable for use in standard software, including for low p-value thresholds occurring in multiple testing settings, and that they can be computationally more efficient than standard implementations.