Xinyi Li
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xinyi Li has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Liqiang Lin
Shenzhen University
1 shared publication Pengfei Chen
1 shared publicationYang Fan
1 shared publicationYong Qi
1 shared publication- Zunchao Li
School of Microelectronics Xi'an Jiaotong University No. 28, Xianning West Road Xi'an People's Republic of China
1 shared publication
Latest Publications
- 1 February 2017
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 58, 176-189
A cost-effective strategy for Cloud system maintenance
- 1 February 2017
- Published by Elsevier in Computers and Electrical Engineering
- Vol. 58, 176-189
A cost-effective strategy for Cloud system maintenance
- 1 January 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3242, 153-156
An Artificial Bee Colony Algorithm for Multi-objective Optimization
Multi-objective optimization methods are essential to resolve real-world problems. An artificial bee colony algorithm used to the multi-objective optimization problems is presented. In the algorithm, solutions with a smaller number of dominating solutions and a larger crowding distance are first chosen into the next generation, their vicinity is searched with a higher probability and at self-adjective steps, and the opposition-based strategy is applied to the initialization, to speed up the convergence to the Pareto optimal solution set and improve the distribution uniformity of the solutions in the objective space. The simulation results on multi-objective test functions verify the validity of the proposed algorithm.
- 1 January 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3242, 153-156
An Artificial Bee Colony Algorithm for Multi-objective Optimization
Multi-objective optimization methods are essential to resolve real-world problems. An artificial bee colony algorithm used to the multi-objective optimization problems is presented. In the algorithm, solutions with a smaller number of dominating solutions and a larger crowding distance are first chosen into the next generation, their vicinity is searched with a higher probability and at self-adjective steps, and the opposition-based strategy is applied to the initialization, to speed up the convergence to the Pareto optimal solution set and improve the distribution uniformity of the solutions in the objective space. The simulation results on multi-objective test functions verify the validity of the proposed algorithm.