考虑储存成本的集装箱公铁联运路径优化

联运企业的效益受运输路径和运输方式的影响。如何降低联运成本、提高联运企业的效益,已成为学术研究的重中之重。针对集装箱公铁联运路径优化问题,以运输成本、换装成本、储存成本、时间惩罚成本构成的运输总成本为目标函数,建立集装箱公铁联运路径优化模型,考虑运输时间限制、班期限制、节点储存成本,得出使运输总成本最低的运输路径及运输方式,并利用算例验证模型的有效性。     

新时代侨校思想政治工作的价值定位和路径优化

侨校思想政治工作是高校思想政治工作的有机构成。进入新时代，要准确把握侨校思想政治工作的价值定位，直面当前侨校思想政治工作中所面临的价值观念多元化、工作队伍薄弱化和工作对象差异化的挑战，创新思路，统筹着力，牢牢掌握侨校意识形态工作的话语权，汇聚侨校思想政治工作的强大合力，构建分层化差异化的教育模式，增强侨校思想政治工作的时代性、针对性和实效性。     

带工期指派的产品服务系统订单随机调度问题研究

针对由一个制造工厂和多个区域服务中心组成的服务型制造企业，研究了考虑生产时间和服务时间均具有随机性且工期可指派的产品服务系统（PSS）订单调度问题。首先以最小化订单提前、误工和工期指派费用的期望总额为目标构建问题的优化模型，然后分析目标函数近似值的最优性条件，据此提出加权最短平均生产时间排序规则，并结合该规则与插入邻域局部搜索设计了启发式算法对问题进行求解，最后通过数值仿真验证算法的可行性和有效性。研究表明，提前费用偏差对PSS订单调度与工期指派决策的影响很小，因此企业管理者无需准确估计库存费用也能制定出比较有效的PSS订单调度策略；而工期指派费用偏差对决策结果的影响非常大，因此企业管理者在决策时必须谨慎估计该项费用。     

VIF-based adaptive matrix perturbation method for heteroskedasticity-robust covariance estimators in the presence of multicollinearity

In this study, we investigate linear regression having both heteroskedasticity and collinearity problems. We discuss the properties related to the perturbation method. Important observations are summarized as theorems. We then prove the main result that states the heteroskedasticity-robust variances can be improved and that the resulting bias is minimized by using the matrix perturbation method. We analyze a practical example for validation of the method.     

Parametrizing the Kepler exoplanet period-radius distribution with the bivariate normal inverse Gaussian distribution

This paper presents a simple and robust method for obtaining a comprehensive understanding of the joint period and radius distribution in Kepler exoplanets. The proposed method is based on particle swarm optimization and bivariate Normal Inverse Gaussian distribution. Furthermore, in the construction of the probability density function, this study selects planet-host stars with the GK-type. The injecting approach is also employed to solve the survey completeness of sample. The resulting occurrence rate of Earth analogs is 0.025 with a 95% bootstrap confidence interval between 0.023 and 0.032.     

A new algorithm for clustering based on kernel density estimation

In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.     

The exponential distribution analog of the Grubbs–Weaver method

Abstract

Grubbs and Weaver (1947 Grubbs, F. E., and C. L. Weaver. 1947. The best unbiased estimate of population standard deviation based on group ranges. Journal of the American Statistical Association 42 (238):224–41. doi: 10.2307/2280652.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) suggest a minimum-variance unbiased estimator for the population standard deviation of a normal random variable, where a random sample is drawn and a weighted sum of the ranges of subsamples is calculated. The optimal choice involves using as many subsamples of size eight as possible. They verified their results numerically for samples of size up to 100, and conjectured that their “rule of eights” is valid for all sample sizes. Here we examine the analogous problem where the underlying distribution is exponential and find that a “rule of fours” yields optimality and prove the result rigorously.     

Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil

Motivated by a proposal of the local authority for improving the existing healthcare system in the Parana State in Brazil, this article presents an optimization-based model for developing a better system for patients by aggregating various health services offered in the municipalities of Parana into some microregions. The problem is formulated as a multi-objective partitioning of the nodes of an undirected graph (or network) with the municipalities as the nodes and the roads connecting them as the edges of the graph. Maximizing the population homogeneity in the microregions, maximizing the variety of medical procedures offered in the microregions, and minimizing the inter-microregion distances to be traveled by patients are considered as three objective functions of the problem. An integer-coded multi-objective genetic algorithm is adopted as the optimization tool, which yields a significant improvement to the existing healthcare system map of the Parana State. The results obtained may have a strong impact on the healthcare system management in Parana. The model proposed here could be a useful tool to aid the decision-making in health management, as well as for better organization of any healthcare system, including those of other Brazilian States.     

Unaddressed problems and research perspectives in scheduling blood collection from donors

Many optimisation problems arise in managing the Blood Donation (BD) supply chain. Most of them have been addressed in the literature, while other problems, e.g. donation scheduling, have not been sufficiently addressed so far. However, blood collection from donors may have a disruptive impact on the entire BD supply chain if not properly managed. For example, scheduling donation appointments based on some system metrics may improve the flow of blood units through the BD supply chain and increase the quality of service perceived by donors. In this short communication, we present the donation scheduling problem and highlight the lack of work in the literature that deals with this problem. Then, we analyse the impact of an unbalanced flow of blood units on the BD system and the benefits that may derive from a suitable appointment scheduling. Finally, we propose suggestions for future research in BD collection scheduling that may improve the BD process.     

Resource Distribution in Multiple Attacks with Imperfect Detection of the Attack Outcome

This article extends the previous research of consecutive attacks strategy by assuming that an attacker observes the outcome of each attack imperfectly. With given probabilities it may wrongly identify a destroyed target as undestroyed, and wrongly identify an undestroyed target as destroyed. The outcome of each attack is determined by a contest success function that depends on the amount of resources allocated by the defender and the attacker to each attack. The article suggests a probabilistic model of the multiple attacks and analyzes how the target destruction probability and the attacker's relative resource expenditure are impacted by the two probabilities of incorrect observation, the attacker's and defender's resource ratio, the contest intensity, the number of attacks, and the resource distribution across attacks. We analyze how the attacker chooses the number of attacks, the attack stopping rule, and the optimal resource distribution across attacks to maximize its utility.