In order to resolve the contradiction between global searching and local searching of genetic algorithm, matrix genetic operator and Boolean genetic operator are proposed based on binary code describing search space fine and calculating fitness easier. Global searching of genetic algorithm is improved by the matrix genetic operator making good use of colony information to find new space, while local searching of genetic algorithm is improved by the Boolean genetic operator making good use of chromosome information. An optimization combination genetic algorithm is constructed through combining the two new genetic operators. It does not require parameters of crossover probability and mutation probability, which are important to general genetic algorithm. The constructed genetic algorithm is proved to be convergent, and its better searching efficiency is shown by experiments results. It is a significant reference for other optimum problem resolved by genetic algorithm based on binary coding.