A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely no...A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.展开更多
With an aim at the job-shop scheduling problem of multiple resource constraints, this paper presents mixed self-adapting Genetic Algorithm （ GA ） , and establishes a job-shop optimal scheduling model of multiple res...With an aim at the job-shop scheduling problem of multiple resource constraints, this paper presents mixed self-adapting Genetic Algorithm （ GA ） , and establishes a job-shop optimal scheduling model of multiple resource constraints based on the effect of priority scheduling rules in the heuristic algorithm upon the scheduling target. New coding regulations or rules are designed. The sinusoidal function is adopted as the self-adapting factor, thus making cross probability and variable probability automatically change with group adaptability in such a way as to overcome the shortcoming in the heuristic algorithm and common GA, so that the operation efficiency is improved. The results from real example simulation and comparison with other algorithms indicate that the mixed self-adapting GA algorithm can well solve the job-shop optimal scheduling problem under the constraints of various kinds of production resources such as machine-tools and cutting tools.展开更多
Due to the fact that conventional heuristic attribute reduction algorithms are poor in running efficiency and difficult in accomplishing the co-evolutionary reduction mechanism in the decision table, an adaptive multi...Due to the fact that conventional heuristic attribute reduction algorithms are poor in running efficiency and difficult in accomplishing the co-evolutionary reduction mechanism in the decision table, an adaptive multicascade attribute reduction algorithm based on quantum-inspired mixed co-evolution is proposed. First, a novel and efficient self- adaptive quantum rotation angle strategy is designed to direct the participating populations to mutual adaptive evolution and to accelerate convergence speed. Then, a multicascade model of cooperative and competitive mixed co-evolution is adopted to decompose the evolutionary attribute species into subpopulations according to their historical performance records, which can increase the diversity of subpopulations and select some elitist individuals so as to strengthen the sharing ability of their searching experience. So the global optimization reduction set can be obtained quickly. The experimental results show that, compared with the existing algorithms, the proposed algorithm can achieve a higher performance for attribute reduction, and it can be considered as a more competitive heuristic algorithm on the efficiency and accuracy of minimum attribute reduction.展开更多
软基水闸底板脱空是水闸在长期服役期间受水流侵蚀等环境因素影响所产生的一种危害极大且难以察觉的病害。由于其病害部位于水下,传统方法难以检测,该研究提出一种基于高斯过程回归(Gaussian process regression,GPR)代理模型和遗传-自...软基水闸底板脱空是水闸在长期服役期间受水流侵蚀等环境因素影响所产生的一种危害极大且难以察觉的病害。由于其病害部位于水下,传统方法难以检测,该研究提出一种基于高斯过程回归(Gaussian process regression,GPR)代理模型和遗传-自适应惯性权重粒子群(genetic algorithm-adaptive particle swarm optimization,GA-APSO)混合优化算法的水闸底板脱空动力学反演方法,用于检测软基水闸底板脱空。首先,构建表征软基水闸底板脱空参数和水闸结构模态参数之间非线性关系的GPR代理模型;其次,基于GPR代理模型与水闸实测模态参数建立脱空反演的最优化数学模型,将反演问题转化为目标函数最优化求解问题;最后,为提高算法寻优计算的精度,提出一种GA-APSO混合优化算法对目标函数进行脱空反演计算,并提出一种更合理判断反演脱空区域面积和实际脱空区域面积相对误差的指标—面积不重合度。为验证所提方法性能,以一室内软基水闸物理模型为例,对两种不同脱空工况开展研究分析,结果表明,反演脱空区域面积和模型实际设置脱空区域面积的相对误差分别为8.47%和10.77%,相对误差值较小,证明所提方法能有效反演出水闸底板脱空情况,可成为软基水闸底板脱空反演检测的一种新方法。展开更多
针对火电机组SO_(2)排放质量浓度的影响因素众多,难以准确预测的问题,提出一种改进向量加权平均(weighted mean of vectors,INFO)算法与双向长短期记忆(bi-directional long short term memory,Bi-LSTM)神经网络相结合的预测模型(改进IN...针对火电机组SO_(2)排放质量浓度的影响因素众多,难以准确预测的问题,提出一种改进向量加权平均(weighted mean of vectors,INFO)算法与双向长短期记忆(bi-directional long short term memory,Bi-LSTM)神经网络相结合的预测模型(改进INFO-Bi-LSTM模型)。采用Circle混沌映射和反向学习产生高质量初始化种群,引入自适应t分布提升INFO算法跳出局部最优解和全局搜索的能力。选取改进INFO-Bi-LSTM模型和多种预测模型对炉内外联合脱硫过程中4种典型工况下的SO_(2)排放质量浓度进行预测,将预测结果进行验证对比。结果表明:改进INFO算法的寻优能力得到提升,并且改进INFO-Bi-LSTM模型精度更高,更加适用于SO_(2)排放质量浓度的预测,可为变工况下的脱硫控制提供控制理论支撑。展开更多
基金supported by the National Natural Science Foundation of China (7060103570801062)
文摘A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.
基金This paper is supported by Shaanxi Natural Science Foundation of China under Grant No2004E202
文摘With an aim at the job-shop scheduling problem of multiple resource constraints, this paper presents mixed self-adapting Genetic Algorithm （ GA ） , and establishes a job-shop optimal scheduling model of multiple resource constraints based on the effect of priority scheduling rules in the heuristic algorithm upon the scheduling target. New coding regulations or rules are designed. The sinusoidal function is adopted as the self-adapting factor, thus making cross probability and variable probability automatically change with group adaptability in such a way as to overcome the shortcoming in the heuristic algorithm and common GA, so that the operation efficiency is improved. The results from real example simulation and comparison with other algorithms indicate that the mixed self-adapting GA algorithm can well solve the job-shop optimal scheduling problem under the constraints of various kinds of production resources such as machine-tools and cutting tools.
基金The National Natural Science Foundation of China(No. 61139002,61171132)the Funding of Jiangsu Innovation Program for Graduate Education (No. CXZZ11_0219 )+2 种基金the Natural Science Foundation of Jiangsu Province (No. BK2010280)the Open Project of Jiangsu Provincial Key Laboratory of Computer Information Processing Technology (No. KJS1023)the Applying Study Foundation of Nantong(No. BK2011062)
文摘Due to the fact that conventional heuristic attribute reduction algorithms are poor in running efficiency and difficult in accomplishing the co-evolutionary reduction mechanism in the decision table, an adaptive multicascade attribute reduction algorithm based on quantum-inspired mixed co-evolution is proposed. First, a novel and efficient self- adaptive quantum rotation angle strategy is designed to direct the participating populations to mutual adaptive evolution and to accelerate convergence speed. Then, a multicascade model of cooperative and competitive mixed co-evolution is adopted to decompose the evolutionary attribute species into subpopulations according to their historical performance records, which can increase the diversity of subpopulations and select some elitist individuals so as to strengthen the sharing ability of their searching experience. So the global optimization reduction set can be obtained quickly. The experimental results show that, compared with the existing algorithms, the proposed algorithm can achieve a higher performance for attribute reduction, and it can be considered as a more competitive heuristic algorithm on the efficiency and accuracy of minimum attribute reduction.
文摘针对火电机组SO_(2)排放质量浓度的影响因素众多,难以准确预测的问题,提出一种改进向量加权平均(weighted mean of vectors,INFO)算法与双向长短期记忆(bi-directional long short term memory,Bi-LSTM)神经网络相结合的预测模型(改进INFO-Bi-LSTM模型)。采用Circle混沌映射和反向学习产生高质量初始化种群,引入自适应t分布提升INFO算法跳出局部最优解和全局搜索的能力。选取改进INFO-Bi-LSTM模型和多种预测模型对炉内外联合脱硫过程中4种典型工况下的SO_(2)排放质量浓度进行预测,将预测结果进行验证对比。结果表明:改进INFO算法的寻优能力得到提升,并且改进INFO-Bi-LSTM模型精度更高,更加适用于SO_(2)排放质量浓度的预测,可为变工况下的脱硫控制提供控制理论支撑。
