关键词: 部分联合运输, 物流车辆路径优化, 变维数矩阵编码, 逆选择操作蚁群算法

Abstract: We analyze the characteristic of logistics vehicle routing optimum problems, and propose a partial combined transport strategy of collaborative transportation with self-support logistics and third party logistic. Customer nodes are classified into certain types according to their characteristic of demand. An integer linear programming model is proposed,and the objective function is to minimize the total costs including the fixed costs of self-support vehicles , the transportation costs of self-support vehicles and the transportation costs of 3PL vehicles.Based on the transportation mode of the different customer nodes, an improved ACO algorithm by improving the coding mode and possible selection(ACO-nso)is proposed, and we compare the results obtained by ACO-nso algorithm , EA(enumeration method)method and GA( genetic algorithm) algorithm.It is shown that the model and ACO-nso algorithm improved in this paper require a shorter time of calculation and better global searching ability than traditional intelligent optimization algorithms. ACO-nso algorithm is an efficient algorithm for solving this kind of problem.

Key words: partial combined transport strategy, logistics vehicle routing optimum, variable dimension matrix coding, ACO-nso