Multi-target goods allocation optimization method based on variable neighborhood NSGA-II algorithm
The invention discloses a multi-target goods allocation optimization method based on a variable neighborhood NSGA-II algorithm. According to the method, firstly, on the basis of a traditional storageallocation strategy with warehouse-in and warehouse-out efficiency, goods shelf stability and similar...
Saved in:
Main Authors | , , , , , |
---|---|
Format | Patent |
Language | Chinese English |
Published |
10.04.2020
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The invention discloses a multi-target goods allocation optimization method based on a variable neighborhood NSGA-II algorithm. According to the method, firstly, on the basis of a traditional storageallocation strategy with warehouse-in and warehouse-out efficiency, goods shelf stability and similar goods nearby storage as the center, goods allocation is performed by considering workload balanceof a roadway stacking machine to create a multi-target goods allocation optimization mathematical model; secondly, in order to prevent the NSGA-II algorithm from falling into local optimum during solving, an NSGA-II algorithm based on variable neighborhood search is proposed, and neighborhood operation is performed on part of individuals subjected to genetic operation by applying three different neighborhood structures so as to enhance the local search capability of the individuals. According to a goods allocation scheme obtained by the invention, the workload of each roadway stacking machineis more balanced, and the g |
---|---|
Bibliography: | Application Number: CN201911247460 |