Skip to main content
SpringerLink
Log in

Conveyor operations in distribution centers: modeling and optimization

  • Original Paper
  • Published:
Optimization Letters Aims and scope Submit manuscript

Abstract

The optimal operation of a conveyor used in distribution centers is critical to delivery service quality. Optimizing conveyor operations entails routing a given number of items from loading to unloading locations in the shortest possible time. Developing an efficient model for conveyor operations is necessary to aid in routing processes. This paper proposes two models while taking conveyor operational constraints into account. The first model determines the best single path-based routing for each distinct loading-unloading while avoiding operation interruptions. The second model with the same goal focuses on utilizing the conveyor’s full capacity by routing on multiple paths, thus requires the complete set of available paths for each loading-unloading. This model is solved using a heuristic algorithm given the requirement for high-quality solutions within a short computation time. The computational experience was conducted on benchmark instances to assess our original models’ quality and applicability. Results confirm both models’ effectiveness and resolution and provide evidence for how controlling the number of used paths improves routing. Therefore, an operational manager can weigh the gains against the model and operation complexity expense.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. (2017). The State of Ecommerce Order Fulfillment & Shipping

  2. (2019). 5 ways to shorten last mile delivery

  3. Baier, G., Köhler, E., Skutella, M.: The k-splittable flow problem. Algorithmica 42(3–4), 231–248 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Boysen, N., Briskorn, D., Fedtke, S., and Schmickerath, M.: Automated sortation conveyors: A survey from an operational research perspective (2018). EJOR

  5. Chen, T.-L., Chen, J.C., Huang, C.-F., Chang, P.-C.: Solving the layout design problem by simulation-optimization approach-a case study on a sortation conveyor system. Simul. Modell. Pract Theory 106, 102192 (2021)

    Article  Google Scholar 

  6. Chen, Y.L., Chin, Y.H.: The quickest path problem. COR 17(2), 153–161 (1990)

    Google Scholar 

  7. Clímaco, J.C.N., Pascoal, M.M.B., Craveirinha, J.M.F., Captivo, M.E.V.: Internet packet routing: application of a k-quickest path algorithm. Eur. J. Op. Res. 181(3), 1045–1054 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Fedtke, S., Boysen, N.: Layout planning of sortation conveyors in parcel distribution centers. Transport. Sci. 51(1), 3–18 (2017)

    Article  Google Scholar 

  9. Fleischer, L.K.: Universally maximum flow with piecewise-constant capacities. Netw. An Int. J 38(3), 115–125 (2001)

    MathSciNet  MATH  Google Scholar 

  10. Ford, J.L.R., Fulkerson, D.R.: Flows in networks princeton university press. Princet. New Jersey 276, 22 (1962)

    Google Scholar 

  11. Johnson, M.E.: The impact of sorting strategies on automated sortation system performance. IIE trans. 30(1), 67–77 (1997)

    Article  Google Scholar 

  12. Kappmeier, J.-P.: Generalizations of flows over time with applications in evacuation optimization. epubli (2015)

  13. Kolliopoulos, S. G. (2018). Disjoint paths and unsplittable flow

  14. Martens, M. and Skutella, M.: Length-bounded and dynamic k-splittable flows. In Operations Research Proceedings 2005, pages 297–302(2006) Springer

  15. Melchiori, A., Sgalambro, A.: Optimizing emergency transportation through multicommodity quickest paths. Trans. Res. Proc. 10, 756–765 (2015)

    Google Scholar 

  16. Mor, A., Speranza, M. G.: Vehicle routing problems over time: a survey. Annals of Operations Research, pages 1–21(2022)

  17. Pascoal, M., Captivo, M., Clímaco, J.: Computational experiments with a lazy version of a k quickest simple path ranking algorithm. Top 15(2), 372–382 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Salimifard, K., Bigharaz, S.: The multicommodity network flow problem: state of the art classification, applications, and solution methods. Op. Res. 22(1), 1–47 (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, KU Leuven, CODeS, Gebroeders De Smetstraat 1, 9000, Gent, Belgium

    Farzaneh Karami

  2. Department of Electromechanical, Systems and Metal Engineering, Ghent University, EEDT-DC, Flanders Make, 9052, Zwijnaarde, Belgium

    Farzaneh Karami

  3. Department of Information Technology & Decision Sciences, G. Brint Ryan College of Business, University of North Texas, Denton, TX, USA

    Mahdi Fathi

  4. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos M. Pardalos

Authors
  1. Farzaneh Karami
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mahdi Fathi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mahdi Fathi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Karami, F., Fathi, M. & Pardalos, P.M. Conveyor operations in distribution centers: modeling and optimization. Optim Lett 17, 1049–1068 (2023). https://doi.org/10.1007/s11590-022-01912-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11590-022-01912-7

Keywords

Search

Navigation