Skip to main content
SpringerLink
Log in

Decision Support for Agri-Food Supply Chains in the E-Commerce Era: The Inbound Inventory Routing Problem with Perishable Products

  • Conference paper
  • First Online:
Metaheuristics (MIC 2022)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 13838))

Included in the following conference series:

Abstract

We consider an integrated planning problem that combines purchasing, inventory, and inbound transportation decisions in an agri-food supply chain where several suppliers (farmers) offer a subset of products with different selling prices and available quantities. We provide a mixed-integer programming formulation of the problem and a matheuristic decomposition that divides the problem into two stages. First, the purchasing and inventory problem is solved. Second, the capacitated vehicle routing problem is solved using a split CVRP procedure. Computational experiments on a set of generated test instances show that the matheuristic can solve instances of large size within reasonably short computational times, providing better solutions than its MIP counterpart. In future work, it is proposed to develop heuristic approaches to validate the performance of the presented matheuristic and to try other routing cost approximations.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 69.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 89.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Viu-Roig, M., Alvarez-Palau, E.J.: The impact of E-Commerce-related last-mile logistics on cities: a systematic literature review. Sustainability 12(16), 6492 (2020)

    Article  Google Scholar 

  2. Gu, W., Archetti, C., Cattaruzza, D., Ogier, M., Semet, F., Speranza, M.G.: A sequential approach for a multi-commodity two-echelon distribution problem. Comput. Industr. Eng. 163, 107793 (2022)

    Article  Google Scholar 

  3. Prajapati, D., Chan, F.T., Daultani, Y., Pratap, S.: Sustainable vehicle routing of agro-food grains in the e-commerce industry. Int. J. Prod. Res. 60, 7319–7344 (2022)

    Google Scholar 

  4. Majluf-Manzur, Á.M., González-Ramirez, R.G., Velasco-Paredes, R.A., Villalobos, J.R.: An operational planning model to support first mile logistics for small fresh-produce growers. In: Rossit, D.A., Tohmé, F., Mejía Delgadillo, G. (eds.) ICPR-Americas 2020. CCIS, vol. 1408, pp. 205–219. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-76310-7_17

    Chapter  Google Scholar 

  5. Ji, Y., Du, J., Han, X., Wu, X., Huang, R., Wang, S., Liu, Z.: A mixed integer robust programming model for two-echelon inventory routing problem of perishable products. Phys. A 548, 124481 (2020)

    Article  Google Scholar 

  6. Andersson, H., Hoff, A., Christiansen, M., Hasle, G., Løkketangen, A.: Industrial aspects and literature survey: combined inventory management and routing. Comput. Oper. Res. 37(9), 1515–1536 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Coelho, L.C., Cordeau, J.F., Laporte, G.: Thirty years of inventory routing. Transp. Sci. 48(1), 1–19 (2014)

    Article  Google Scholar 

  8. Moin, N.H., Salhi, S., Aziz, N.A.B.: An efficient hybrid genetic algorithm for the multi-product multi-period inventory routing problem. Int. J. Prod. Econ. 133(1), 334–343 (2011)

    Article  Google Scholar 

  9. Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenović, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52, 291–299 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Chitsaz, M., Cordeau, J.F., Jans, R.: A unified decomposition matheuristic for assembly, production, and inventory routing. INFORMS J. Comput. 31(1), 134–152 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  11. Chitsaz, M., Cordeau, J.F., Jans, R.: A branch-and-cut algorithm for an assembly routing problem. Eur. J. Oper. Res. 282(3), 896–910 (2020)

    Article  MathSciNet  MATH  Google Scholar 

  12. Çabuk, S., Erol, R.: Modeling and analysis of multiple-supplier selection problem with price discounts and routing decisions. Appl. Sci. 9(17), 3480 (2019)

    Article  Google Scholar 

  13. Rohmer, S.U.K., Claassen, G.D.H., Laporte, G.: A two-echelon inventory routing problem for perishable products. Comput. Oper. Res. 107, 156–172 (2019)

    Article  MathSciNet  MATH  Google Scholar 

  14. Wei, M., Guan, H., Liu, Y., Gao, B., Zhang, C.: Production, replenishment and inventory policies for perishable products in a two-echelon distribution network. Sustainability 12(11), 4735 (2020)

    Article  Google Scholar 

  15. Manerba, D., Mansini, R., Riera-Ledesma, J.: The traveling purchaser problem and its variants. Eur. J. Oper. Res. 259(1), 1–18 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  16. Bianchessi, N., Irnich, S., Tilk, C.: A branch-price-and-cut algorithm for the capacitated multiple vehicle traveling purchaser problem with unitary demand. Discret. Appl. Math. 288, 152–170 (2021)

    Article  MathSciNet  MATH  Google Scholar 

  17. Baldacci, R., Dell’Amico, M., González, J.S.: The capacitated m-ring-star problem. Oper. Res. 55(6), 1147–1162 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Bianchessi, N., Mansini, R., Speranza, M.G.: The distance constrained multiple vehicle traveling purchaser problem. Eur. J. Oper. Res. 235(1), 73–87 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  19. Choi, M.J., Lee, S.H.: The multiple traveling purchaser problem. In: Proceedings of the Fortieth International Conference on Computers and Industrial Engineering (CIE), pp. 1–5 (2010)

    Google Scholar 

  20. Gendreau, M., Manerba, D., Mansini, R.: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach. Eur. J. Oper. Res. 248(1), 59–71 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  21. Hoshino, E.A., De Souza, C.C.: A branch-and-cut-and-price approach for the capacitated m-ring-star problem. Discret. Appl. Math. 160(18), 2728–2741 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  22. Manerba, D., Mansini, R.: A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. Networks 65(2), 139–154 (2015)

    Article  MathSciNet  Google Scholar 

  23. Manerba, D., Mansini, R.: The nurse routing problem with workload constraints and incompatible services. IFAC-PapersOnLine 49(12), 1192–1197 (2016)

    Article  Google Scholar 

  24. Riera-Ledesma, J., Salazar-González, J.J.: Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach. Comput. Oper. Res. 39(2), 391–404 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  25. Riera-Ledesma, J., Salazar-González, J.J.: A column generation approach for a school bus routing problem with resource constraints. Comput. Oper. Res. 40(2), 566–583 (2013)

    Article  MATH  Google Scholar 

  26. Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulation of traveling salesman problems. J. ACM (JACM) 7(4), 326–329 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  27. Cuellar-Usaquén, D., Gomez, C., Álvarez-Martínez, D.: A GRASP/Path-Relinking algorithm for the traveling purchaser problem. Int. Trans. Oper. Res. 30(2), 831–857 (2021)

    Google Scholar 

  28. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985–2002 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  29. Magzhan, K., Jani, H.M.: A review and evaluations of shortest path algorithms. Int. J. Sci. Technol. Res. 2(6), 99–104 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Universidad de Los Andes, Bogotá D.C., Colombia

    D. Cuellar-Usaquén, C. Gomez & D. Álvarez-Martínez

  2. Otto-von-guericke universität magdeburg, Magdeburg, Germany

    M. Ulmer

Authors
  1. D. Cuellar-Usaquén
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. Gomez
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. M. Ulmer
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. D. Álvarez-Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to D. Álvarez-Martínez .

Editor information

Editors and Affiliations

  1. University of Udine, Udine, Italy

    Luca Di Gaspero

  2. University of Napoli - Federico II, Napoli, Italy

    Paola Festa

  3. University of Paris Est, Paris, France

    Amir Nakib

  4. University of Catania, Catania, Italy

    Mario Pavone

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Cuellar-Usaquén, D., Gomez, C., Ulmer, M., Álvarez-Martínez, D. (2023). Decision Support for Agri-Food Supply Chains in the E-Commerce Era: The Inbound Inventory Routing Problem with Perishable Products. In: Di Gaspero, L., Festa, P., Nakib, A., Pavone, M. (eds) Metaheuristics. MIC 2022. Lecture Notes in Computer Science, vol 13838. Springer, Cham. https://doi.org/10.1007/978-3-031-26504-4_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-26504-4_31

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-26503-7

  • Online ISBN: 978-3-031-26504-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation