A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The f...A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.展开更多
Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be imp...Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.展开更多
针对电力负荷数据的非线性和不稳定性问题,提出了一种基于经验模态分解改进麻雀搜索算法双向长短期记忆神经网络相结合的EMD ISSA BiLSTM预测模型。首先采用EMD处理非线性负荷数据,将原始负荷数据分解为多个不同尺度的本征模态函数(IMF)...针对电力负荷数据的非线性和不稳定性问题,提出了一种基于经验模态分解改进麻雀搜索算法双向长短期记忆神经网络相结合的EMD ISSA BiLSTM预测模型。首先采用EMD处理非线性负荷数据,将原始负荷数据分解为多个不同尺度的本征模态函数(IMF),引入反向学习策略和Levy飞行策略分别改进麻雀搜索算法(SSA)的收敛速度慢和容易陷入局部最优问题,利用改进麻雀搜索算法(ISSA)对BiLSTM神经网络进行参数寻优。然后再利用优化后的BiLSTM模型对每个分量进行预测,并将各预测结果叠加组合,得到整个负荷序列的预测结果。最后通过实际算例分析,证明该方法相对于传统的预测方法具有更好的预测精度和稳定性,可作为一种有效的短期负荷预测方法。展开更多
为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预...为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预测方法。该方法利用CEEMDAN处理涌水量数据,构建麻雀搜索算法(SSA)优化的长短期记忆网络(LSTM)和自回归移动平均模型(ARIMA)并行级联而成的混合时间序列模型对工作面涌水量进行预测。研究结果表明:该模型预测结果与真实数据相差更小,平均绝对误差为6.36 m 3/h,均方根误差为10.6 m 3/h,模型拟合系数为0.95,更适用于工作面涌水量预测。研究结果可为矿井工作面涌水量预测及防控提供参考。展开更多
基金supported by the National Natural Science Foundation of China(71171038)
文摘A memetic algorithm （MA） for a multi-mode resourceconstrained project scheduling problem （MRCPSP） is proposed. We use a new fitness function and two very effective local search procedures in the proposed MA. The fitness function makes use of a mechanism called ＂strategic oscillation＂ to make the search process have a higher probability to visit solutions around a ＂feasible boundary＂. One of the local search procedures aims at improving the lower bound of project makespan to be less than a known upper bound, and another aims at improving a solution of an MRCPSP instance accepting infeasible solutions based on the new fitness function in the search process. A detailed computational experiment is set up using instances from the problem instance library PSPLIB. Computational results show that the proposed MA is very competitive with the state-of-the-art algorithms. The MA obtains improved solutions for one instance of set J30.
基金supported by National Science Council under Grant No.101-2221-E-029-020-MY3
文摘Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward （AF） mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.
文摘针对电力负荷数据的非线性和不稳定性问题,提出了一种基于经验模态分解改进麻雀搜索算法双向长短期记忆神经网络相结合的EMD ISSA BiLSTM预测模型。首先采用EMD处理非线性负荷数据,将原始负荷数据分解为多个不同尺度的本征模态函数(IMF),引入反向学习策略和Levy飞行策略分别改进麻雀搜索算法(SSA)的收敛速度慢和容易陷入局部最优问题,利用改进麻雀搜索算法(ISSA)对BiLSTM神经网络进行参数寻优。然后再利用优化后的BiLSTM模型对每个分量进行预测,并将各预测结果叠加组合,得到整个负荷序列的预测结果。最后通过实际算例分析,证明该方法相对于传统的预测方法具有更好的预测精度和稳定性,可作为一种有效的短期负荷预测方法。
文摘为提高采煤工作面涌水量预测准确度,收集大量工作面涌水量观测数据进行整理、统计、分析,将涌水量稳定性、周期性和季节性特征考虑在内,提出1种基于数据驱动的完全自适应模态分解算法(CEEMDAN)和改进的混合时间序列模型工作面涌水量预测方法。该方法利用CEEMDAN处理涌水量数据,构建麻雀搜索算法(SSA)优化的长短期记忆网络(LSTM)和自回归移动平均模型(ARIMA)并行级联而成的混合时间序列模型对工作面涌水量进行预测。研究结果表明:该模型预测结果与真实数据相差更小,平均绝对误差为6.36 m 3/h,均方根误差为10.6 m 3/h,模型拟合系数为0.95,更适用于工作面涌水量预测。研究结果可为矿井工作面涌水量预测及防控提供参考。
