Application of discrete imperialist competitive algorithm in warehouse order scheduling

作者：Yan, Bo^*; Liu, Si; Huang, Yan-Hong

来源：Control and Decision, 2017, 32(1): 39-46.

DOI：10.13195/j.kzyjc.2015.1230

• Automated warehouse
• Computational results
• Imperialist competitive algorithm (ICA)
• Imperialist competitive algorithms
• Optimal solutions
• Optimization scheduling
• Order scheduling
• Priority scheduling

The discrete imperialist competitive algorithm is presented to solve the optimization scheduling problem of automated warehouse, when it is in the batch processing of orders. Outbound order priority scheduling and compound orders scheduling have been built and are solved by using discrete imperialist competitive algorithm(ICA). Finally, several examples are given and the computational results show that the presented approach can obtain a better optimal solution and has advantages in dealing with large quantities of orders scheduling.

• 出版日期2017-1-1
• 单位华南理工大学