Spare parts warehouse layout method and system

Abstract

The invention provides a spare parts storeroom layout method and system. The spare parts warehouse layout method includes: using a discrete location selection method to determine a warehouse location scheme when the number of warehouses is k; calculating the spare parts distribution cost under the warehouse location scheme when the number of warehouses is k; and if the number of warehouses is k The distribution cost of spare parts under the location selection scheme of warehouses at that time is greater than the distribution cost of spare parts under the location selection scheme of warehouses when the number of warehouses is k-1, then it is determined that the location selection scheme of warehouses when the number of warehouses is k-1 is the optimal warehouse A location selection scheme, otherwise set the number of warehouses to k+1 and repeat the above process, where k is an integer greater than 1. The invention regards the cost of spare parts distribution as the optimization target and takes the quantity and position of site selection as optimization variables, and uses the iterative algorithm and the discrete site selection method to simultaneously realize the optimization of the site site and the number of site sites, and solves the problems caused by conventional discrete site selection. NP-hard problem.

Description

technical field [0001] The invention relates to the field of material distribution, and more particularly relates to a spare parts warehouse layout method and system. Background technique [0002] As the main back-up guarantee for wind power services, the spare parts warehouse plays an increasingly important role. The site selection of spare parts warehouse is mainly based on three types of site selection methods of network layout: continuous model site selection method, discrete model site selection method and Delphi expert consultation site selection method. [0003] The continuous model site selection method is not limited to the selection of specific candidate points, and any point on the plane can be selected. When using this method to select sites, the actual constraints are not considered, which may result in the site selection results being restricted by some actual conditions. For example, the site selection results are located in the center of the lake, among the ...

AI Technical Summary

Problems solved by technology

This method may have a certain subjective one-sidedness, and it is easy to ignore the opinions of a few people, which may cause the predicted results to deviate from reality

[0005] The discrete model site selection method is suitable for site selection from a limited number of candidate points according to the predetermined goal, and the results are consistent with the actual situation, and the results are objective, but the discrete model site selection problem is NP (non-deterministic polynomial) difficult problem, so When the scale of the location selection problem increases, the calculation time will increase exponentially, and using the heuristic method to solve the problem will lead to entering a local optimal solution, and the optimal solution is unstable

Images