Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the chall...Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.展开更多
We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,th...We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,the rigid-flexible multi-body system of the UWG was simplified as a rigid system composed of“thruster+float body”,based on which a planar motion model of the UWG was established.Second,we obtained the model parameters using an empirical method combined with parameter identification,which means that some parameters were estimated by the empirical method.In view of the specificity and importance of the heading control,heading model parameters were identified through the artificial fish swarm algorithm based on tank test data,so that we could take full advantage of the limited trial data to factually describe the dynamic characteristics of the system.Based on the established heading motion model,parameters of the heading S-surface controller were optimized using the artificial fish swarm algorithm.Heading motion comparison and maritime control experiments of the“Ocean Rambler”UWG were completed.Tank test results show high precision of heading motion prediction including heading angle and yawing angular velocity.The UWG shows good control performance in tank tests and sea trials.The efficiency of the proposed method is verified.展开更多
The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the slid...The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.展开更多
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.展开更多
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 main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor net...The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.展开更多
With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater envir...With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater environments.However,nowadays AUVs generally have drawbacks such as weak endurance,low intelligence,and poor detection ability.The research and implementation of path-planning methods are the premise of AUVs to achieve actual tasks.To improve the underwater operation ability of the AUV,this paper studies the typical problems of path-planning for the ant colony algorithm and the artificial potential field algorithm.In response to the limitations of a single algorithm,an optimization scheme is proposed to improve the artificial potential field ant colony(APF-AC)algorithm.Compared with traditional ant colony and comparative algorithms,the APF-AC reduced the path length by 1.57%and 0.63%(in the simple environment),8.92%and 3.46%(in the complex environment).The iteration time has been reduced by approximately 28.48%and 18.05%(in the simple environment),18.53%and 9.24%(in the complex environment).Finally,the improved APF-AC algorithm has been validated on the AUV platform,and the experiment is consistent with the simulation.Improved APF-AC algorithm can effectively reduce the underwater operation time and overall power consumption of the AUV,and shows a higher safety.展开更多
Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the patte...Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult.Since OM find useful in business sectors to improve the quality of the product as well as services,machine learning(ML)and deep learning(DL)models can be considered into account.Besides,the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process.Therefore,in this paper,a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory(AFSO-BLSTM)model has been developed for OM process.The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data.In addition,the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process.Besides,BLSTM model is employed for the effectual detection and classification of opinions.Finally,the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model,shows the novelty of the work.A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.展开更多
Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In th...Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.展开更多
The recently invented artificial bee colony (ABC) al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs ...The recently invented artificial bee colony (ABC) al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs well in most cases, however, there still exists an insufficiency in the ABC algorithm that ignores the fitness of related pairs of individuals in the mechanism of find- ing a neighboring food source. This paper presents an improved ABC algorithm with mutual learning (MutualABC) that adjusts the produced candidate food source with the higher fitness between two individuals selected by a mutual learning factor. The perfor- mance of the improved MutualABC algorithm is tested on a set of benchmark functions and compared with the basic ABC algo- rithm and some classical versions of improved ABC algorithms. The experimental results show that the MutualABC algorithm with appropriate parameters outperforms other ABC algorithms in most experiments.展开更多
The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was ...The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.展开更多
A software defined networking(SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and o...A software defined networking(SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and optimization problems are typicallyvery complex with a huge solution space, large number of variables, and multiple objectives. Heuristic algorithms can solve theseproblems in an acceptable time but are usually limited to some particular problem circumstances. On the other hand, evolutionaryalgorithms(EAs), which are general stochastic algorithms inspired by the natural biological evolution and/or social behavior of species, can theoretically be used to solve any complex optimization problems including those found in SDNs. This paper reviewsfour types of EAs that are widely applied in current SDNs: Genetic Algorithms(GAs), Particle Swarm Optimization(PSO), Ant Colony Optimization(ACO), and Simulated Annealing(SA) by discussing their techniques, summarizing their representative applications, and highlighting their issues and future works. To the best of our knowledge, our work is the first that compares the tech-niques and categorizes the applications of these four EAs in SDNs.展开更多
In this paper, a static weapon target assignment(WTA)problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, ...In this paper, a static weapon target assignment(WTA)problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, it is indispensable to design a target assignment model that can ensure minimizing targets survivability and weapons consumption simultaneously. Afterwards an algorithm named as improved artificial fish swarm algorithm-improved harmony search algorithm(IAFSA-IHS) is proposed to solve the problem. The effect of the proposed algorithm is demonstrated in numerical simulations, and results show that it performs positively in searching the optimal solution and solving the WTA problem.展开更多
A novel bionic swarm intelligence algorithm, called ant colony algorithm based on a blackboard mechanism, is proposed to solve the autonomy and dynamic deployment of mobiles sensor networks effectively. A blackboard m...A novel bionic swarm intelligence algorithm, called ant colony algorithm based on a blackboard mechanism, is proposed to solve the autonomy and dynamic deployment of mobiles sensor networks effectively. A blackboard mechanism is introduced into the system for making pheromone and completing the algorithm. Every node, which can be looked as an ant, makes one information zone in its memory for communicating with other nodes and leaves pheromone, which is created by ant itself in naalre. Then ant colony theory is used to find the optimization scheme for path planning and deployment of mobile Wireless Sensor Network (WSN). We test the algorithm in a dynamic and unconfigurable environment. The results indicate that the algorithm can reduce the power consumption by 13% averagely, enhance the efficiency of path planning and deployment of mobile WSN by 15% averagely.展开更多
This study concentrates of the new generation of the agile (AEOS). AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile (AEOS). AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
For the mobile robot path planning under the complex environment,ant colony optimization with artificial potential field based on grid map is proposed to avoid traditional ant colony algorithm's poor convergence a...For the mobile robot path planning under the complex environment,ant colony optimization with artificial potential field based on grid map is proposed to avoid traditional ant colony algorithm's poor convergence and local optimum.Firstly,the pheromone updating mechanism of ant colony is designed by a hybrid strategy of global map updating and local grids updating.Then,some angles between the vectors of artificial potential field and the orientations of current grid are introduced to calculate the visibility of eight-neighbor cells of cellular automata,which are adopted as ant colony's inspiring factor to calculate the transition probability based on the pseudo-random transition rule cellular automata.Finally,mobile robot dynamic path planning and the simulation experiments are completed by this algorithm,and the experimental results show that the method is feasible and effective.展开更多
Medical data classification(MDC)refers to the application of classification methods on medical datasets.This work focuses on applying a classification task to medical datasets related to specific diseases in order to ...Medical data classification(MDC)refers to the application of classification methods on medical datasets.This work focuses on applying a classification task to medical datasets related to specific diseases in order to predict the associated diagnosis or prognosis.To gain experts’trust,the prediction and the reasoning behind it are equally important.Accordingly,we confine our research to learn rule-based models because they are transparent and comprehensible.One approach to MDC involves the use of metaheuristic(MH)algorithms.Here we report on the development and testing of a novel MH algorithm:IWD-Miner.This algorithm can be viewed as a fusion of Intelligent Water Drops(IWDs)and AntMiner+.It was subjected to a four-stage sensitivity analysis to optimize its performance.For this purpose,21 publicly available medical datasets were used from the Machine Learning Repository at the University of California Irvine.Interestingly,there were only limited differences in performance between IWDMiner variants which is suggestive of its robustness.Finally,using the same 21 datasets,we compared the performance of the optimized IWD-Miner against two extant algorithms,AntMiner+and J48.The experiments showed that both rival algorithms are considered comparable in the effectiveness to IWD-Miner,as confirmed by the Wilcoxon nonparametric statistical test.Results suggest that IWD-Miner is more efficient than AntMiner+as measured by the average number of fitness evaluations to a solution(1,386,621.30 vs.2,827,283.88 fitness evaluations,respectively).J48 exhibited higher accuracy on average than IWD-Miner(79.58 vs.73.65,respectively)but produced larger models(32.82 leaves vs.8.38 terms,respectively).展开更多
Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Softwar...Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.展开更多
The Wireless Sensor Networks(WSN)is a self-organizing network with random deployment of wireless nodes that connects each other for effective monitoring and data transmission.The clustering technique employed to group...The Wireless Sensor Networks(WSN)is a self-organizing network with random deployment of wireless nodes that connects each other for effective monitoring and data transmission.The clustering technique employed to group the collection of nodes for data transmission and each node is assigned with a cluster head.The major concern with the identification of the cluster head is the consideration of energy consumption and hence this paper proposes an hybrid model which forms an energy efficient cluster head in the Wireless Sensor Network.The proposed model is a hybridization of Glowworm Swarm Optimization(GSO)and Artificial Bee Colony(ABC)algorithm for the better identification of cluster head.The performance of the proposed model is compared with the existing techniques and an energy analysis is performed and is proved to be more efficient than the existing model with normalized energy of 5.35%better value and reduction of time complexity upto 1.46%.Above all,the proposed model is 16%ahead of alive node count when compared with the existing methodologies.展开更多
The Artificial Bee Colony (ABC) is one of the numerous stochastic algorithms for optimization that has been written for solving constrained and unconstrained optimization problems. This novel optimization algorithm is...The Artificial Bee Colony (ABC) is one of the numerous stochastic algorithms for optimization that has been written for solving constrained and unconstrained optimization problems. This novel optimization algorithm is very efficient and as promising as it is;it can be favourably compared to other optimization algorithms and in some cases, it has been proven to be better than some known algorithms (like Particle Swarm Optimization (PSO)), especially when used in Well placement optimization problems that can be encountered in the Petroleum industry. In this paper, the ABC algorithm has been modified to improve its speed and convergence in finding the optimum solution to a well placement optimization problem. The effects of variations of the control parameters for both algorithms were studied, as well as the algorithms’ performances in the cases studied. The modified ABC (MABC) algorithm gave better results than the Artificial Bee Colony algorithm. It was noticed that the performance of the ABC algorithm increased with increase in the number of its optimization agents for both algorithms studied. The modified ABC algorithm overcame the challenge posed by the use of uniformly generated random numbers with very rough NPV surface. This new modified ABC algorithm proposed in this work will be a great tool in optimization for the Petroleum industry as it involves Well placements for optimum oil production.展开更多
基金jointly supported by the Jiangsu Postgraduate Research and Practice Innovation Project under Grant KYCX22_1030,SJCX22_0283 and SJCX23_0293the NUPTSF under Grant NY220201.
文摘Task scheduling plays a key role in effectively managing and allocating computing resources to meet various computing tasks in a cloud computing environment.Short execution time and low load imbalance may be the challenges for some algorithms in resource scheduling scenarios.In this work,the Hierarchical Particle Swarm Optimization-Evolutionary Artificial Bee Colony Algorithm(HPSO-EABC)has been proposed,which hybrids our presented Evolutionary Artificial Bee Colony(EABC),and Hierarchical Particle Swarm Optimization(HPSO)algorithm.The HPSO-EABC algorithm incorporates both the advantages of the HPSO and the EABC algorithm.Comprehensive testing including evaluations of algorithm convergence speed,resource execution time,load balancing,and operational costs has been done.The results indicate that the EABC algorithm exhibits greater parallelism compared to the Artificial Bee Colony algorithm.Compared with the Particle Swarm Optimization algorithm,the HPSO algorithmnot only improves the global search capability but also effectively mitigates getting stuck in local optima.As a result,the hybrid HPSO-EABC algorithm demonstrates significant improvements in terms of stability and convergence speed.Moreover,it exhibits enhanced resource scheduling performance in both homogeneous and heterogeneous environments,effectively reducing execution time and cost,which also is verified by the ablation experimental.
基金Project(51779052)supported by the National Natural Science Foundation of ChinaProject(QC2016062)supported by the Natural Science Foundation of Heilongjiang Province,China+2 种基金Project(614221503091701)supported by the Research Fund from Science and Technology on Underwater Vehicle Laboratory,ChinaProject(LBH-Q17046)supported by the Heilongjiang Postdoctoral Funds for Scientific Research Initiation,ChinaProject(HEUCFP201741)supported by the Fundamental Research Funds for the Central Universities,China
文摘We introduce the artificial fish swarm algorithm for heading motion model identification and control parameter optimization problems for the“Ocean Rambler”unmanned wave glider(UWG).First,under certain assumptions,the rigid-flexible multi-body system of the UWG was simplified as a rigid system composed of“thruster+float body”,based on which a planar motion model of the UWG was established.Second,we obtained the model parameters using an empirical method combined with parameter identification,which means that some parameters were estimated by the empirical method.In view of the specificity and importance of the heading control,heading model parameters were identified through the artificial fish swarm algorithm based on tank test data,so that we could take full advantage of the limited trial data to factually describe the dynamic characteristics of the system.Based on the established heading motion model,parameters of the heading S-surface controller were optimized using the artificial fish swarm algorithm.Heading motion comparison and maritime control experiments of the“Ocean Rambler”UWG were completed.Tank test results show high precision of heading motion prediction including heading angle and yawing angular velocity.The UWG shows good control performance in tank tests and sea trials.The efficiency of the proposed method is verified.
文摘The common failure mechanism for brittle rocks is known to be axial splitting which happens parallel to the direction of maximum compression. One of the mechanisms proposed for modelling of axial splitting is the sliding crack or so called, “wing crack” model. Fairhurst-Cook model explains this specific type of failure which starts by a pre-crack and finally breaks the rock by propagating 2-D cracks under uniaxial compression. In this paper, optimization of this model has been considered and the process has been done by a complete sensitivity analysis on the main parameters of the model and excluding the trends of their changes and also their limits and “peak points”. Later on this paper, three artificial intelligence algorithms including Particle Swarm Intelligence (PSO), Ant Colony Optimization (ACO) and genetic algorithm (GA) has been used and compared in order to achieve optimized sets of parameters resulting in near-maximum or near-minimum amounts of wedging forces creating a wing crack.
基金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 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.
基金financially supported by Natural Science Foundation of Heilongjiang Province of China[Grant No.LH2019F042].
文摘The main objective of the present study is the development of a new algorithm that can adapt to complex and changeable environments.An artificial fish swarm algorithm is developed which relies on a wireless sensor network(WSN)in a hydrodynamic background.The nodes of this algorithm are viscous fluids and artificial fish,while related‘events’are directly connected to the food available in the related virtual environment.The results show that the total processing time of the data by the source node is 6.661 ms,of which the processing time of crosstalk data is 3.789 ms,accounting for 56.89%.The total processing time of the data by the relay node is 15.492 ms,of which the system scheduling and the Carrier Sense Multiple Access(CSMA)rollback time of the forwarding is 8.922 ms,accounting for 57.59%.The total time for the data processing of the receiving node is 11.835 ms,of which the processing time of crosstalk data is 3.791 ms,accounting for 32.02%;the serial data processing time is 4.542 ms,accounting for 38.36%.Crosstalk packets occupy a certain amount of system overhead in the internal communication of nodes,which is one of the causes of node-level congestion.We show that optimizing the crosstalk phenomenon can alleviate the internal congestion of nodes to some extent.
基金supported by Research Program supported by the National Natural Science Foundation of China(No.62201249)the Jiangsu Agricultural Science and Technology Innovation Fund(No.CX(21)1007)+2 种基金the Open Project of the Zhejiang Provincial Key Laboratory of Crop Harvesting Equipment and Technology(Nos.2021KY03,2021KY04)University-Industry Collaborative Education Program(No.201801166003)the Postgraduate Research&Practice Innovation Program of Jiangsu Province(No.SJCX22_1042).
文摘With the increase in ocean exploration activities and underwater development,the autonomous underwater vehicle(AUV)has been widely used as a type of underwater automation equipment in the detection of underwater environments.However,nowadays AUVs generally have drawbacks such as weak endurance,low intelligence,and poor detection ability.The research and implementation of path-planning methods are the premise of AUVs to achieve actual tasks.To improve the underwater operation ability of the AUV,this paper studies the typical problems of path-planning for the ant colony algorithm and the artificial potential field algorithm.In response to the limitations of a single algorithm,an optimization scheme is proposed to improve the artificial potential field ant colony(APF-AC)algorithm.Compared with traditional ant colony and comparative algorithms,the APF-AC reduced the path length by 1.57%and 0.63%(in the simple environment),8.92%and 3.46%(in the complex environment).The iteration time has been reduced by approximately 28.48%and 18.05%(in the simple environment),18.53%and 9.24%(in the complex environment).Finally,the improved APF-AC algorithm has been validated on the AUV platform,and the experiment is consistent with the simulation.Improved APF-AC algorithm can effectively reduce the underwater operation time and overall power consumption of the AUV,and shows a higher safety.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work under grant number(RGP 2/142/43).
文摘Sentiment analysis or opinion mining(OM)concepts become familiar due to advances in networking technologies and social media.Recently,massive amount of text has been generated over Internet daily which makes the pattern recognition and decision making process difficult.Since OM find useful in business sectors to improve the quality of the product as well as services,machine learning(ML)and deep learning(DL)models can be considered into account.Besides,the hyperparameters involved in the DL models necessitate proper adjustment process to boost the classification process.Therefore,in this paper,a new Artificial Fish Swarm Optimization with Bidirectional Long Short Term Memory(AFSO-BLSTM)model has been developed for OM process.The major intention of the AFSO-BLSTM model is to effectively mine the opinions present in the textual data.In addition,the AFSO-BLSTM model undergoes pre-processing and TF-IFD based feature extraction process.Besides,BLSTM model is employed for the effectual detection and classification of opinions.Finally,the AFSO algorithm is utilized for effective hyperparameter adjustment process of the BLSTM model,shows the novelty of the work.A complete simulation study of the AFSO-BLSTM model is validated using benchmark dataset and the obtained experimental values revealed the high potential of the AFSO-BLSTM model on mining opinions.
基金supported in part by the National Natural Science Foundation of China(62073330)in part by the Natural Science Foundation of Hunan Province(2019JJ20021,2020JJ4339)in part by the Scientific Research Fund of Hunan Province Education Department(20B272)。
文摘Swarm intelligence algorithms are a subset of the artificial intelligence(AI)field,which is increasing popularity in resolving different optimization problems and has been widely utilized in various applications.In the past decades,numerous swarm intelligence algorithms have been developed,including ant colony optimization(ACO),particle swarm optimization(PSO),artificial fish swarm(AFS),bacterial foraging optimization(BFO),and artificial bee colony(ABC).This review tries to review the most representative swarm intelligence algorithms in chronological order by highlighting the functions and strengths from 127 research literatures.It provides an overview of the various swarm intelligence algorithms and their advanced developments,and briefly provides the description of their successful applications in optimization problems of engineering fields.Finally,opinions and perspectives on the trends and prospects in this relatively new research domain are represented to support future developments.
基金supported by the National Natural Science Foundation of China (60803074)the Fundamental Research Funds for the Central Universities (DUT10JR06)
文摘The recently invented artificial bee colony (ABC) al- gorithm is an optimization algorithm based on swarm intelligence that has been used to solve many kinds of numerical function optimization problems. It performs well in most cases, however, there still exists an insufficiency in the ABC algorithm that ignores the fitness of related pairs of individuals in the mechanism of find- ing a neighboring food source. This paper presents an improved ABC algorithm with mutual learning (MutualABC) that adjusts the produced candidate food source with the higher fitness between two individuals selected by a mutual learning factor. The perfor- mance of the improved MutualABC algorithm is tested on a set of benchmark functions and compared with the basic ABC algo- rithm and some classical versions of improved ABC algorithms. The experimental results show that the MutualABC algorithm with appropriate parameters outperforms other ABC algorithms in most experiments.
基金National Natural Science Foundation of China(No.70971020)the Subject of Ministry of Education of Hunan Province,China(No.13C818)+3 种基金the Project of Industrial Science and Technology Support of Hengyang City,Hunan Province,China(No.2013KG63)the Open Project Program of Artificial Intelligence Key Laboratory of Sichuan Province,Sichuan University of Science and Engineering,China(No.2012RYJ03)the Fund Project of Humanities and Social Sciences,Ministry of Education of China(No.13YJCZH147)the Special Fund for Shanghai Colleges' Outstanding Young Teachers' Scientific Research Projects,China(No.ZZGJD12033)
文摘The traveling salesman problem( TSP) is a well-known combinatorial optimization problem as well as an NP-complete problem. A dynamic multi-swarm particle swarm optimization and ant colony optimization( DMPSO-ACO) was presented for TSP.The DMPSO-ACO combined the exploration capabilities of the dynamic multi-swarm particle swarm optimizer( DMPSO) and the stochastic exploitation of the ant colony optimization( ACO) for solving the traveling salesman problem. In the proposed hybrid algorithm,firstly,the dynamic swarms,rapidity of the PSO was used to obtain a series of sub-optimal solutions through certain iterative times for adjusting the initial allocation of pheromone in ACO. Secondly,the positive feedback and high accuracy of the ACO were employed to solving whole problem. Finally,to verify the effectiveness and efficiency of the proposed hybrid algorithm,various scale benchmark problems were tested to demonstrate the potential of the proposed DMPSO-ACO algorithm. The results show that DMPSO-ACO is better in the search precision,convergence property and has strong ability to escape from the local sub-optima when compared with several other peer algorithms.
文摘A software defined networking(SDN) system has a logically centralized control plane that maintains a global network view and enables network-wide management, optimization, and innovation. Network-wide management and optimization problems are typicallyvery complex with a huge solution space, large number of variables, and multiple objectives. Heuristic algorithms can solve theseproblems in an acceptable time but are usually limited to some particular problem circumstances. On the other hand, evolutionaryalgorithms(EAs), which are general stochastic algorithms inspired by the natural biological evolution and/or social behavior of species, can theoretically be used to solve any complex optimization problems including those found in SDNs. This paper reviewsfour types of EAs that are widely applied in current SDNs: Genetic Algorithms(GAs), Particle Swarm Optimization(PSO), Ant Colony Optimization(ACO), and Simulated Annealing(SA) by discussing their techniques, summarizing their representative applications, and highlighting their issues and future works. To the best of our knowledge, our work is the first that compares the tech-niques and categorizes the applications of these four EAs in SDNs.
基金supported by the National Natural Science Foundation of China(61472441)
文摘In this paper, a static weapon target assignment(WTA)problem is studied. As a critical problem in cooperative air combat,outcome of WTA directly influences the battle. Along with the cost of weapons rising rapidly, it is indispensable to design a target assignment model that can ensure minimizing targets survivability and weapons consumption simultaneously. Afterwards an algorithm named as improved artificial fish swarm algorithm-improved harmony search algorithm(IAFSA-IHS) is proposed to solve the problem. The effect of the proposed algorithm is demonstrated in numerical simulations, and results show that it performs positively in searching the optimal solution and solving the WTA problem.
基金National "863" Project of China (Grant no. 2007AA04Z224)
文摘A novel bionic swarm intelligence algorithm, called ant colony algorithm based on a blackboard mechanism, is proposed to solve the autonomy and dynamic deployment of mobiles sensor networks effectively. A blackboard mechanism is introduced into the system for making pheromone and completing the algorithm. Every node, which can be looked as an ant, makes one information zone in its memory for communicating with other nodes and leaves pheromone, which is created by ant itself in naalre. Then ant colony theory is used to find the optimization scheme for path planning and deployment of mobile Wireless Sensor Network (WSN). We test the algorithm in a dynamic and unconfigurable environment. The results indicate that the algorithm can reduce the power consumption by 13% averagely, enhance the efficiency of path planning and deployment of mobile WSN by 15% averagely.
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile (AEOS). AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
基金National Natural Science Foundation of China(No.61373110)the Science-Technology Project of Wuhan,China(No.2014010101010005)
文摘For the mobile robot path planning under the complex environment,ant colony optimization with artificial potential field based on grid map is proposed to avoid traditional ant colony algorithm's poor convergence and local optimum.Firstly,the pheromone updating mechanism of ant colony is designed by a hybrid strategy of global map updating and local grids updating.Then,some angles between the vectors of artificial potential field and the orientations of current grid are introduced to calculate the visibility of eight-neighbor cells of cellular automata,which are adopted as ant colony's inspiring factor to calculate the transition probability based on the pseudo-random transition rule cellular automata.Finally,mobile robot dynamic path planning and the simulation experiments are completed by this algorithm,and the experimental results show that the method is feasible and effective.
基金a grant from the“Research Center of the Female Scientific and Medical Colleges”,the Deanship of Scientific Research,King Saud University.
文摘Medical data classification(MDC)refers to the application of classification methods on medical datasets.This work focuses on applying a classification task to medical datasets related to specific diseases in order to predict the associated diagnosis or prognosis.To gain experts’trust,the prediction and the reasoning behind it are equally important.Accordingly,we confine our research to learn rule-based models because they are transparent and comprehensible.One approach to MDC involves the use of metaheuristic(MH)algorithms.Here we report on the development and testing of a novel MH algorithm:IWD-Miner.This algorithm can be viewed as a fusion of Intelligent Water Drops(IWDs)and AntMiner+.It was subjected to a four-stage sensitivity analysis to optimize its performance.For this purpose,21 publicly available medical datasets were used from the Machine Learning Repository at the University of California Irvine.Interestingly,there were only limited differences in performance between IWDMiner variants which is suggestive of its robustness.Finally,using the same 21 datasets,we compared the performance of the optimized IWD-Miner against two extant algorithms,AntMiner+and J48.The experiments showed that both rival algorithms are considered comparable in the effectiveness to IWD-Miner,as confirmed by the Wilcoxon nonparametric statistical test.Results suggest that IWD-Miner is more efficient than AntMiner+as measured by the average number of fitness evaluations to a solution(1,386,621.30 vs.2,827,283.88 fitness evaluations,respectively).J48 exhibited higher accuracy on average than IWD-Miner(79.58 vs.73.65,respectively)but produced larger models(32.82 leaves vs.8.38 terms,respectively).
文摘Scalable video coding(SVC) is a powerful tool to solve the network heterogeneity and terminal diversity in video applications. However, in related works about the optimization of SVC-based video streaming over Software Defined Network(SDN), most of the them are focused either on the number of transmission layers or on the optimization of transmission path for specific layer. In this paper, we propose a noval optimization algorithm for SVC to dynamically adjust the number of layers and optimize the transmission paths simultaneously. We establish the problem model based on the 0/1 knapsack model, and then solve it with Artificial Fish Swarm Algorithm. Additionally, the simulations are carried out on the Mininet platform, which show that our approach can dynamically adjust the number of layers and select the optimal paths at the same time. As a result, it can achieve an effective allocation of network resources which mitigates the congestion and reduces the loss of non-SVC stream.
文摘The Wireless Sensor Networks(WSN)is a self-organizing network with random deployment of wireless nodes that connects each other for effective monitoring and data transmission.The clustering technique employed to group the collection of nodes for data transmission and each node is assigned with a cluster head.The major concern with the identification of the cluster head is the consideration of energy consumption and hence this paper proposes an hybrid model which forms an energy efficient cluster head in the Wireless Sensor Network.The proposed model is a hybridization of Glowworm Swarm Optimization(GSO)and Artificial Bee Colony(ABC)algorithm for the better identification of cluster head.The performance of the proposed model is compared with the existing techniques and an energy analysis is performed and is proved to be more efficient than the existing model with normalized energy of 5.35%better value and reduction of time complexity upto 1.46%.Above all,the proposed model is 16%ahead of alive node count when compared with the existing methodologies.
文摘The Artificial Bee Colony (ABC) is one of the numerous stochastic algorithms for optimization that has been written for solving constrained and unconstrained optimization problems. This novel optimization algorithm is very efficient and as promising as it is;it can be favourably compared to other optimization algorithms and in some cases, it has been proven to be better than some known algorithms (like Particle Swarm Optimization (PSO)), especially when used in Well placement optimization problems that can be encountered in the Petroleum industry. In this paper, the ABC algorithm has been modified to improve its speed and convergence in finding the optimum solution to a well placement optimization problem. The effects of variations of the control parameters for both algorithms were studied, as well as the algorithms’ performances in the cases studied. The modified ABC (MABC) algorithm gave better results than the Artificial Bee Colony algorithm. It was noticed that the performance of the ABC algorithm increased with increase in the number of its optimization agents for both algorithms studied. The modified ABC algorithm overcame the challenge posed by the use of uniformly generated random numbers with very rough NPV surface. This new modified ABC algorithm proposed in this work will be a great tool in optimization for the Petroleum industry as it involves Well placements for optimum oil production.