Abstract
With the rapid development of online shopping and the expansion of convenience stores in recent years, physical retail stores have successively launched fast online delivery services. To cut costs, hypermarket vendors usually use their existing physical stores as the distribution centers, leading to excessively long total walking distances in the ordering–picking process. In this paper, we propose an online two-stage method to optimize the order picking, specifically, an order batching stage and a picking-path planning stage. The empirical results indicate that the proposed method effectively calculates picking paths and that order pickers efficiently complete their picking tasks by these paths.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Turban E, King D, Lee JK, Liang T-P, Turban DC (2015) Electronic commerce: a managerial and social networks perspective. Springer texts in business and economics, 8th edn. Springer, Berlin
Gangopadhyay A (2001) Managing business with electronic commerce: issues and trends. Idea Group Publishing, Hershey
Kumar S, Tiffany M, Vaidya S (2016) Supply chain analysis of e-tailing versus retailing operation—a case study. Enterp Inf Syst 10(6):639–665
Bahaddad AA, Drew S, Houghton L, Alfarraj OA (2015) Factors attracting online consumers to choose e-Malls for e-Procurement in Saudi Arabia. Enterp Inf Syst 12:1–32
Han B, Zhang W, Lu X, Lin Y (2015) On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost. Eur J Oper Res 244(3):704–714
Oncan T (2013) A genetic algorithm for the order batching problem in low-level picker-to-part warehouse systems. In: Proceedings of the International MultiConference of Engineers and Computer Scientists, vol I
Hwang H, Lee YK, Ko CS (2001) Routing policies in an order picking operation. In: Proceedings of the 16th International Conference on Production Research
Elsayed EA, Stern RG (1983) Computerized algorithms for order processing in automated warehousing systems. Int J Prod Res 21(4):579–586
Barrett BG (1977) A further digression on the over-automated warehouse: some evidence. Interfaces 8(1):46–49
Hwang H, Lee MK (1988) Order batching algorithms for a man-on-board automated storage and retrieval system. Eng Costs Prod Econ 13(4):285–294
Hwang H, Bake W, Lee MK (1988) Clustering algorithms for order picking in an automated storage and retrieval systems. Int J Prod Res 26(2):189–201
Gademann AJRM, Van Den Berg JP, Van Der Hoff HH (2001) An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Trans 33(5):385–398
Battarra M, Erdogan G, Laporte G, Vigo D (2010) The travelling salesman problem with pickups, deliveries and handling costs. Transp Sci 44(3):383–399
Bellmore M, Nemhauser GL (1968) The travelling salesman problem: a survey. Oper Res 16(3):538–558
Gen M, Cheng R (1996) Genetic algorithms and engineering design. Wiley, New York
Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning. Addison Wesley, Boston
Mitchell M (1996) An introduction to genetic algorithms. MIT Press, Cambridge
Gutin G, Yeo A, Zverovich A (2002) Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP. Discrete Appl Math 117:81–86
Coley DA (1999) An introduction to genetic algorithms for scientists and engineers. World Scientific Press, Singapore
Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York
King JR (1980) Machine-component grouping in production flow analysis: an approach using a rank order clustering algorithm. Int J Prod Res 18(2):213–232
Dimopoulos C, Zalzala AMS (2000) Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Trans Evol Comput 4(2):93–113
Acknowledgements
We would like to thank the anonymous reviewers for their comments. In addition, R.-C. Chen’s research was funded by the Ministry of Science and Technology of Taiwan under Grant 102-2221-E-025-013. C.-Y. Lin’s research was funded by the Ministry of Science and Technology of Taiwan under Grant 105-2221-E-025-011 and 106-2221-E-025-012.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Chen, RC., Lin, CY. An efficient two-stage method for solving the order-picking problem. J Supercomput 76, 6258–6279 (2020). https://doi.org/10.1007/s11227-019-02775-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-019-02775-z