装卸混合车辆路径问题的模拟退火算法研究

Study on simulated annealing algorithm for vehicle routing problem with backhauls

提出了更具一般性的装卸混合车辆路径问题,建立了该问题的基于直观描述的数学模型.通过设计一种新的解的表示方法构造了求解该问题的模拟退火算法,并进行了实验计算.计算结果表明,用设计的模拟退火算法求解装卸混合车辆路径问题,不仅可以取得很好的计算结果,而且计算效率较高,收敛速度较快,计算结果也较稳定.通过对双向配送策略与单向配送策略计算结果的比较,说明了采用双向配送策略求解装卸混合车辆路径问题对于配送企业节省配送车辆、减少配送里程,从而降低配送成本、提高经济效益的重要意义.

A more general vehicle routing problem with backhauls is presented in this paper. On the basis of modeling the vehicle routing problem with backhauls with natural description, this paper builds a simulated annealing algorithm for the problem by designing a new representation method of solution and makes some experimental computations. The computational results demonstrate that the high quality solutions can be obtained by using the new algorithm and it is also efficient and robust. Through comparing the results of the two-direction distribution tactics and those of the one-direction distribution tactics, this paper also illustrates the advantages by using two-direction distribution tactics to solve the vehicle routing problem with backhauls for physical distribution enterprises to saving distribution vehicles, reducing logistics cost and raising economic benefits.