带油耗的单车场开放式车辆路径问题研究

Research on a Single Depot Open Vehicle Routing Problem with Fuel Consumption

基于现代物流业的实际需求,研究了一个带油耗的开放式单车场多车型车辆路径问题。首先建立了该问题的0-1整数规划模型,接着给出一个禁忌搜索算法对该问题进行了求解,在此禁忌搜索算法中,为了提高其性能,采取了如下策略:(1)给出一个改进的最近邻算法来求得问题的一个可行解,并将其作为禁忌搜索算法的初始解;(2)根据车辆有不同的类型而采用了一些特殊的邻域操作。最后举例对该禁忌搜索算法进行说明,并对进一步的研究工作进行了展望。

Based on the actual needs of modern logistics,this paper studies a single depot multi-style of vehicles open vehicle routing problem with fuel consumption.Firstly,the 0-1 integer programming of the problem is established,and then a tabu search algorithm is given to solve the problem.In this tabu search algorithm,in order to improve it’s performance,this paper adopts the strategies as following.（1）To propose an improved nearest neighbor algorithm to get a feasible solution of the problem,and take it as the initial solution of the tabu search algorithm.（2）To take some special manipulations of neighborhoods.Finally,the paper gives an example to illustrate the tabu search algorithm,and look forward to the prospects of the future research.