部分线性模型在贵州省公路货运量预测中的应用

运用部分线性模型对贵州省公路货运量进行预测研究.首先运用灰色关联度分析法确定影响贵州省公路货运量的主要影响因子;然后运用主成分分析法将选取的影响因子指标数据进行降维处理,通过分析处理后的数据得到部分线性模型;最后,以2010-2012年的公路货运量作为验证值,将部分线性模型、多元线性回归模型及灰色预测模型的预测结果进行比较.研究结果表明:部分线性模型能较好地拟合贵州省1990-2009年公路货运量;三种模型的预测结果显示,部分线性模型预测结果优于多元线性回归模型和灰色预测模型的预测结果.     

最优组合预测线性模型在旅游需求预测中的应用——以中国大陆赴澳门游客量预测为例

研究运用ARIMA、多元线性回归(MRL)、ADL_EC和VEC四种单一模型对中国大陆赴澳门游客量进行预测,运用等权组合、简单加权组合和熵值加权组合三种非最优组合预测及最优组合预测线性模型对单一模型预测结果进行优化,用平均绝对百分比误差(MAPE)和希尔不等系数(TIC)对优化结果进行评价与比较,确定最优组合预测线性模型是比较切合澳门入境旅游实际的预测模型,并运用其进行预测,达到了预期效果.     

回归分析在殷墟墓葬分期中的应用

数理统计方法，在我国考古学中的应用，目前处于探索、研究阶段。本文试用回归方法，建立殷墟墓葬分期的多元线性回归模型，并确定出墓葬分期的预测区间。     

多元线性回归模型参数估计的递推算法及误差分析

讨论新增数据信息对多元线性回归模型的修正原理,给出不断加入新增数据信息的多元线性回归模型参数估计值的一种递推算法.利用影响因子的概念来刻画新增信息对预测误差的影响,并给出了算法和应用实例.     

我国上市公司被特别处理的组合预测模型研究

针对组合预测比单项预测具有更高的预测精度，本提出了一种基于模糊神经网络的上市公司被ST的非线性组合建模与预测新方法，并给出了相应的混合学习算法。通过与多元线性回归模型、Fisher模型和Logistc回归模型的预测结果对比表明，该方法具有预测精度高，学习与泛化能力强，适应性广的优点。     

基于反馈回归法的用电量预测模型研究

多元线性回归法是用电量预测中常用的一种方法,带反馈的多元线性回归法是一种改进的回归方法,具有更高的精度.本文在此基础上进行了多次反馈,即利用带多次反馈的多元线性回归法,结合SPSS软件进行统计分析,并以陕西省用电量为例探究分析多次反馈的多元线性回归法在用电量预测中的应用,从而得到更精准的用电量预测模型.最后以四川省的用电量数据对模型进行了验证,体现出了该模型的优越之处.     

一类不分明时间序列的回归预测

研究了一类不分明时间序列的线性回归预测问题,通过模糊数空间中的距离,建立了模糊环境中最小二乘回归模型,证明了回归模型解的存在性和唯一性,并给出了确定模型的模糊参数及检验模型拟合度的计算公式。     

基于灰色系统理论的多元线性回归分析

运用灰色系统理论剔除了自变量观察数据中的噪声污染,对传统的多元线性回归分析方法进行了改进,建立了灰色多元线性回归分析模型.将模型应用于陕西省就业问题的研究,取得了满意的预测效果.     

基于灰色系统和BP神经网络的股指动态预测

针对股价指数特有的波动性,提出了基于灰色残差模型和BP神经网络的股指动态预测方法,并运用多元线性回归模型对两种动态预测结果进行拟合.同时,随机抽取部分上证指数和道琼斯指数的实证研究表明:动态预测模型能及时调整新数据对后续预测的影响,获得了较高的预测精度.     

PLSR模型的回归效果分析

