Di Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Di Wu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Guodong Wang
Product Design and Optimization Laboratory (PDOL), Simon Fraser University, Surrey, Canada
1 shared publication - Kambiz Haji Hajikolaei
Product Design and Optimization Laboratory (PDOL), Simon Fraser University, Surrey, Canada
1 shared publication - Ke Tang
Southern University of Science and Technology
1 shared publication - Nan Jiang
School of Electronic and information Engineering, Beihang University, 12633 Beijing, Beijing China
1 shared publication - Wenbo Du
Beihang University
1 shared publication - Xianbin Cao
Beihang University
1 shared publication
Latest Publications
- Open Access
- 16 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 7 (1) , 497-506
Particle Swarm Optimization with Moving Particles on Scale-Free Networks
PSO is a nature-inspired optimization algorithm widely applied in many fields. In this paper, we present a variant named MP-PSO, in which some particles are allowed to move on a scale-free network and change the interaction pattern during the search course. In contrast to traditional PSOs with fixed interaction sources, MP-PSO shows better flexibility and diversity, where the structure of the particle swarm could change adaptively and balance exploration and exploitation to a large extent. Experiments on benchmark functions show that MP-PSO outperforms other PSO variants on solution quality and success rate, especially for multimodal functions. We further investigate effects of the moving strategy from a microscopic view, finding that the cooperation mechanism of particles located on hub and non-hub nodes plays a crucial role during the optimization process. In particular, owing to the movement of particles on non-hub nodes, the exploration can be guaranteed to some extent even in the final stage, which may be benefit for optimization. We demonstrate the applicability of MP-PSO by using it to solve an important optimization problem, arrival sequencing and scheduling, in the field of air traffic control.
- 16 July 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network Science and Engineering
- Vol. 7 (1) , 497-506
Open AccessParticle Swarm Optimization with Moving Particles on Scale-Free Networks
PSO is a nature-inspired optimization algorithm widely applied in many fields. In this paper, we present a variant named MP-PSO, in which some particles are allowed to move on a scale-free network and change the interaction pattern during the search course. In contrast to traditional PSOs with fixed interaction sources, MP-PSO shows better flexibility and diversity, where the structure of the particle swarm could change adaptively and balance exploration and exploitation to a large extent. Experiments on benchmark functions show that MP-PSO outperforms other PSO variants on solution quality and success rate, especially for multimodal functions. We further investigate effects of the moving strategy from a microscopic view, finding that the cooperation mechanism of particles located on hub and non-hub nodes plays a crucial role during the optimization process. In particular, owing to the movement of particles on non-hub nodes, the exploration can be guaranteed to some extent even in the final stage, which may be benefit for optimization. We demonstrate the applicability of MP-PSO by using it to solve an important optimization problem, arrival sequencing and scheduling, in the field of air traffic control.
- 30 September 2017
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 57 (3) , 1329-1343
Employing partial metamodels for optimization with scarce samples
- 30 September 2017
- Published by Springer Nature in Structural and Multidisciplinary Optimization
- Vol. 57 (3) , 1329-1343
Employing partial metamodels for optimization with scarce samples