This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in boa...This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum.展开更多
In the paper, a new selection probability inspired by artificial bee colony algorithm is introduced into standard particle swarm optimization by improving the global extremum updating condition to enhance the capabili...In the paper, a new selection probability inspired by artificial bee colony algorithm is introduced into standard particle swarm optimization by improving the global extremum updating condition to enhance the capability of its overall situation search. The experiment result shows that the new scheme is more valuable and effective than other schemes in the convergence of codebook design and the performance of codebook, and it can avoid the premature phenomenon of the particles.展开更多
Since the logarithmic form of Shannon entropy has the drawback of undefined value at zero points,and most existing threshold selection methods only depend on the probability information,ignoring the within-class unifo...Since the logarithmic form of Shannon entropy has the drawback of undefined value at zero points,and most existing threshold selection methods only depend on the probability information,ignoring the within-class uniformity of gray level,a method of reciprocal gray entropy threshold selection is proposed based on two-dimensional(2-D)histogram region oblique division and artificial bee colony(ABC)optimization.Firstly,the definition of reciprocal gray entropy is introduced.Then on the basis of one-dimensional(1-D)method,2-D threshold selection criterion function based on reciprocal gray entropy with histogram oblique division is derived.To accelerate the progress of searching the optimal threshold,the recently proposed ABC optimization algorithm is adopted.The proposed method not only avoids the undefined value points in Shannon entropy,but also achieves high accuracy and anti-noise performance due to reasonable 2-D histogram region division and the consideration of within-class uniformity of gray level.A large number of experimental results show that,compared with the maximum Shannon entropy method with 2-D histogram oblique division and the reciprocal entropy method with 2-D histogram oblique division based on niche chaotic mutation particle swarm optimization(NCPSO),the proposed method can achieve better segmentation results and can satisfy the requirement of real-time processing.展开更多
To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damagin...To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.展开更多
Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Arti...Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Artificial Bee Colony Algorithm(CMABC) is proposed to achieve the optimal solution services in an acceptable time and high accuracy. Firstly, web service instantiation model was established. What is more, to overcome the problem of discrete and chaotic solution space, the global optimal solution was used to accelerate convergence rate by imitating the cross operation of Genetic algorithm(GA). The simulation experiment result shows that CMABC exhibited faster convergence speed and better convergence accuracy than some other intelligent optimization algorithms.展开更多
The fault diagnosis model for FMS based on multi layer feedforward neural networks was discussed An improved BP algorithm,the tactic of initial value selection based on genetic algorithm and the method of network st...The fault diagnosis model for FMS based on multi layer feedforward neural networks was discussed An improved BP algorithm,the tactic of initial value selection based on genetic algorithm and the method of network structure optimization were presented for training this model ANN(artificial neural network)fault diagnosis model for the robot in FMS was made by the new algorithm The result is superior to the rtaditional algorithm展开更多
计算密集型任务数量的增加导致智能移动设备(Smart Mobile Devices,SMD)计算任务过载,借助MEC(Mobile Edge Computing Servers)及利用网络中空闲边缘设备(Edge Devices,ED)可使计算能力受限的SMD将计算任务卸载到MEC和ED协作中,并基于...计算密集型任务数量的增加导致智能移动设备(Smart Mobile Devices,SMD)计算任务过载,借助MEC(Mobile Edge Computing Servers)及利用网络中空闲边缘设备(Edge Devices,ED)可使计算能力受限的SMD将计算任务卸载到MEC和ED协作中,并基于委托信誉证明(Delegated Proof of Reputation,DPoR)共识机制增强系统的安全性。文中提出一种基于鸟群人工鱼群算法(Bird Swarm-Artificial Fish Swarm Algorithm,BS-AFSA)的区块链移动边缘计算卸载模型,将任务卸载问题转化为优化目标函数来降低计算开销。采用改进鸟群人工鱼群算法来优化任务时延和能量消耗,对算法中的行为参数进行针对性构造,并改进拥挤度因子来提高后期迭代中寻优的局部搜索精度。仿真结果表明,与其他基准算法相比,文中所提算法减少了陷入局部最优的可能性,并降低了联合卸载方案的系统总开销。展开更多
基金This paper is supported by the Nature Science Foundation of Heilongjiang Province.
文摘This paper introduced the Genetic Algorithms (GAs) and Artificial Neural Networks (ANNs), which have been widely used in optimization of allocating. The combination way of the two optimizing algorithms was used in board allocating of furniture production. In the experiment, the rectangular flake board of 3650 mm 1850 mm was used as raw material to allocate 100 sets of Table Bucked. The utilizing rate of the board reached 94.14 % and the calculating time was only 35 s. The experiment result proofed that the method by using the GA for optimizing the weights of the ANN can raise the utilizing rate of the board and can shorten the time of the design. At the same time, this method can simultaneously searched in many directions, thus greatly in-creasing the probability of finding a global optimum.
基金Sponsored by the Qing Lan Project of Jiangsu Province
文摘In the paper, a new selection probability inspired by artificial bee colony algorithm is introduced into standard particle swarm optimization by improving the global extremum updating condition to enhance the capability of its overall situation search. The experiment result shows that the new scheme is more valuable and effective than other schemes in the convergence of codebook design and the performance of codebook, and it can avoid the premature phenomenon of the particles.
基金Supported by the CRSRI Open Research Program(CKWV2013225/KY)the Priority Academic Program Development of Jiangsu Higher Education Institution+2 种基金the Open Project Foundation of Key Laboratory of the Yellow River Sediment of Ministry of Water Resource(2014006)the State Key Lab of Urban Water Resource and Environment(HIT)(ES201409)the Open Project Program of State Key Laboratory of Food Science and Technology,Jiangnan University(SKLF-KF-201310)
文摘Since the logarithmic form of Shannon entropy has the drawback of undefined value at zero points,and most existing threshold selection methods only depend on the probability information,ignoring the within-class uniformity of gray level,a method of reciprocal gray entropy threshold selection is proposed based on two-dimensional(2-D)histogram region oblique division and artificial bee colony(ABC)optimization.Firstly,the definition of reciprocal gray entropy is introduced.Then on the basis of one-dimensional(1-D)method,2-D threshold selection criterion function based on reciprocal gray entropy with histogram oblique division is derived.To accelerate the progress of searching the optimal threshold,the recently proposed ABC optimization algorithm is adopted.The proposed method not only avoids the undefined value points in Shannon entropy,but also achieves high accuracy and anti-noise performance due to reasonable 2-D histogram region division and the consideration of within-class uniformity of gray level.A large number of experimental results show that,compared with the maximum Shannon entropy method with 2-D histogram oblique division and the reciprocal entropy method with 2-D histogram oblique division based on niche chaotic mutation particle swarm optimization(NCPSO),the proposed method can achieve better segmentation results and can satisfy the requirement of real-time processing.
基金Sponsored by Beijing Priority Laboratory Fund of China(SYS10070522)
文摘To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.
基金supported by a grant from the Project "Multifunctional mobile phone R & D and industrialization of the Internet of things" supported by the Project of the Provincial Department of research (2011A090200008)partly supported by National Science and Technology Major Project (No. 2010ZX07102-006)+3 种基金the National Basic Research Program of China (973 Program) (No. 2011CB505402)the Major Program of the National Natural Science Foundation of China (No. 61170117)the National Natural Science Foundation of China (No.61432004)the National Key Research and Development Program (No.2016YFB1001404)
文摘Internet of things(IoT) imposes new challenges on service composition as it is difficult to manage a quick instantiation of a complex services from a growing number of dynamic candidate services. A cross-modified Artificial Bee Colony Algorithm(CMABC) is proposed to achieve the optimal solution services in an acceptable time and high accuracy. Firstly, web service instantiation model was established. What is more, to overcome the problem of discrete and chaotic solution space, the global optimal solution was used to accelerate convergence rate by imitating the cross operation of Genetic algorithm(GA). The simulation experiment result shows that CMABC exhibited faster convergence speed and better convergence accuracy than some other intelligent optimization algorithms.
文摘The fault diagnosis model for FMS based on multi layer feedforward neural networks was discussed An improved BP algorithm,the tactic of initial value selection based on genetic algorithm and the method of network structure optimization were presented for training this model ANN(artificial neural network)fault diagnosis model for the robot in FMS was made by the new algorithm The result is superior to the rtaditional algorithm
文摘广泛应用于经典NP难问题即旅行商问题(Traveling Salesman Problem,TSP)的蚁群优化(Ant Colony Optimization,ACO)算法存在容易陷入局部最优、收敛速度慢等问题,但其采用正反馈机制并具备较强的鲁棒性,适合与其他算法相融合从而改进优化。基于此,引入人工蜂群的分级思想,提出了一种多级蚁态的蚁群改进(Multistage State Ant Colony Optimization,MSACO)算法。通过引入适应度算子将传统单蚁态蚁群划分为王蚁、被雇佣蚁和非雇佣蚁,并且在每次迭代后重新分配身份以动态维持多级蚁态。王蚁寻找最优路径即最优食物源,被雇佣蚁负责路径构建,非雇佣蚁进行局部优化。为了使非雇佣蚁更有效地获得优质解,提出了一种固定邻域优化算法。实验结果表明,在TSPLIB库的7个数据集中,MSACO均可以达到理论最优解程度,较其他改进算法的最优解迭代次数与运行时间可以减少约40%与50%。
文摘计算密集型任务数量的增加导致智能移动设备(Smart Mobile Devices,SMD)计算任务过载,借助MEC(Mobile Edge Computing Servers)及利用网络中空闲边缘设备(Edge Devices,ED)可使计算能力受限的SMD将计算任务卸载到MEC和ED协作中,并基于委托信誉证明(Delegated Proof of Reputation,DPoR)共识机制增强系统的安全性。文中提出一种基于鸟群人工鱼群算法(Bird Swarm-Artificial Fish Swarm Algorithm,BS-AFSA)的区块链移动边缘计算卸载模型,将任务卸载问题转化为优化目标函数来降低计算开销。采用改进鸟群人工鱼群算法来优化任务时延和能量消耗,对算法中的行为参数进行针对性构造,并改进拥挤度因子来提高后期迭代中寻优的局部搜索精度。仿真结果表明,与其他基准算法相比,文中所提算法减少了陷入局部最优的可能性,并降低了联合卸载方案的系统总开销。