The binary artificial bee colony algorithm has the shortcomings of slower convergence speed and falling into local optimum easily. According to the defects, a modified binary artificial bee colony algorithm is proposed. The algorithm redesign neighborhood search formula in artificial bee colony algorithm, the probability of the food position depends on the Bayes formula. The modified algorithm was used for solving multidimensional knapsack problem, during the evolution process, it uses the greedy algorithm repairs the infeasible solution and rectify knapsack resources with insufficient use. The simulation results show the feasibility and effectiveness of the proposed algorithm.