已为您找到该学者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
-
引用
【期刊论文】A Novel Optimization Algorithm Inspired by the Creative Thinking Process
冯翔, 邹儒, 虞慧群
Soft Computing,2014,19(10):2955-2972
2014年09月19日
Creative thinking, which plays an essential role in the progress of human society, has an outstanding problem-solving ability. This paper presents a novel creativity-oriented optimization model (COOM) and algorithm (COOA) inspired by the creative thinking process. At first, COOM is constructed by simplifying the procedure of creative thinking while retaining its main characteristics. And then, COOA is presented for continuous optimization problems. It is a realization of COOM. As a new nature-inspired algorithm, COOA is different from other similar algorithms in terms of the basic principle, mathematical formalization and properties. Features of the COOM and the corresponding algorithm include a powerful processing ability for the complex problems, namely high-dimensional, highly nonlinear and random problems. The proposed approach also has the advantages in terms of the higher intelligence, effectiveness, parallelism and lower computation complexity. The properties of COOA, including convergence and parallelism, are discussed in detail. The numerous simulations on the CEC-2013 real-parameter optimization benchmark functions’ problems have shown the effectiveness and parallelism of the proposed approach.
Creativity-oriented optimization algorithm, Nature-inspired algorithm, Creative thinking, Numerical function optimization
-
94浏览
-
0点赞
-
0收藏
-
1分享
-
18下载
-
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
-
引用
【期刊论文】Social Group Search Optimizer Algorithm for Ad Hoc Network
冯翔, 马美怡, 虞慧群, 王喆
Ad Hoc & Sensor Wireless Networks,2015,28(3-4):257-287
2015年01月01日
Due to the dynamic structure in network topology and absence of a centralized administration in management, a specific routing algorithm satisfying the demands of QoS is required indeed in mobile Ad Hoc networks. A novel Social Group Search Optimizer algorithm is pro-posed by improving the GSO algorithm to a dynamic and discrete algorithm through the introducing of social behaviors. SGSO is divided into search and prey parts, where “search” is on duty to find the optimal solution effectively and “prey” is responsible for adjusting the algorithm to the dynamic change of objective functions. Dynamic Coupling Level is used to divide the Ad Hoc network and corresponding approaches and models based on SGSO are applied to routing algorithm, including the decision factor and local routing table. The convergence and correctness of our algorithm are verified mathematically and extensive experiments have been conducted to evaluate the efficiency and effectiveness of the proposed mechanism in mobile Ad Hoc networks. The results show that SGSO improves packet delivery ratio and reduces average end-to-end latency effectively, especially for large-scale and high-dynamicnetworks.
Ad Hoc network,, , ocial behavior,, , social group searching optimization, dynamic network,, , quality of service
-
99浏览
-
0点赞
-
0收藏
-
1分享
-
16下载
-
0
-
引用
【期刊论文】An Improved Group Search Optimizer for the Internet of Things
冯翔, 刘晓婷, 虞慧群
International Journal of Communication Systems,2014,29(3):535-552
2014年10月24日
The development of the Internet of Things brings new opportunities and challenges for sensor networks. The scale of sensor networks tends to be larger. And the fusion rules need to be intelligent. In this paper, we propose a new Internet of Things group search optimizer (ITGSO) to solve intelligent information fusion problems in the high-dimensional multi-sensor networks. ITGSO is inspired by the latest research achievement about leader decision in Nature and works about social coordination, which mainly consists of three parts: basic group search optimizer, binary group search optimizer, and social decision model. With ITGSO, we need less time to obtain minimum Bayes cost than particle swarm optimization. And information of uncertain social intelligent problems can be fused. In this paper, we give the theoretical basic of ITGSO and proved its validity via mathematical analysis and simulation results.
Internet of Things group search optimizer, sensor network, binary group search optimizer, leader decision
-
96浏览
-
0点赞
-
0收藏
-
1分享
-
20下载
-
0
-
引用