Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of t...Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.展开更多
Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical app...Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing （GSA） is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.展开更多
A class of large-scale systems, where the overall objective function is a nonlinear function of performance index of each subsystem, is investigated in this paper. This type of large-scale control problem is non-separ...A class of large-scale systems, where the overall objective function is a nonlinear function of performance index of each subsystem, is investigated in this paper. This type of large-scale control problem is non-separable in the sense of conventional hierarchical control. Hierarchical control is extended in the paper to large-scale non-separable control problems, where multiobjective optimization is used as separation strategy. The large-scale non-separable control problem is embedded, under certain conditions, into a family of the weighted Lagrangian formulation. The weighted Lagrangian formulation is separable with respect to subsystems and can be effectively solved using the interaction balance approach at the two lower levels in the proposed three-level solution structure. At the third level, the weighting vector for the weighted Lagrangian formulation is adjusted iteratively to search the optimal weighting vector with which the optimal of the original large-scale non-separable control problem is obtained. Theoretical base of the algorithm is established. Simulation shows that the algorithm is effective.展开更多
为了提高超短期风电功率的预测精度,提出了一种基于COOT算法优化的变分模态分解(VMD)、分层主成分分析(hierarchical principal components analysis,HPCA)与门控循环单元神经网络(GRU)的组合预测模型。首先,利用能量差值法确定变分模...为了提高超短期风电功率的预测精度,提出了一种基于COOT算法优化的变分模态分解(VMD)、分层主成分分析(hierarchical principal components analysis,HPCA)与门控循环单元神经网络(GRU)的组合预测模型。首先,利用能量差值法确定变分模态分解子模态数,从而将具有强非线性的原始功率序列分解为一组相对平稳的子模态。其次,利用灰色关联度分析计算高维气象特征与功率序列的关联度值并进行排序分层,利用主成分分析提取各分层特征变量的第一主成分,实现对高维气象特征的降维。最后,引入COOT算法对门控循环单元预测模型的超参数进行优化,加速模型收敛速度,提高模型预测精度。对贵州某风电场的实测数据进行仿真分析,结果表明:相较于传统GRU模型的预测结果,所提方法的均方根误差、平均绝对误差、平均绝对百分误差分别下降了67.41%、72.25%、45.69%,且预测精度高于其他4种组合预测模型,有效提高了超短期风电功率预测精度。展开更多
基金Project(51178061)supported by the National Natural Science Foundation of ChinaProject(2010FJ6016)supported by Hunan Provincial Science and Technology,China+1 种基金Project(12C0015)supported by Scientific Research Fund of Hunan Provincial Education Department,ChinaProject(13JJ3072)supported by Hunan Provincial Natural Science Foundation of China
文摘Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.
基金supported by the National Natural Science Foundation of China (60879024)
文摘Recently the integrated modular avionics （IMA） architecture which introduces the concept of resource partitioning becomes popular as an alternative to the traditional federated architecture. A novel hierarchical approach is proposed to solve the resource allocation problem for IMA systems in distributed environments. Firstly, the worst case response time of tasks with arbitrary deadlines is analyzed for the two-level scheduler. Then, the hierarchical resource allocation approach is presented in two levels. At the platform level, a task assignment algorithm based on genetic simulated annealing （GSA） is proposed to assign a set of pre-defined tasks to different processing nodes in the form of task groups, so that resources can be allocated as partitions and mapped to task groups. While yielding to all the resource con- straints, the algorithm tries to find an optimal task assignment with minimized communication costs and balanced work load. At the node level, partition parameters are optimized, so that the computational resource can be allocated further. An example is shown to illustrate the hierarchal resource allocation approach and manifest the validity. Simulation results comparing the performance of the proposed GSA with that of traditional genetic algorithms are presented in the context of task assignment in IMA systems.
文摘A class of large-scale systems, where the overall objective function is a nonlinear function of performance index of each subsystem, is investigated in this paper. This type of large-scale control problem is non-separable in the sense of conventional hierarchical control. Hierarchical control is extended in the paper to large-scale non-separable control problems, where multiobjective optimization is used as separation strategy. The large-scale non-separable control problem is embedded, under certain conditions, into a family of the weighted Lagrangian formulation. The weighted Lagrangian formulation is separable with respect to subsystems and can be effectively solved using the interaction balance approach at the two lower levels in the proposed three-level solution structure. At the third level, the weighting vector for the weighted Lagrangian formulation is adjusted iteratively to search the optimal weighting vector with which the optimal of the original large-scale non-separable control problem is obtained. Theoretical base of the algorithm is established. Simulation shows that the algorithm is effective.
文摘为了提高超短期风电功率的预测精度,提出了一种基于COOT算法优化的变分模态分解(VMD)、分层主成分分析(hierarchical principal components analysis,HPCA)与门控循环单元神经网络(GRU)的组合预测模型。首先,利用能量差值法确定变分模态分解子模态数,从而将具有强非线性的原始功率序列分解为一组相对平稳的子模态。其次,利用灰色关联度分析计算高维气象特征与功率序列的关联度值并进行排序分层,利用主成分分析提取各分层特征变量的第一主成分,实现对高维气象特征的降维。最后,引入COOT算法对门控循环单元预测模型的超参数进行优化,加速模型收敛速度,提高模型预测精度。对贵州某风电场的实测数据进行仿真分析,结果表明:相较于传统GRU模型的预测结果,所提方法的均方根误差、平均绝对误差、平均绝对百分误差分别下降了67.41%、72.25%、45.69%,且预测精度高于其他4种组合预测模型,有效提高了超短期风电功率预测精度。
