The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this wor...The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.展开更多
针对传统粗糙集理论在属性约简中存在计算复杂度高、易陷入局部最优解等问题,结合差分教学优化算法的全局搜索能力和粗糙集在处理不精确和不确定数据方面的优势,提出融合差分教学优化的粗糙集属性约简算法(rough set attribute reductio...针对传统粗糙集理论在属性约简中存在计算复杂度高、易陷入局部最优解等问题,结合差分教学优化算法的全局搜索能力和粗糙集在处理不精确和不确定数据方面的优势,提出融合差分教学优化的粗糙集属性约简算法(rough set attribute reduction algorithm based on differential teaching-learning optimization, AR-DTLBO)。首先,引入自适应教学因子和差分变异策略对教学优化算法进行改进,提高算法的搜索能力和优化性能;其次,通过改进后的教学优化算法“教”和“学”两个阶段对属性约简过程进行优化,降低了数据集的维度和复杂性;最后,在UCI数据库中的8个数据集上将所提算法和其他六种算法进行对比实验。实验结果表明,该算法在约简长度、约简时间、约简率和分类精度上均取得了良好的效果,实现了对数据集的有效约简和优化,能够有效减少冗余信息并提高决策规则的准确性,为决策分析和数据挖掘等领域提供了有效支撑。展开更多
基金Projects(61573144,61773165,61673175,61174040)supported by the National Natural Science Foundation of ChinaProject(222201717006)supported by the Fundamental Research Funds for the Central Universities,China
文摘The hybrid flow shop scheduling problem with unrelated parallel machine is a typical NP-hard combinatorial optimization problem, and it exists widely in chemical, manufacturing and pharmaceutical industry. In this work, a novel mathematic model for the hybrid flow shop scheduling problem with unrelated parallel machine(HFSPUPM) was proposed. Additionally, an effective hybrid estimation of distribution algorithm was proposed to solve the HFSPUPM, taking advantage of the features in the mathematic model. In the optimization algorithm, a new individual representation method was adopted. The(EDA) structure was used for global search while the teaching learning based optimization(TLBO) strategy was used for local search. Based on the structure of the HFSPUPM, this work presents a series of discrete operations. Simulation results show the effectiveness of the proposed hybrid algorithm compared with other algorithms.
文摘针对传统粗糙集理论在属性约简中存在计算复杂度高、易陷入局部最优解等问题,结合差分教学优化算法的全局搜索能力和粗糙集在处理不精确和不确定数据方面的优势,提出融合差分教学优化的粗糙集属性约简算法(rough set attribute reduction algorithm based on differential teaching-learning optimization, AR-DTLBO)。首先,引入自适应教学因子和差分变异策略对教学优化算法进行改进,提高算法的搜索能力和优化性能;其次,通过改进后的教学优化算法“教”和“学”两个阶段对属性约简过程进行优化,降低了数据集的维度和复杂性;最后,在UCI数据库中的8个数据集上将所提算法和其他六种算法进行对比实验。实验结果表明,该算法在约简长度、约简时间、约简率和分类精度上均取得了良好的效果,实现了对数据集的有效约简和优化,能够有效减少冗余信息并提高决策规则的准确性,为决策分析和数据挖掘等领域提供了有效支撑。
