关键词: 采购, 供应商选择, 车辆路径问题, 禁忌搜索, p邻域

Abstract: A supplier selection model in multi-product and multi-batch purchasing was proposed and its Tabu Search(TS)algorithm for the model was designed. To simplify the solving process, the four-dimension solution of the model was turned into one-dimension Open Vehicle Routing Problem(OVRP)by comparing the similarity between the two problems. Based on node pneighborhood, the exchange, move and self-increasing/decreasing neighborhood operations were designed. The hard constraints were used to control the number of suppliers and purchasing times for single product. And the initial solution as well as neighborhood operations were all conducted on the premise of satisfying these constraints. The penalty function was presented to handle purchasing quantity and using amount in each month of single product, and a dynamic penalty parameter was designed to transfer the constraints from soft to hard. The tabu search was applied to optimize the example and the results by different solution structure and heuristic algorithms were compared. Results and analysis demonstrated the validity of the proposed model and its algorithm.

Key words: purchasing, supplier selection, vehicle routing problem, tabu search, p neighborhood, model