The Multidimensional Multiple-choice Knapsack Problem (MMKP) is an NP-hard problem. Many heuristics algorithms have been developed to solve this combinatorial optimization problem. In this work, a new method based on Artificial Bee Colony algorithm (ABC) and surrogate constraint is proposed to solve the MMKP. Experimental results show that this method is competitive with the state-of-the-art approaches.