Xueliang Fu

An Adaptive Mutation Multi-particle Swarm Optimization for Traveling Salesman Problem

2015

Traveling Salesman Problem (TSP) is a well-known NP-hard combinatorial optimization problem. The Particle Swarm Optimization has been proven to succeed in lots of problems, but the PSO algorithm is challenging due to a variety of …

Research on cloud computing task scheduling algorithm based on particle swarm optimization

2018 · Journal of Computational Methods in Sciences and Engineering

In the field of cloud computing, Particle swarm optimization (PSO) is an important intelligent algorithm for solving the task scheduling problem, and has been rapidly developed. In order to improve the overall optimization ability, and …