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

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