本文简单地介绍了多元线性回归、主元回归、部分最小二乘回归模型 ,用实例对三种方法的回归性能进行比较 ,并指出在消除多重共线性、回归系数估计精度及预测精度等方面 ,部分最小二乘回归模型优于其它两种模型     

基于分解—集成的铁路货运需求预测研究

铁路货运量受到多种因素影响,准确的预测可以为铁路行业未来规划的编制提供重要的参考依据,也可以使铁路部门制定符合当前货运市场的运输政策。货运量数据具有非线性、不平稳的特点,利用传统的单一预测模型进行预测,很难描述整体特征,预测精度有待提高。本文基于分解—集成的原则,利用变分模态分解算法将货运量分解为高频和低频模态,针对各模态特点,分别建立预测模型,将得到的预测结果加总起来作为最终货运量的预测值。实证表明,分解—集成预测方法与传统的单一预测模型相比,提高了预测的准确率,可以很好地应用在铁路货运量需求预测的研究中。     

基于灰色关联分析的支持向量机的铁路货运量预测研究

采用基于灰色关联分析的支持向量机对铁路货运量进行预测.首先利用灰色关联分析法对影响铁路货运量的因素进行分析处理,然后利用基于高斯核函数的支持向量回归机建立了铁路货运量预测模型.通过分析预测结果可以发现,经过灰色关联分析后的支持向量机模型对复杂的铁路货运量数据有较好地处理能力,且预测相对误差较小.特别地,由于支持向量机的适应性,该模型具有较高的泛化能力,对影响因素较为复杂,样本数量小的预测问题可以提供一定参考.     

A general system theory approach to rail freight car fleet sizing

The transportation of goods from shippers to consignees is a railroad's major activity. Rail freight cars are enormously expensive and a rail vehicle fleet represents one of the largest capital resources of most railroads. Resource allocation to rail freight cars is an extraordinary complex managerial problem. This paper describes the determination of an optimal number of rail freight cars so as to satisfy the demand, on one hand, and minimize the total cost, on the other. A new mathematical model relying on optimal control theory is developed. The problem is formulated as the problem of finding an optimal regulator for a linear system, excited by Gaussian white noise, a quadratic performance index, and random initial conditions. The model has been tested on numerical examples.     

A note on issues of over-conservatism in robust optimization with cost uncertainty

We identify and discuss issues of hidden over-conservatism in robust linear optimization, when the uncertainty set is polyhedral with a budget of uncertainty constraint. The decision-maker selects the budget of uncertainty to reflect his degree of risk aversion, i.e. the maximum number of uncertain parameters that can take their worst-case value. In the first setting, the cost coefficients of the linear programming problem are uncertain, as is the case in portfolio management with random stock returns. We provide an example where, for moderate values of the budget, the optimal solution becomes independent of the nominal values of the parameters, i.e. is completely disconnected from its nominal counterpart, and discuss why this happens. The second setting focusses on linear optimization with uncertain upper bounds on the decision variables, which has applications in revenue management with uncertain demand and can be rewritten as a piecewise linear problem with cost uncertainty. We show in an example that it is possible to have more demand parameters equal their worst-case value than what is allowed by the budget of uncertainty, although the robust formulation is correct. We explain this apparent paradox.     

On the average performance of the adjustable RO and its use as an offline tool for multi-period production planning under uncertainty

Robust optimization (RO) is a distribution-free worst-case solution methodology designed for uncertain maximization problems via a max-min approach considering a bounded uncertainty set. It yields a feasible solution over this set with a guaranteed worst-case value. As opposed to a previous conception that RO is conservative based on optimal value analysis, we argue that in practice the uncertain parameters rarely take simultaneously the values of the worst-case scenario, and thus introduce a new performance measure based on simulated average values. To this end, we apply the adjustable RO (AARC) to a single new product multi-period production planning problem under an uncertain and bounded demand so as to maximize the total profit. The demand for the product is assumed to follow a typical life-cycle pattern, whose length is typically hard to anticipate. We suggest a novel approach to predict the production plan’s profitable cycle length, already at the outset of the planning horizon. The AARC is an offline method that is employed online and adjusted to past realizations of the demand by a linear decision rule (LDR). We compare it to an alternative offline method, aiming at maximum expected profit, applying the same LDR. Although the AARC maximizes the profit against a worst-case demand scenario, our empirical results show that the average performance of both methods is very similar. Further, AARC consistently guarantees a worst profit over the entire uncertainty set, and its model’s size is considerably smaller and thus exhibit superior performance.     

