This paper proposes a hybrid discrete artificial bee colony (HDABC) algorithm for solving the location allocation problem in reverse logistics network system. In the proposed algorithm, each solution is represented by two vectors, i.e., a collection point vector and a repair center vector. Eight well-designed neighborhood structures are proposed to utilize the problem structure and can thus enhance the exploitation capability of the algorithm. A simple but effi- cient selection and update approach is applied to the onlooker bee to enhance the exploitation process. A scout bee applies different local search methods to the abandoned solution and the best solution found so far, which can increase the convergence and the exploration capabilities of the proposed algorithm. In addition, an enhanced local search procedure is developed to further improve the search capability. Finally, the proposed algorithm is tested on sets of large-scale randomly generated benchmark instances. Through the analysis of experimental results, the highly effective performance of the proposed HDBAC algorithm is shown against several efficient algorithms from the literature.