Gravitational chaotic search algorithm for partners selection with due date constraint in virtual enterprise

Partner selection with due date constraint has been proved to be NP-complete problem, and it is difficult to solve by the traditional optimization methods. In the paper, a novel gravitational chaotic search algorithm (GCSA) is proposed, and is firstly used to solve the partner selection optimization problem. By combining the gravitational search algorithm with the chaotic local search, the hybrid algorithm can not only avoid the disadvantage of easily getting to the local optional solution in the later evolution period, but also keep the rapid convergence performance. The simulation results show that the algorithm is efficient.