IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v32y2021i5d10.1007_s10845-020-01619-5.html
   My bibliography  Save this article

Recommender systems as an agility enabler in supply chain management

Author

Listed:
  • Camélia Dadouchi

    (Laboratoire en Intelligence des Données, CIRRELT)

  • Bruno Agard

    (Laboratoire en Intelligence des Données, CIRRELT)

Abstract

In recent years, recommender systems have become necessary in overcoming the challenges related to the incredible growth of information. They are used in a wide range of contexts and applications, mainly as prediction tools for customer interest, designed to help customers decide, compare, discover and explore products (Meyer in Recommender systems in industrial contexts, Sciences et Technologies de l’Information, Grenoble, 2012). Therefore, research in the field has focused on improving the efficiency of data processing for instant and accurate recommendations. Recommendation of products, accordingly, does not take into consideration supply chain constraints for deliveries. This can lead to recommendations for products that can be costly or too long to ship to the customer, resulting in an avoidable increase in the stress on the supply chain. This paper addresses the problem of considering delivery constraints in product recommendations. The objective is to shift demand toward products that can be delivered using the current network state without additional resources in a given time window, perimeter and with a minimum acceptable profit, in the context of e-commerce. To achieve this goal, we propose a methodology to adjust product recommendations in order to shift customers’ interests towards particular products with consideration for remaining unit loads of scheduled deliveries. For this, quasireal-time information about the supply chain is taken into consideration to improve the number of shippable products in the recommendation list, resulting in a possible improvement in truck-load utilization, lower operation costs and reduced lead-times for delivery. This method works in two stages: the first stage is the computation of the recommendation with traditional recommendation systems, and the second stage is recommendation adjustments in four phases that consider the evaluation of active trucks, evaluation of physical constraints for transportation, evaluation of the profits associated with adding a pickup/delivery to a scheduled tour for each recommended item and adjustment of recommendation scores. A sensitivity analysis of the impact of the recommendation adjustment on the recommendation list has been conducted for each of the parameters considered in the proposed method: time window, perimeter radius and minimum acceptable profit. Various experimental results prove that the method permits increasing the number of recommended products that can be shipped using the available resources within a given perimeter radius, time window and minimum profit.

