Abstract:

PBIL combines the features of genetic algorithms(GA) and competitive learning in an efficient way, which has the advantage of simple execution process, quick and accurate solutions to problems. In this paper, the PBIL algorithm is applied to solving combinatorial optimization problems. Using the logistics center location as an example,we  illustrate a general method of solving the combinatorial optimization problems based on PBIL.A new algorithm for producing individuals for such problems is proposed. In order to improve the convergence speed and search capability, an acceleration method of probability learning is put forward based on the comparison of contemporary optimal solution and the successive optimal solution. Finally, the effectiveness of improvement is verified through simulation experiments.

Key words: PBIL;combinatorial optimization;evolutionary computation;genetic algorithm;logistics center location