Skip to main content
Erschienen in: The Journal of Supercomputing 8/2020

13.02.2019

An efficient two-stage method for solving the order-picking problem

verfasst von: Rong-Chang Chen, Chen-Yi Lin

Erschienen in: The Journal of Supercomputing | Ausgabe 8/2020

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

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.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat 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, BerlinCrossRef 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, BerlinCrossRef
2.
Zurück zum Zitat Gangopadhyay A (2001) Managing business with electronic commerce: issues and trends. Idea Group Publishing, HersheyCrossRef Gangopadhyay A (2001) Managing business with electronic commerce: issues and trends. Idea Group Publishing, HersheyCrossRef
3.
Zurück zum Zitat 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–665CrossRef 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–665CrossRef
4.
Zurück zum Zitat 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 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
5.
Zurück zum Zitat 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–714MathSciNetMATHCrossRef 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–714MathSciNetMATHCrossRef
6.
Zurück zum Zitat 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 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
7.
Zurück zum Zitat Hwang H, Lee YK, Ko CS (2001) Routing policies in an order picking operation. In: Proceedings of the 16th International Conference on Production Research Hwang H, Lee YK, Ko CS (2001) Routing policies in an order picking operation. In: Proceedings of the 16th International Conference on Production Research
8.
Zurück zum Zitat Elsayed EA, Stern RG (1983) Computerized algorithms for order processing in automated warehousing systems. Int J Prod Res 21(4):579–586CrossRef Elsayed EA, Stern RG (1983) Computerized algorithms for order processing in automated warehousing systems. Int J Prod Res 21(4):579–586CrossRef
9.
Zurück zum Zitat Barrett BG (1977) A further digression on the over-automated warehouse: some evidence. Interfaces 8(1):46–49CrossRef Barrett BG (1977) A further digression on the over-automated warehouse: some evidence. Interfaces 8(1):46–49CrossRef
10.
Zurück zum Zitat 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–294CrossRef 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–294CrossRef
11.
Zurück zum Zitat 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–201CrossRef 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–201CrossRef
12.
Zurück zum Zitat 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–398CrossRef 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–398CrossRef
13.
Zurück zum Zitat Battarra M, Erdogan G, Laporte G, Vigo D (2010) The travelling salesman problem with pickups, deliveries and handling costs. Transp Sci 44(3):383–399CrossRef Battarra M, Erdogan G, Laporte G, Vigo D (2010) The travelling salesman problem with pickups, deliveries and handling costs. Transp Sci 44(3):383–399CrossRef
14.
Zurück zum Zitat Bellmore M, Nemhauser GL (1968) The travelling salesman problem: a survey. Oper Res 16(3):538–558MATHCrossRef Bellmore M, Nemhauser GL (1968) The travelling salesman problem: a survey. Oper Res 16(3):538–558MATHCrossRef
15.
Zurück zum Zitat Gen M, Cheng R (1996) Genetic algorithms and engineering design. Wiley, New YorkCrossRef Gen M, Cheng R (1996) Genetic algorithms and engineering design. Wiley, New YorkCrossRef
16.
Zurück zum Zitat Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning. Addison Wesley, BostonMATH Goldberg DE (1989) Genetic algorithm in search, optimization, and machine learning. Addison Wesley, BostonMATH
17.
Zurück zum Zitat Mitchell M (1996) An introduction to genetic algorithms. MIT Press, CambridgeMATH Mitchell M (1996) An introduction to genetic algorithms. MIT Press, CambridgeMATH
18.
Zurück zum Zitat 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–86MathSciNetMATHCrossRef 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–86MathSciNetMATHCrossRef
19.
Zurück zum Zitat Coley DA (1999) An introduction to genetic algorithms for scientists and engineers. World Scientific Press, SingaporeCrossRef Coley DA (1999) An introduction to genetic algorithms for scientists and engineers. World Scientific Press, SingaporeCrossRef
20.
Zurück zum Zitat Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York Gen M, Cheng R (2000) Genetic algorithms and engineering optimization. Wiley, New York
21.
Zurück zum Zitat 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–232CrossRef 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–232CrossRef
22.
Zurück zum Zitat Dimopoulos C, Zalzala AMS (2000) Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Trans Evol Comput 4(2):93–113CrossRef Dimopoulos C, Zalzala AMS (2000) Recent developments in evolutionary computation for manufacturing optimization: problems, solutions, and comparisons. IEEE Trans Evol Comput 4(2):93–113CrossRef
Metadaten
Titel
An efficient two-stage method for solving the order-picking problem
verfasst von
Rong-Chang Chen
Chen-Yi Lin
Publikationsdatum
13.02.2019
Verlag
Springer US
Erschienen in
The Journal of Supercomputing / Ausgabe 8/2020
Print ISSN: 0920-8542
Elektronische ISSN: 1573-0484
DOI
https://doi.org/10.1007/s11227-019-02775-z

Weitere Artikel der Ausgabe 8/2020

The Journal of Supercomputing 8/2020 Zur Ausgabe