期刊名称：Lecture Notes in Engineering and Computer Science
印刷版ISSN：2078-0958
电子版ISSN：2078-0966
出版年度：2019
卷号：2239
页码：35-39
出版社：Newswood and International Association of Engineers
摘要：In order to reduce the total operation cost of
the warehouse with order picking system, solving storage
assignment problem (SAP) becomes an important issue.
This paper develops a random weight multi-objective
genetic algorithm with considering workload balance
and replenishment, to improve the efficiency of picking
operation. The result of the algorithm had been
compared with random and first-come-first-served
assignment policy by the simulation model. From the
results of the simulation model, we can see that the
algorithm proposed in this paper can get better
performance than the common assignment policy.
