Journal on Communications ›› 2020, Vol. 41 ›› Issue (8): 22-31.doi: 10.11959/j.issn.1000-436x.2020173

• Papers • Previous Articles     Next Articles

Second fitness selection QPSO and SA cooperative search for large-scale discrete optimization algorithm

Zhaojuan ZHANG1,Wanliang WANG1,Jijun TANG2   

  1. 1 College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China
    2 College of Intelligence and Computing,Tianjin University,Tianjin 300050,China
  • Revised:2020-06-10 Online:2020-08-25 Published:2020-09-05
  • Supported by:
    The National Natural Science Foundation of China(61873240)

Abstract:

To address the large-scale discrete optimization problem,a cooperative optimization algorithm called IDQPSO-SA was proposed.First,a strategy by applying two selections on the averaging fitness values to update the mean best position was presented,which could overcome the deficiency that QPSO was not applicable for discrete problems.Second,the double cut joining (DCJ) sorting strategy was incorporated into IDQPSO-SA,since the DCJ sorting strategy could considerably reduce the search space.Finally,the probability jumping ability of simulated annealing (SA) was combined with the parallel search of QPSO,and the global search was carried out collaboratively.By comparing with existing algorithms,the experimental results show that IDQPSO-SA further improves the search efficiency and has a comparable performance when faced with large-scale discrete optimization problems.

Key words: cooperative search, QPSO, SA, DCJ sorting, discrete optimization

CLC Number: 

No Suggested Reading articles found!