Logistics distribution path planning is the key of the logistics operation management.In recent years, reducing logistics costs becomes an important area for manufacture companies in creating profits.As a new inbound logistics model,the milk-run of auto parts has attracted wide attention. But this effective inbound logistics mode has some problems in practice. The problem how to choose the right pickup path is worth to ponder when car companies try to use the mode.The paper takes the case12 of Logistics Competition as the background, first describes relevant content about milk-run route, milk-run route is the circle pickup route. Then the paperputs forward the problems in the process of circulation pickup by analyzing the part spick up routes of Anji-company. Then with the aid of the improved C-W algorithm, we build a mathematical model on how to optimize the loop pickup route based on time window constraint, and solves the problems by using C++ programs, which finally makes the 8 pickup route schemes to develop the program. It not only proposes solutions to the existence problems of Anji logistics, but also provides ideas in the study of optimization loop pickup line for other logistics companies, what’s more, it has a strong significant meaning. Keywords: milk-run, mathematical model, route optimization, C-W algorithm, C++

CICTP