已为您找到该学者31条结果 成果回收站
【期刊论文】Parallel Physics-inspired Waterflow Particle Mechanics Algorithm for Load Rebalancing
冯翔, Francis C.M. Lau
Computer Networks,2010,54(11):1767-1777
2010年02月10日
The Load Rebalancing Problem (LRP) that reassigns tasks to processors so as to minimize the maximum load arises in the context of dynamic load balancing. Many applications such as on Web based environment, parallel computing on clusters can be stated as LRP. Solving LRP successfully would allow us to utilize resources better and achieve better performance. However LRP has been proven to be NP-hard, thus generating the exact solutions in tractable amount of time becomes infeasible when the problems become large. We present a new nature-inspired approximation algorithm based on the Waterflow Particle Mechanics (W-PM) model to compute in parallel approximate efficient solutions for LRPs. Just like other Nature-inspired Algorithms (NAs) drawing from observations of physical processes that occur in nature, the W-PM algorithm is inspired by kinematics and dynamics of waterflow. The W-PM algorithm maps the classical LRP to the flow of water flows in channels by corresponding mathematical model in which all water flows flow according to certain defined rules until reaching a stable state. By anti-mapping the stable state, the solution to LRP can be obtained.
Load rebalancing, Approximation algorithm, Nature-inspired algorithm, Waterflow particle mechanics model, Distributed and parallel algorithm
-
93浏览
-
0点赞
-
0收藏
-
1分享
-
25下载
-
0
-
引用
【期刊论文】Crystal-Energy Optimization Algorithm
冯翔, 马美怡, 虞慧群
Computational Intelligence,2014,32(2):284-322
2014年11月28日
Nature has always been a muse for those who dream in art or science. As it goes, optimization algorithms inspired by nature have been widely used to solve various scientific and engineering problems because of their intelligence and simplicity. As a novel nature‐inspired algorithm, the crystal energy optimizer (CEO) is proposed in this article. The proposed CEO is motivated by the following general observation on lake freezing in nature: the dynamics of crystals have possession of parallelism, openness, local interactivity, and self‐organization. It stimulates us to extend a crystal dynamic model in physics to a generalized crystal energy optimizer for traveling salesman problems, so as to exploit the advantages of crystal dynamic system and to realize the aforementioned purposes. The proposed CEO has these advantages: (1) it has the ability to perform large‐scale distributed parallel optimization; (2) it can converge and avoid local optimum; and (3) it is flexible and easy to adapt to a wide range of optimization problems.
crystal energy optimizer (, CEO), , computational intelligence, parallel algorithm, nature-inspired algorithm, traveling salesman problem (, TSP),
-
87浏览
-
0点赞
-
0收藏
-
1分享
-
18下载
-
0
-
引用
【期刊论文】Group Competition-Cooperation Optimization Algorithm
冯翔, 陈海娟
Applied Intelligence,2021,51(4):1813-1828
2021年04月30日
In order to solve complex practical problems, the model of deep learning can not be limited to models such as deep neural networks. To deepen the learning model, we must actively explore various depth models. Based on this, we propose a deep evolutionary algorithm, that is group competition cooperation optimization (GCCO) algorithm. Unlike the deep learning, in the GCCO algorithm, depth is mainly reflected in multi-step iterations, feature transformation, and models are complex enough. Firstly, the bio-group model is introduced to simulate the behavior that the animals hunt for the food. Secondly, according to the rules of mutual benefit and survival of the fittest in nature, the competition model and cooperation model are introduced. Furthermore, in the individual mobility strategy, the wanderers adopt stochastic movement strategy based on feature transformation to avoid local optimization. The followers adopt the variable step size region replication method to balance the convergence speed and optimization precision. Finally, the GCCO algorithm and the other three comparison algorithms are used to test the performance of the algorithm on ten optimization functions. At the same time, in the actual problem of setting up the Shanghai gas station the to improve the timely rate, GCCO algorithm achieves better performance than the other three algorithms. Moreover, Compared to the Global Search, the GCCO algorithm takes less time to achieve similar effects to the Global Search.
Deep evolution, Competition model, Cooperation model, Feature transformation
-
103浏览
-
0点赞
-
0收藏
-
1分享
-
0下载
-
0
-
引用
【期刊论文】A novel parallel object-tracking behavior algorithm for data clustering
冯翔, 赖兆林, 虞慧群
Soft Computing,2019,24(3):2265-2285
2019年05月15日
Recently, many evolutionary algorithms (EAs) have been used to solve clustering problem. However, compared to K-means which is a simple and fast clustering algorithm, these EA-based clustering algorithms take too much computation time. In addition, the parameters of most EAs are fixed or dynamical adjustment by a simple method on different datasets, and it will cause that the performance of these algorithms is good on some datasets but bad on others. In order to overcome these disadvantages, a novel parallel object-tracking behavior algorithm (POTBA) based on dynamics is proposed in this paper. The proposed algorithm consists of three different models which are parallel object-tracking model, parameters self-learning model and energy model, respectively. First, the parallel object-tracking model is designed to accelerate the computation speed and avoid local minima. Second, the parameters of POTBA are self-adjusted by the parameters self-learning model. Third, the energy model is introduced to depict energy changes of POTBA during the evolutionary process. The correctness and convergence properties of POTBA are analyzed theoretically. Moreover, the effectiveness and parallelism of POTBA are evaluated through several standard datasets, and the experimental results demonstrate that POTBA exhibits superior overall performance than five other state-of-the-art algorithms. In the aspect of search performance, the results of POTBA are better than other comparison algorithms on most used datasets. In the aspect of time performance, the time overhead of POTBA is significantly reduced through parallel computing. When the number of processors increases to 32, the computation time of POTBA is less or close to K-means which is the fastest comparison algorithm.
Parallel, Object tracking, Clustering, Parameters self-learning, Energy
-
88浏览
-
0点赞
-
0收藏
-
0分享
-
0下载
-
0
-
引用
【期刊论文】A Parallel Social Spider Optimization Algorithm Based on Emotional Learning
冯翔, 赖兆林, 虞慧群
IEEE TRANSACTIONS ON SYSTEMS, MAN, AND CYBERNETICS: SYSTEMS,2021,51(2):797-808
2021年02月28日
Social spider optimization (SSO) is a swarm algorithm designed for solving complex optimization problems. It is an effective approach for searching a global optimum by simulating the cooperative behavior of social-spiders. However, SSO takes too much computation time and shows premature convergence on some problems. In order to accelerate the computation speed and further enhance the search ability, a parallel SSO (PSSO) algorithm with emotional learning is proposed in this paper. First, we develop a parallel structure for the female and male individuals to update their positions, and each individual can be computed in parallel during the search process. Second, an emotional learning mechanism is used to increase swarm diversity which is helpful to improve the search performance. Furthermore, the convergence property and computational complexity of PSSO are discussed in detail. To test the effectiveness of the proposed algorithm, it is applied to solve data clustering problem. The experimental results demonstrate that the overall performance of PSSO is superior to six other clustering algorithms on several standard data sets. In the aspect of search performance, the results obtained by PSSO are better than the comparison algorithms in most used data sets. In the aspect of time performance, the computation time of PSSO is greatly reduced in the parallel computing environment. It is comparable with K-means which is the fastest among the comparison algorithms when the number of processors larger than and equals to 16.
Clustering, emotional learning, parallel, social spider optimization (, SSO),
-
134浏览
-
0点赞
-
0收藏
-
0分享
-
0下载
-
0
-
引用