Abstract: Considering the complication of the realistic problem and the limitation of research into locations－routing problem of logistics separately and integrated logistics, the paper studies location－routing problem including multi－depot in integrated logistics. Model of LRP is given on the basis of some hypotheses. Because LRP is NP－hard problem, a two－phase heuristic approach for solving the LRP is proposed. In location－allocation phase, after the candidate facilities and their customers are determined by using taboo－search algorithm, vehicle routing phase is assorted to by adopting ant colony algorithm to search the optimal routes. These two phases operate repeatedly and continuously until meeting the condition of termination. At last, the dissertation gives an example to illustrate the model and algorithm effectiveness.

Key words: location－routing problem, integrated logistics, taboo－search algorithm, ant colony algorithm