Route Choice Optimization for Urban Joint Distribution Based on the Two-Phase Algorithm

摘要

With the city's economic development, people have already put forward higher requirement for the city logistics, so joint distribution will attract increasing concern. In the daily operation, route choice is very important for the joint distribution, it will be related to the cost reduction and mitigation of congestion in urban transport. In order to solve the problem about the route choice in urban joint distribution network, the route choice model was established. Because normal algorithm would cost a lot of time, what' more, it also cannot get the optimal solution. Therefore, this paper provided the two-phase algorithm, which uses greedy algorithm to form the groups and apply ant colony algorithm for optimization. In order to verify the model and algorithm, through the case study, it shows that the unreasonable routes have already been adjusted, and the average line length has declined steadily. Compared with the result before, it decreases by 1.1%.