Suggested Citation

  • Camélia Dadouchi & Bruno Agard, 2021. "Recommender systems as an agility enabler in supply chain management," Journal of Intelligent Manufacturing, Springer, vol. 32(5), pages 1229-1248, June.
  • Handle: RePEc:spr:joinma:v:32:y:2021:i:5:d:10.1007_s10845-020-01619-5
    DOI: 10.1007/s10845-020-01619-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-020-01619-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-020-01619-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Wang, Gang & Gunasekaran, Angappa & Ngai, Eric W.T. & Papadopoulos, Thanos, 2016. "Big data analytics in logistics and supply chain management: Certain investigations for research and applications," International Journal of Production Economics, Elsevier, vol. 176(C), pages 98-110.
    2. Megersa Abate, 2014. "Determinants of Capacity Utilisation in Road Freight Transportation," Journal of Transport Economics and Policy, University of Bath, vol. 48(1), pages 137-152, January.
    3. Kalayci, Can B. & Kulak, Osman & Günther, Hans-Otto, 2015. "A perturbation based variable neighborhood search heuristic for solving the Vehicle Routing Problem with Simultaneous Pickup and Delivery with Time LimitAuthor-Name: Polat, Olcay," European Journal of Operational Research, Elsevier, vol. 242(2), pages 369-382.
    4. Chong Ju Choi & Carla C. J. M. Millar & Caroline Y. L. Wong, 2005. "Knowledge and the State," Palgrave Macmillan Books, in: Knowledge Entanglements, chapter 0, pages 19-38, Palgrave Macmillan.
    5. Manuel Iori & Silvano Martello, 2010. "Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 4-27, July.
    6. Brian Kallehauge & Jesper Larsen & Oli B.G. Madsen & Marius M. Solomon, 2005. "Vehicle Routing Problem with Time Windows," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 67-98, Springer.
    7. Nabila Azi & Michel Gendreau & Jean-Yves Potvin, 2012. "A dynamic vehicle routing problem with multiple delivery routes," Annals of Operations Research, Springer, vol. 199(1), pages 103-112, October.
    8. Eric Ballot & Frédéric Fontane, 2008. "Rendement et efficience du transport: un nouvel indicateur de performance," Post-Print hal-00878313, HAL.
    9. Thomas, Douglas J. & Griffin, Paul M., 1996. "Coordinated supply chain management," European Journal of Operational Research, Elsevier, vol. 94(1), pages 1-15, October.
    10. Xifan Yao & Jiajun Zhou & Yingzi Lin & Yun Li & Hongnian Yu & Ying Liu, 2019. "Smart manufacturing based on cyber-physical systems and beyond," Journal of Intelligent Manufacturing, Springer, vol. 30(8), pages 2805-2817, December.
    11. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    12. Stadtler, Hartmut, 2005. "Supply chain management and advanced planning--basics, overview and challenges," European Journal of Operational Research, Elsevier, vol. 163(3), pages 575-588, June.
    13. Marc Levinson, 2016. "The Box: How the Shipping Container Made the World Smaller and the World Economy Bigger," Economics Books, Princeton University Press, edition 2, number 10724.
    14. Coelho, Leandro C. & Laporte, Gilbert, 2014. "Improved solutions for inventory-routing problems through valid inequalities and input ordering," International Journal of Production Economics, Elsevier, vol. 155(C), pages 391-397.
    15. Marc Levinson, 2016. "The World the Box Made," Introductory Chapters, in: The Box: How the Shipping Container Made the World Smaller and the World Economy Bigger, Princeton University Press.
    16. Darat Dechampai & Ladda Tanwanichkul & Kanchana Sethanan & Rapeepan Pitakaso, 2017. "A differential evolution algorithm for the capacitated VRP with flexibility of mixing pickup and delivery services and the maximum duration of a route in poultry industry," Journal of Intelligent Manufacturing, Springer, vol. 28(6), pages 1357-1376, August.
    17. Manuel Iori & Silvano Martello, 2010. "Rejoinder on: Routing problems with loading constraints," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 18(1), pages 41-42, July.
    18. Gunasekaran, Angappa & Lai, Kee-hung & Edwin Cheng, T.C., 2008. "Responsive supply chain: A competitive strategy in a networked economy," Omega, Elsevier, vol. 36(4), pages 549-564, August.
    19. Warren B. Powell, 1996. "A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers," Transportation Science, INFORMS, vol. 30(3), pages 195-219, August.
    20. Niklas Kohl & Jacques Desrosiers & Oli B. G. Madsen & Marius M. Solomon & François Soumis, 1999. "2-Path Cuts for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 33(1), pages 101-116, February.
    21. Mengdi Zhang & George Q. Huang & Su Xiu Xu & Zhiheng Zhao, 2019. "Optimization based transportation service trading in B2B e-commerce logistics," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2603-2619, October.
    22. J-F Cordeau & G Laporte & A Mercier, 2001. "A unified tabu search heuristic for vehicle routing problems with time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 52(8), pages 928-936, August.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lahyani, Rahma & Khemakhem, Mahdi & Semet, Frédéric, 2015. "Rich vehicle routing problems: From a taxonomy to a definition," European Journal of Operational Research, Elsevier, vol. 241(1), pages 1-14.
    2. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2018. "A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1029-1075, October.
    3. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    4. Schmid, Verena & Doerner, Karl F. & Laporte, Gilbert, 2013. "Rich routing problems arising in supply chain management," European Journal of Operational Research, Elsevier, vol. 224(3), pages 435-448.
    5. Sana Jawarneh & Salwani Abdullah, 2015. "Sequential Insertion Heuristic with Adaptive Bee Colony Optimisation Algorithm for Vehicle Routing Problem with Time Windows," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    6. Zu-Jun Ma & Fei Yang & Ying Dai & Zuo-Jun Max Shen, 2021. "The Migratory Beekeeping Routing Problem: Model and an Exact Algorithm," INFORMS Journal on Computing, INFORMS, vol. 33(1), pages 319-335, January.
    7. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    8. Archetti, Claudia & Christiansen, Marielle & Grazia Speranza, M., 2018. "Inventory routing with pickups and deliveries," European Journal of Operational Research, Elsevier, vol. 268(1), pages 314-324.
    9. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2017. "A hybrid solution approach for the 3L-VRP with simultaneous delivery and pickups," FEMM Working Papers 170005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    10. Lahyani, Rahma & Coelho, Leandro C. & Khemakhem, Mahdi & Laporte, Gilbert & Semet, Frédéric, 2015. "A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia," Omega, Elsevier, vol. 51(C), pages 1-10.
    11. Kjetil Fagerholt & Lars Hvattum & Trond Johnsen & Jarl Korsvik, 2013. "Routing and scheduling in project shipping," Annals of Operations Research, Springer, vol. 207(1), pages 67-81, August.
    12. Alarcon Ortega, Emilio J. & Schilde, Michael & Doerner, Karl F., 2020. "Matheuristic search techniques for the consistent inventory routing problem with time windows and split deliveries," Operations Research Perspectives, Elsevier, vol. 7(C).
    13. Wei, Lijun & Zhang, Zhenzhen & Zhang, Defu & Leung, Stephen C.H., 2018. "A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 265(3), pages 843-859.
    14. Leung, Stephen C.H. & Zhang, Zhenzhen & Zhang, Defu & Hua, Xian & Lim, Ming K., 2013. "A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 225(2), pages 199-210.
    15. Bonet Filella, Guillem & Trivella, Alessio & Corman, Francesco, 2023. "Modeling soft unloading constraints in the multi-drop container loading problem," European Journal of Operational Research, Elsevier, vol. 308(1), pages 336-352.
    16. Andreas Baur & Lisandra Flach & Jasmin Katrin Gröschl, 2021. "Container Shipping in Stormy Times – Analysis and Outlook," ifo Schnelldienst, ifo Institute - Leibniz Institute for Economic Research at the University of Munich, vol. 74(05), pages 59-65, May.
    17. Panagiotis Ypsilantis & Rob Zuidwijk, 2019. "Collaborative Fleet Deployment and Routing for Sustainable Transport," Sustainability, MDPI, vol. 11(20), pages 1-26, October.
    18. Bortfeldt, Andreas & Wäscher, Gerhard, 2013. "Constraints in container loading – A state-of-the-art review," European Journal of Operational Research, Elsevier, vol. 229(1), pages 1-20.
    19. Bauer, Johannes M., 2018. "The Internet and income inequality: Socio-economic challenges in a hyperconnected society," Telecommunications Policy, Elsevier, vol. 42(4), pages 333-343.
    20. Takuma Matsuda & Suguru Otani, 2022. "Unified Container Shipping Industry Data From 1966: Freight Rate, Shipping Quantity, Newbuilding, Secondhand, and Scrap Price," Papers 2211.16292, arXiv.org, revised Apr 2023.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joinma:v:32:y:2021:i:5:d:10.1007_s10845-020-01619-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.