Z.-X. Cai's scientific contributions

Publications (2)

Article
Updating kenetic equations for discrete particle swarm optimization algorithm were improved to tackle travel salesman problem based on combinatorial optimization problem and discrete variable. Three mutant strategies were designed, which are named reversion mutant strategy, enlighten by ant colony mutant strategy and close neighbor search mutant st...
Article
A diversity measure was proposed for multi-swarm particle swarm optimization algorithms in dynamic environments. In order to improve the diversity of the swarm, each particle flew randomly away from its best neighbor particle before updating its velocity and location, and the redundant particles in each sub-swarm were replaced with random particles...

Citations

... IV. EXPERIMENT STUDIES To demonstrate the capability of the proposed algorithm, it is tested on Oliver30, EIL51 and ST70 from TSPLIB, and the results are compared with optimization results of GA [16], DPSO-2opt [17], Chaotic DPSO (CDPSO) [18] and direction-coordinating ant colony optimization (DCACO) [19]. The shortest distances over iterations for Oliver30, EIL51 and ST70 are as Fig. 3, Fig. 4 and Fig. 5, respectively. ...