Optimization for Multi-VMI Supply Chains on Stock Address and Path Based on Group Decision Making and Hungary Method

Many VMI Supply Chains produced a set of candidate stock addresses. The set was clustered by distance and storage. Only one address was selected to found warehouse in every class. The address is selected by all VMI supply chains which decides to found warehourse in that class. All VMI Supply Chains share the storage in one stock address class. Every VMI Supply Chain makes optimization of path itself. The problem of path optimization can be converted to a TSP problem. Further, the TSP problem is converted to assignment problem. Then the Hungary method can be used to solve the problem. A case is study at the end of the paper.