供应链管理中的两层规划算法

文章概述两层规划问题在交通领域、资源分配、委托代理以及供应链管理中的应用并讨论了线性和非线性两种两层规划问题,总结了极点算法、下降迭代、惩罚函数和分支定界算法,并进行了评价,最后进一步探讨了两层规划问题的应用前景和算法的发展方向。     

基于最短路的配送中心选址决策与应用

物流作为“第三利润源泉”,对现代的经济活动影响日益明显,越来越引起人们的重视。配送是物流的核心问题,研究如何选择合理的配送中心和配送路线来降低配送运输成本,对物流总成本的节约具有十分重要的意义。论文从配送运输成本最小化目标出发,对单一配送中心选址以及一对一配送路线优化问题进行分析,并分别建立重心法选址模型和最短路算法模型,进行实例分析。     

基于粒子群优化的模糊聚类分析

基于求解实优化问题时,粒子群优化算法优于遗传算法。在基于遗传算法的模糊C均值聚类算法基础上,给出了基于粒子群的模糊C均值聚类算法,试验结果表明:该算法克服了传统的模糊C均值聚类算法的缺陷,同时在收敛速度方面明显优于基于遗传算法的模糊C均值聚类算法。     

模拟植物生长算法在组合优化问题中的应用:研究进展

首先介绍了系统文献综述方法论与操作流程,从不同维度给出了文献分类标准;然后基于行政机构和出版来源分类标准,梳理了模拟植物生长算法(PGSA)的研究现状;接着分别针对电力系统、应急管理、设施选址、斯坦纳树、车间调度和旅行商等组合优化问题,对PGSA应用的代表性研究进行了综述,重点介绍了PGSA在若干领域的应用;最后从不同视角总结了已有研究成果,并指出PGSA解决组合优化问题的未来研究方向和具体内容。     

Assessment of the effect of the financial crisis on agents’ expectations through symbolic regression

Agents’ perceptions on the state of the economy can be affected during economic crises. Tendency surveys are the main source of agents’ expectations. The main objective of this study is to assess the impact of the 2008 financial crisis on agents’ expectations. With this aim, we evaluate the capacity of survey-based expectations to anticipate economic growth in the United States, Japan, Germany and the United Kingdom. We propose a symbolic regression (SR) via genetic programming approach to derive mathematical functional forms that link survey-based expectations to GDP growth. By combining the main SR-generated indicators, we generate estimates of the evolution of GDP. Finally, we analyse the effect of the crisis on the formation of expectations, and we find an improvement in the capacity of agents’ expectations to anticipate economic growth after the crisis in all countries except Germany.     

Analysis of marginally specified semi-nonparametric models for clustered binary data

Generalized linear mixed models are widely used for analyzing clustered data. If the primary interest is in regression parameters, one can proceed alternatively, through the marginal mean model approach. In the present study, a joint model consisting of a marginal mean model and a cluster-specific conditional mean model is considered. This model is useful when both time-independent and time-dependent covariates are available. Furthermore our model is semi-parametric, as we assume a flexible, smooth semi-nonparametric density of the cluster-specific effects. This semi-nonparametric density-based approach outperforms the approach based on normality assumption with respect to some important features of 'between-cluster variation'. We employ a full likelihood-based approach and apply the Monte Carlo EM algorithm to analyze the model. A simulation study is carried out to demonstrate the consistency of the approach. Finally, we apply this to a study of long-term illness data.     

An effective step-down algorithm for the construction and the identification of nonisomorphic orthogonal arrays

In this paper we present an effective algorithm for the construction and the identification of two-level nonisomorphic orthogonal arrays. Using this algorithm, we identify and list a full catalogue of nonisomorphic orthogonal arrays with parameters OA(24,7,2,t), OA(28,6,2,t) and OA(32,6,2,t), t ≥ 2. Some statistical properties of these designs are also considered.     

Generalized linear mixed models with informative dropouts and missing covariates

Generalized linear mixed models (GLMM) are useful in many longitudinal data analyses. In the presence of informative dropouts and missing covariates, however, standard complete-data methods may not be applicable. In this article, we consider a likelihood method and an approximate method for GLMM with informative dropouts and missing covariates. The methods are implemented by Monte–Carlo EM algorithms combined with Gibbs sampler. The approximate method may lead to inconsistent estimators but is computationally more efficient than the likelihood method. The two methods are evaluated via a simulation study for longitudinal binary data, and appear to perform reasonably well. A dataset on mental distress is analyzed in details.     

On Minimally-supported <Emphasis Type="Italic">D</Emphasis>-optimal Designs for Polynomial Regression with Log-concave Weight Function

This paper studies minimally-supported D-optimal designs for polynomial regression model with logarithmically concave (log-concave) weight functions. Many commonly used weight functions in the design literature are log-concave. For example, and exp(−x ²) in Theorem 2.3.2 of Fedorov (Theory of optimal experiments, 1972) are all log-concave. We show that the determinant of information matrix of minimally-supported design is a log-concave function of ordered support points and the D-optimal design is unique. Therefore, the numerically D-optimal designs can be constructed efficiently by cyclic exchange algorithm.     

18-run nonisomorphic three level orthogonal arrays

In this paper we construct all possible orthogonal arrays OA(18,q, 3,2) with 18 runs and 3 ≤ q ≤ 7 columns and present those that are nonisomorphic. A discussion on the novelty and the superiority of many of the designs found in terms of isomorphism and generalized minimum aberration has been made.