考虑不可行路径的逆向物流回收路径问题

针对车辆回收路径问题的研究较少考虑部分节点可被多次访问的情况,以及现实生活中无法保证可行的直线路径均存在的问题,建立了以逆向物流网络最低总运输成本为优化目标的数学模型.通过FLOYD算法将问题转化为传统车辆路径问题模型,通过改进的蚁群算法进行求解,确定回收设施的数量和位置,并得到最优回收车辆路径.通过算例验证了模型和算法的有效性,对解决逆向物流路径问题具有一定的实际意义.

Reverse logistics recovery path problem with considering unfeasible path

Aiming at the situation that the multiple accesses of some nodes have been seldom considered in the study on the problem of vehicle recovery path and in order to solve the problem that the feasible linear paths can not be entirely guaranteed in real life, a mathematical model with taking the minimum total transportation cost of reverse logistics network as the optimization objective was established. The problem is transformed into the traditional vehicle path problem model through the FLOYD algorithm, and is solved with the improved ant colony algorithm, the number and location of recycling facilities are determined, and the optimum vehicle recovery path is obtained. Furthermore, the validity of both model and algorithm is verified with a numerical example, which has certain practical significance for solving the problem of reverse logistics path.