Abstract: To reduce the recycling cost of discarded furniture in small and medium-sized furniture manufacturing enterprises,considering the characteristics of furniture products in transportation,a two-objective mathematical model with the shortest total driving distance and the minimum number of vehicles was constructed,and an improved two-stage contraindication was designed.The search algorithm solved Traveling Salesman Problem (TSP) path including all customers in the first stage,which served as the basis for the second stage to divide Vehicle Routing Problem (VRP) path.A new tabu table was constructed with both "neighbor operator" and "neighbor exchange point pair" as tabu objects,and the multi-domain structure used was tested.The results showed that the optimization effect of combination of point reverse order operator and point exchange operator was better than other combinations.The comparison of literature further showed the effectiveness of the proposed algorithm.

Key words: vehicle routing problem, tabu search algorithm, two-stage, neighborhood operator, waste furniture recycling

摘要： 为了降低中小家具制造企业废弃家具的回收成本,考虑家具产品在运输途中的特征,构建了以总行驶距离最短和车辆数最少为目标函数的双目标数学模型,并设计了一个改进的两阶段禁忌搜索算法进行求解。算法的第一阶段求解所有客户的旅行商问题路径,以此作为第二阶段车辆路径问题中划分路径的基础。构建了一个将邻域算子和邻域交换点对作为禁忌对象的新的禁忌表,并对所使用的多邻域结构体进行了数据测试,结果表明点逆序算子和点交换算子组合的优化效果优于其他组合。经文献对比进一步表明了所设计算法的有效性。

关键词: 车辆路径问题, 禁忌搜索算法, 两阶段, 邻域算子, 废弃家具回收