考虑废物包装时间的车辆回收路径规划方法

针对考虑废物包装时间的车辆回收路径规划问题,建立问题数学模型,提出禁忌搜索算法与模因算法求解该问题,并与爬山算法、遗传算法进行对比.模因算法是爬山算法和遗传算法的结合.实验结果表明:在解的质量方面,禁忌搜索算法与模因算法所求出的解的质量要远远好于另外两种算法,但在运行时间上,禁忌搜索、爬山算法与遗传算法要远优于模因算法.

The Planning Method of Vehicle Routing Problem ConsideringWaste Packaging Time

To solve the problem of vehicle routing with waste packaging time, firstly the mathematical model of the problem was established, the tabu search algorithm and memetic algorithm were proposed to solve the problem, and the hill climbing algorithm and the genetic algorithm were selected for comparison. The memetic algorithm was the combination of the hill climbing algorithm and the genetic algorithm. The experiment showed that: in terms of the quality of the solution, the tabu search algorithm and the memetic algorithm were much better than the other two algorithms, but in terms of running time, the tabu search algorithm, the hill climbing algorithm and the genetic algorithm were far superior to the memetic algorithm.