Genetic algorithm-based further approach on an attemper problem with primary and secondary warehouses

Nowadays in the inside supply chain which regards the customer as the center, the determination of the allocation plan has become an important part of logistics. the classical transfer systems mostly use the single allocation rule. This rule gives an assumption that the merchandise the customer needs is supplied by another warehouse which is nearest to the customer. In this paper, we consider a supply chain management problem of allocating customer demands to primary and secondary warehouses with capacity restrictions on the basis of analyzing and summarizing the correlation literature. This problem is formulated as an Integer-programming model and solved by using genetic algorithms. The application of this calculation method and its examination show the effectiveness and practicality of the proposed method in dealing with such problems.It has broad application prospects and is of practical significance in the network design of real supply chains.