An oracle-based algorithm for robust planning of production routing problems in closed-loop supply chains of beverage glass bottles

The demand for glass bottles is exhibiting an upward trend over time. The manufacturing of glass bottles is costlier in terms of time and resources and is associated with a higher level of heat generation and environmental pollution compared to recycling processes. In response to the aforementioned challenges, companies that use glass bottles need to implement strategies to manage their reverse supply chains in conjunction with their traditional supply chains, as the economic and environmental benefits of returned products are unquestionable. Closed-loop supply chains (CLSCs) integrate forward and reverse flows of products and information. This integration helps companies to have a broader view of the whole chain. Despite these advantages, managing CLSCs can be challenging as they are exposed to many uncertainties regarding supply and demand processes, travel times, and quantity/quality of returned products.In this study, we consider the production planning, inventory management, and vehicle routing decisions of a CLSC of beverage glass bottles. We propose an MILP model and rely on a multi-stage adjustable robust optimization (ARO) formulation to deal with the randomness in both the demand for filled bottles and the requests for pickups of empty bottles. We develop an exact oracle-based algorithm to solve the ARO problem and propose a heuristic search algorithm to reduce the solution time. Our numerical experiments not only show the incompetency of the customary method, namely the affine decision rule approach, but also illustrate how our algorithms can solve the small-size problems and significantly improve the quality of the obtained solution for large problems. Furthermore, our numerical results show that robust plans tend to be sparse, meaning the routes are chosen so that empty bottles are transported to production sites in such a way that fewer new bottles need to be ordered. Thus, robust planning makes the CLSCs more environmentally friendly.     

A note on the monotonicity of the ES algorithm

In the study of the robust nonparametric regression problem, Oh et al. [The role of pseudo data for robust smoothing with application to wavelet regression, Biometrika 94 (2007), pp. 893–904] developed and named the ES algorithm. In the event that the ES algorithm converges, the robust estimator can be obtained through a sequence of conventional penalized least-squares estimates, the computation of which is fast and straightforward. However, the convergence of the ES algorithm was not established theoretically in Oh et al. In this note, we show that under a certain simple condition, the ES algorithm is monotonic. In particular, the ES algorithm does converge globally in the setting of Oh et al.     

基于高维分步投影的多重分区聚类算法

数据分布密度划分的聚类算法是数据挖掘聚类算法的主要方法之一。针对传统密度划分聚类算法存在运算复杂、运行效率不高等缺陷，设计高维分步投影的多重分区聚类算法；以高维分布投影密度为依据，对数据集进行多重分区，产生数据集的子簇空间，并进行子簇合并，形成理想的聚类结果；依据该算法进行实验，结果证明该算法具有运算简单和运行效率高等优良性。     

Specific Organizational Citizenship Behaviours and Organizational Effectiveness: The Development of a Conceptual Heuristic Device

Organizational citizenship behaviour has generally been associated with organizational effectiveness. However, recent research has shown that this may not always be the case and that certain types of organizational citizenship behaviour such as compulsory citizenship behaviour, may be inimical to the fulfillment of formal goals and organizational effectiveness. Using military historical and business organizational secondary data, the paper maintains that extreme variance in either organizational (task) or personal (social psychological) support organizational citizenship behaviour generates entropic citizenship behaviour which derails completely the effective accomplishment of formal organizational goals. A general model of organizational citizenship behaviour with entropic citizenship behavior as its novel conceptual boundary is developed in the paper, and four specific propositions with implications for future empirical research are delineated.     

Kiefer–Wolfowitz algorithm under quasi-associated random errors

In this article, we study the algorithm of Kiefer–Wolfowitz underquasi-associated random errors. We establish the complete convergence and obtain an exponential bound. Additionally, we build a confidence interval for the minimum. Numerical examples are sketched out to confirm the theoretical results and show the accuracy of the algorithm.     

Interval estimation for misclassification rate parameters in a complementary Poisson model

We investigate three interval estimators for binomial misclassification rates in a complementary Poisson model where the data are possibly misclassified: a Wald-based interval, a score-based interval, and an interval based on the profile log-likelihood statistic. We investigate the coverage and average width properties of these intervals via a simulation study. For small Poisson counts and small misclassification rates, the intervals can perform poorly in terms of coverage. The profile log-likelihood confidence interval (CI) is often proved to outperform the other intervals with good coverage and width properties. Lastly, we apply the CIs to a real data set involving traffic accident data that contain misclassified counts.     

Estimation of a discriminant function from a mixture of two inverse Weibull distributions

The classification of a random variable based on a mixture can be meaningfully discussed only if the class of all finite mixtures is identifiable. In this paper, we find the maximum-likelihood estimates of the parameters of the mixture of two inverse Weibull distributions by using classified and unclassified observations. Next, we estimate the nonlinear discriminant function of the underlying model. Also, we calculate the total probabilities of misclassification as well as the percentage bias. In addition, we investigate the performance of all results through a series of simulation experiments by means of relative efficiencies. Finally, we analyse some simulated and real data sets through the findings of the paper.     

混合学习法前向网络多属性储层参数预测

应用前向网络描述地震属性和储层参数间的非线性映射关系时，经典的误差反向传播算法存在收敛速度慢，易陷入局部极值等诸多不足。研究了融合粒子群优化算法和误差反向传播算法的混合学习法前向网络多属性储层参数预测技术。粒子群优化算法是一种群体随机搜索演化计算技术，具有较快的收敛速度和较强的全局搜寻能力；误差反向传播算法本质上是梯度下降算法，注重局部搜索。混合学习法为两种学习算法交替执行，首先以粒子群优化算法训练网络，当误差能量在规定的迭代次数内不再发生变化时，采用误差反向传播算法实现局部寻优。理论函数逼近测试和实际储层参数预测实验说明了混合学习法具有学习时间短、求解效率高、可靠性强的优点，具有良好的应用前景。     

A time-varying measurement error model for age of onset of a psychiatric diagnosis: applied to first depressive episode diagnosed by the Composite International Diagnostic Interview (CIDI)

A substantial degree of uncertainty exists surrounding the reconstruction of events based on memory recall. This form of measurement error affects the performance of structured interviews such as the Composite International Diagnostic Interview (CIDI), an important tool to assess mental health in the community. Measurement error probably explains the discrepancy in estimates between longitudinal studies with repeated assessments (the gold-standard), yielding approximately constant rates of depression, versus cross-sectional studies which often find increasing rates closer in time to the interview. Repeated assessments of current status (or recent history) are more reliable than reconstruction of a person's psychiatric history based on a single interview. In this paper, we demonstrate a method of estimating a time-varying measurement error distribution in the age of onset of an initial depressive episode, as diagnosed by the CIDI, based on an assumption regarding age-specific incidence rates. High-dimensional non-parametric estimation is achieved by the EM-algorithm with smoothing. The method is applied to data from a Norwegian mental health survey in 2000. The measurement error distribution changes dramatically from 1980 to 2000, with increasing variance and greater bias further away in time from the interview. Some influence of the measurement error on already published results is found.