Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems...Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems are susceptible to malicious eavesdropping attacks during the information transmission,and this issue has not been adequately addressed.In this paper,we propose a physical-layer secure fog computing IoT system model,which is able to improve the physical layer security of fog computing IoT networks against the malicious eavesdropping of multiple eavesdroppers.The secrecy rate of the proposed model is analyzed,and the quantum galaxy–based search algorithm(QGSA)is proposed to solve the hybrid task scheduling and resource management problem of the network.The computational complexity and convergence of the proposed algorithm are analyzed.Simulation results validate the efficiency of the proposed model and reveal the influence of various environmental parameters on fog computing IoT networks.Moreover,the simulation results demonstrate that the proposed hybrid task scheduling and resource management scheme can effectively enhance secrecy performance across different communication scenarios.展开更多
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.展开更多
In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy com...In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.展开更多
针对多目标工艺规划与车间调度集成问题(multi-objective integrated process planning and scheduling,MOIPPS),以最小化完工时间和生产能耗最低为优化目标,提出了一种考虑全局和局部最优的改进混合优化算法。通过分析集成系统工艺设...针对多目标工艺规划与车间调度集成问题(multi-objective integrated process planning and scheduling,MOIPPS),以最小化完工时间和生产能耗最低为优化目标,提出了一种考虑全局和局部最优的改进混合优化算法。通过分析集成系统工艺设计和生产调度两个问题的区别与联系,搭建了多目标问题模型和解决框架。针对两阶段集成问题提出混合优化算法,对工艺阶段采用全局搜索算法,为集成系统提供多种工艺加工方案,保证集成算法的全局搜索性能;针对调度阶段设计一种改进禁忌搜索算法,通过交叉与随机抽样扩大解的分布范围,使用邻域禁忌搜索使得算法快速收敛,并采用Pareto非支配排序获得全局最优解。实验对比分析,验证了所提算法在求解多目标工艺规划与车间调度集成问题的高效性和稳定性。展开更多
针对商用车车架制造商中纵梁以及总装的生产工艺的多样性和生产调度的复杂性,以最小化最大完工时间、物料积压程度和耗电量为优化目标,提出了一个NSGA-Ⅱ和红狐算法的混合算法(hybrid algorithm of non-dominant sorting genetic algori...针对商用车车架制造商中纵梁以及总装的生产工艺的多样性和生产调度的复杂性,以最小化最大完工时间、物料积压程度和耗电量为优化目标,提出了一个NSGA-Ⅱ和红狐算法的混合算法(hybrid algorithm of non-dominant sorting genetic algorithm and red fox algorithm,HNSGA2RFA),用于解决多目标的柔性流水车间调度问题。通过ROV规则实现GA和RFA的编码转换,并提出了归一化分组策略(normalized grouping strategy)。试验结果表明,HNSGA2RFA算法在优化速度和最优解集数量上均优于原NSGA-Ⅱ算法。展开更多
基金supported by the National Natural Science Foundation of China(61571149,62001139)the Initiation Fund for Postdoctoral Research in Heilongjiang Province(LBH-Q19098)the Natural Science Foundation of Heilongjiang Province(LH2020F0178).
文摘Fog computing has emerged as an important technology which can improve the performance of computation-intensive and latency-critical communication networks.Nevertheless,the fog computing Internet-of-Things(IoT)systems are susceptible to malicious eavesdropping attacks during the information transmission,and this issue has not been adequately addressed.In this paper,we propose a physical-layer secure fog computing IoT system model,which is able to improve the physical layer security of fog computing IoT networks against the malicious eavesdropping of multiple eavesdroppers.The secrecy rate of the proposed model is analyzed,and the quantum galaxy–based search algorithm(QGSA)is proposed to solve the hybrid task scheduling and resource management problem of the network.The computational complexity and convergence of the proposed algorithm are analyzed.Simulation results validate the efficiency of the proposed model and reveal the influence of various environmental parameters on fog computing IoT networks.Moreover,the simulation results demonstrate that the proposed hybrid task scheduling and resource management scheme can effectively enhance secrecy performance across different communication scenarios.
基金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.
文摘In this paper, a new implementation of genetic algorithms (GAs) is developed for the machine scheduling problem, which is abundant among the modern manufacturing systems. The performance measure of early and tardy completion of jobs is very natural as one's aim, which is usually to minimize simultaneously both earliness and tardiness of all jobs. As the problem is NP-hard and no effective algorithms exist, we propose a hybrid genetic algorithms approach to deal with it. We adjust the crossover and mutation probabilities by fuzzy logic controller whereas the hybrid genetic algorithm does not require preliminary experiments to determine probabilities for genetic operators. The experimental results show the effectiveness of the GAs method proposed in the paper.
文摘针对多目标工艺规划与车间调度集成问题(multi-objective integrated process planning and scheduling,MOIPPS),以最小化完工时间和生产能耗最低为优化目标,提出了一种考虑全局和局部最优的改进混合优化算法。通过分析集成系统工艺设计和生产调度两个问题的区别与联系,搭建了多目标问题模型和解决框架。针对两阶段集成问题提出混合优化算法,对工艺阶段采用全局搜索算法,为集成系统提供多种工艺加工方案,保证集成算法的全局搜索性能;针对调度阶段设计一种改进禁忌搜索算法,通过交叉与随机抽样扩大解的分布范围,使用邻域禁忌搜索使得算法快速收敛,并采用Pareto非支配排序获得全局最优解。实验对比分析,验证了所提算法在求解多目标工艺规划与车间调度集成问题的高效性和稳定性。
文摘针对商用车车架制造商中纵梁以及总装的生产工艺的多样性和生产调度的复杂性,以最小化最大完工时间、物料积压程度和耗电量为优化目标,提出了一个NSGA-Ⅱ和红狐算法的混合算法(hybrid algorithm of non-dominant sorting genetic algorithm and red fox algorithm,HNSGA2RFA),用于解决多目标的柔性流水车间调度问题。通过ROV规则实现GA和RFA的编码转换,并提出了归一化分组策略(normalized grouping strategy)。试验结果表明,HNSGA2RFA算法在优化速度和最优解集数量上均优于原NSGA-Ⅱ算法。
