B2C电子商务中带退货的多配送站点车辆路径优化问题研究

Research on A Multi-Distribution Site Vehicle Routing Optimization Problem with Backhauls in B2C E-Com mence

研究了一个带退货的多配送站点车辆路径优化问题,建立了求解该问题的0-1整数规划模型,以实现各个配送站点在给他们客户配送货物的同时,沿途取回这些客户的退货,以节约运输成本的目的。设计了一种新的解的表示方法和邻域变换,以此为基础构造出直接求解多配送站点车辆路径优化问题的禁忌搜索算法,在该禁忌搜索算法中首先通过一个启发式算法求得了0-1整数规划模型的一个较好的初始可行解,从而提高了禁忌搜索算法的收敛速度及性能,最后通过例子对禁忌搜索算法及其性能进行了说明。

This paper discusses a multi-distribution site vehicle routing optimization problem with backhauls in B2C E-commence,builts a 0-1 integer programming model for it,aims to realize that each distribution site can simultaneously picking up backhauls of these custumers on the way during they deliver the goods of custumers,in order to reduce their logistics delivery costs.The paper presents a new kind of solution indicating method and a new kind of neighborhood transformation,then builds a tabu search algorithm for the multi-distribution site vehicle routing optimization problem to solve it directly.In the tabu search algorithm,a heuristic algorithm is used to get a better initial feasible solutions for this algorithm so as to quicken the convergence speed and improve the performance of the tabu search algorithm.An instance is given to illustrate the tabu search algorithm and its performance.