关键词: 物流配送；车辆路径问题；多目标优化；差分进化算法

Abstract: It researches the unidirectional logistics distribution vehicle routing problem with no time windows, which constrains the vehicle capacity, the longest distance and the full load vehicle. The solution must ensure the nonfull load is the least, and the total distance is the shortest. A mathematical model for multi-objective optimization of the logistics distribution vehicle routing was proposed, and a differential evolution algorithm was presented for this problem. In the algorithm, an appropriate encoding method was presented. The advantage of the proposed algorithm was proved by simulation, based on Matlab language. The computational results demonstrate that the differential evolution algorithm is effective.

Key words: logistics distribution; vehicle routing problem; multi-objective optimization; differential evolution algorithm