Study on Dynamic Slotting Optimization in Storage System

Article Preview

Abstract:

In order to improve the efficiency of warehouse on picking, an optimal model for ware location assignment is presented, which is with multi-objective function. To solve the multi-objective optimization problem, a differential evolution algorithm combined with lexicographic sort algorithm is presented. In order to verify the above algorithm, an example is presented. The calculated results show that the algorithm is operable and versatile. The optimized solution can be found fast with better fitness than genetic algorithm which is used to be compared.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

260-264

Citation:

Online since:

May 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Y. Huang : On Virtual Inventory Based on 3PL Enterpriseas Coordination Center. China Business and Market. Vol. 23 (2010), p.25.

Google Scholar

[2] P. Sundararaghavan, A. Kunnathur, I. Viswanathan: Minimizing Make Span in Parallel Flow Shop. Opns Res Soc. Vol. 48 (1997), p.834.

DOI: 10.1038/sj.jors.2600408

Google Scholar

[3] R. Zhang, W. Wei, Z. Jiang, X. Yu: Research and Simulation on Flow-shop Scheduling Problem Based on Improved Genetic Algorithm. The 7th International Conference on Computer Science & Education. Vol. 5 (2012), p.916.

DOI: 10.1109/iccse.2012.6295170

Google Scholar

[4] C. J. Peterse, G. Asee: Improving Order Picking Performance Through the Implementation of Class-basedstorage. International Journal of Physical and Logistical  Management. Vol. 34(2004), p.534.

Google Scholar

[5] P. Muppani: Application of Optimized Production Technology in a Capacity Constrained Flow Shop: A Case study in Automotive Factory. Computers Industrial Engineering. Vol. 27 (2003), p.217.

DOI: 10.1016/0360-8352(94)90274-7

Google Scholar

[6] S. Jung, B. Moon: Toward Minimal Restriction of Genetic Encoding and Crossovers for the Two-dimensional Euclidean TSP. IEEE Transactions on Evolutionary Computation. Vol. 6 (2002), p.557.

DOI: 10.1109/tevc.2002.804321

Google Scholar

[7] P. Tasgetiren, A. Kunnathur, I. Viswanathan: A Discrete Differential Evolution Algorithm for the No-wait Flowshop Scheduling Problem with Total Flow Time Criterion. Proceedings of the 2007 IEEE Symposium on Computational Intelligence in Scheduling. New York, USA: ACM, 2007, p.251.

DOI: 10.1109/scis.2007.367698

Google Scholar

[8] L. Yu, W. Ye, Z. Lu: Ant Colony Algorithms for Permutation Flowshop Scheduling to Minimize Make Span/total Flow Time of Job. European Journal of Operational Research. Vol. 155 (2004), p.426.

DOI: 10.1016/s0377-2217(02)00908-6

Google Scholar

[9] R. M. Venkata, G. K. Adil: A Branch and Bound Algorithm for Class Based Storage Location. European Journal of Operational Research. Vol. 189 (2008), p.492.

DOI: 10.1016/j.ejor.2007.05.050

Google Scholar

[10] X. Zhao, C. Yun, J. Hu: Research on Irregular Storage Location Assignment Optimization of AS/RS. Computer Engineering and Applications. Vol. 48 (2012), p.222.

Google Scholar