Confidence prediction of the mean values of multiple observations

The confidence prediction of the mean value ofmultiple responses in a linear multivariate normal regression model is considered. In order to solve it, confidence intervals of the mean value of multiple responses and its predicted value are obtained. They are numerically modeled and analyzed in comparison with known analogues for regression and individual response.     

基于errors-in-variables的预测模型及其应用

预测是统计学实际应用的一个主要方面,多元线性回归预测是一种很好的方法,广泛地应用在各种实际领域,但其局限性及不足也是明显的。本文以一种新的观点认识数据,即认为变量的观测里均含有误差,同时认为不应删除经慎重选择进来的解释变量。为此,本文提出了一种新的多元预测方法———多元线性EIV预测。本文还考虑了新预测模型的一个实例应用,并从相对偏差上与多元回归预测进行了比较,从而揭示了多元线性EIV预测的先进性及较好的预测精度。     

A multivariate adaptive regression splines cutting plane approach for solving a two-stage stochastic programming fleet assignment model

The fleet assignment model assigns a fleet of aircraft types to the scheduled flight legs in an airline timetable published six to twelve weeks prior to the departure of the aircraft. The objective is to maximize profit. While costs associated with assigning a particular fleet type to a leg are easy to estimate, the revenues are based upon demand, which is realized close to departure. The uncertainty in demand makes it challenging to assign the right type of aircraft to each flight leg based on forecasts taken six to twelve weeks prior to departure. Therefore, in this paper, a two-stage stochastic programming framework has been developed to model the uncertainty in demand, along with the Boeing concept of demand driven dispatch to reallocate aircraft closer to the departure of the aircraft. Traditionally, two-stage stochastic programming problems are solved using the L-shaped method. Due to the slow convergence of the L-shaped method, a novel multivariate adaptive regression splines cutting plane method has been developed. The results obtained from our approach are compared to that of the L-shaped method, and the value of demand-driven dispatch is estimated.     

Service network design for freight railway transportation: the Italian case

In this paper, we present a case study on freight railway transportation in Italy, which is a by-product of research collaboration with a major Italian railway company. We highlight the main features of the Italian reality and propose a customized mathematical model to design the service network, that is, the set of origin-destination connections. More specifically, the model suggests the services to provide, the number of trains travelling on each connection, the number of cars and their type. We consider both full and empty freight car movements and take handling costs into account. All decisions are taken in order to minimize the total costs. The quality of service is guaranteed by satisfying all the transportation demand and by implicitly minimizing the waiting time of cars at intermediate railway stations. Our approach yields to a multi-commodity network design problem with a concave cost function. To solve this problem, we implement a specialized tabu search procedure. Computational results on realistic instances show a significant improvement over current practice.     

Stochastic air freight hub location and flight routes planning

This paper introduced a stochastic programming model to address the air freight hub location and flight routes planning under seasonal demand variations. Most existing approaches to airline network design problems are restricted to a deterministic environment. However, the demand in the air freight market usually varies seasonally. The model is separated into two decision stages. The first stage, which is the decision not affected by randomness, determines the number and the location of hubs. The second stage, which is the decision affected by randomness, determines the flight routes to transport flows from origins to destinations based upon the hub location and realized uncertain scenario. Finally, the real data based on the air freight market in Taiwan and China is used to test the proposed model.