Reverse　logistics　(RL)　emerges　as　a　hot　topic　in　both　research　and　business　with　the　increasing　attention　on　the　collection　and　recycling　of　the　waste　products.　Since　Location　and　Routing　Problem　(LRP)　in　RL　is　NP-complete,　heuristic　algorithms,　especially　those　built　upon　swarm　intelligence,　are　very　popular　in　this　research.　In　this　paper,　both　Vehicle　Routing　Problem　(RP)　and　Location　Allocation　Problem　(LAP)　of　RL　are　considered　as　a　whole.　First,　the　features　of　LRP　in　RL　are　analyzed.　Second,　a　mathematical　model　of　the　problem　is　developed.　Then,　a　novel　discrete　artificial　bee　colony　(ABC)　algorithm　with　greedy　adjustment　is　proposed.　The　experimental　results　show　that　the　new　algorithm　can　approach　the　optimal　solutions　efficiently　and　effiectively.