Soft Computing

, Volume 21, Issue 9, pp 2439–2450 | Cite as

An exact approach for the grocery delivery problem in urban areas

Methodologies and Application
  • 318 Downloads

Abstract

In this paper, we face the problem of delivering a given amount of goods in urban areas in a business-to-consumer (B2C) electronic commerce (EC) environment. This problem can be considered as a particular case of vehicle routing problem. As a novel issue, here we have to determine the fleet of no homogeneous vehicles to be used for satisfying the demands of clients coming from grocery e-channels, and their related itineraries, given the traveling limits imposed by the urban government; in fact, commercial vehicles are not allowed to go everywhere and can travel only in restricted daily time windows, according to their pollution emissions. We have to minimize the overall distribution costs, taking into account traveling components and setup ones, together with operative aspects and environmental issues; customer requirements, vehicle capacity and daily shift constraints have to be satisfied too. We outline the main characteristics of the problem in a B2C EC environment and propose a mixed integer linear programming model to solve this NP-hard problem. Computational results of test bed cases related to different sized transportation networks and delivery demands are presented and analyzed with respect to the fleet of vehicles chosen for satisfying the customer demand and the street traffic limitations. Then, a realistic case study derived from the e-distribution channel of a grocery company of Genoa, Italy, is reported. Considerations about CPU time and optimality gap are also given with the idea of making the proposed model effectively used and solved with any commercial software.

Keywords

Distribution network models E-channel grocery delivery Vehicle routing Mixed integer linear programming models 

References

  1. Agatz NAH, Fleischmann M, van Numen JAEE (2008) E-fulfillment and multi-channel distribution. A review. Eur J Oper Res 187:339–356CrossRefMATHGoogle Scholar
  2. Baldacci R, Battarra M, Vigo D (2009) Valid inequalities for mix vehicle routing the fleet size and problem with fixed costs. Networks 54(4):178–189MathSciNetCrossRefMATHGoogle Scholar
  3. Blumenfeld DE, Burns LD, Diltz JD, Daganzo CF (1985) Analyzing trade-offs between transportation, inventory and production costs on freight networks. Transp Res B 19:361–380MathSciNetCrossRefGoogle Scholar
  4. Boyer KK, Hult GT, Frohlich M (2003) An exploratory analysis of extended grocery supply chain operations and home delivery. Integr Manuf Syst 14(8):652–663CrossRefGoogle Scholar
  5. Braysy O, Gendreau M (2005) Vehicle routing problem with time windows, part ii: metaheuristics. Transp Sci 39(1):119–139CrossRefGoogle Scholar
  6. Carrabs F, Cerulli R, Sciomachen A (2014) Environmental sustainable fleet planning in B2C e-commerce Urban distribution networks”. In: Dameri R, Rosenthal-Sabroux C (eds) Smart city. How to create public and economic value with high technology in urban space. Springer, BerlinGoogle Scholar
  7. Carrabs F, Cerulli R, Speranza MG (2013) A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1):58–75MathSciNetCrossRefMATHGoogle Scholar
  8. Cattaruzza D, Feillet D, González-Feliu J (2015) Vehicle routing problems for city logistics. EURO J Transp Log, pp 1–29. doi:10.1007/s13676-014-0074-0
  9. Chao IM, Liou TS (2005) A new tabu search heuristic for the site dependent vehicle routing problem. In: Golden B, Raghavan S, Wasil E (eds) The next wave in computing, optimization, and decision technologies, vol 29. Springer, New York, pp 107–119Google Scholar
  10. Chao IM, Golden BL, Wasil EA (1999) A computational study of a new heuristic for the site-dependet vehicle routing problem. INFOR 37:319–336Google Scholar
  11. Confessore G, Galiano G, Stecca G (2008) An evolutionary algorithm for vehicle routing problem with real life constraints. In: The 41st CIRP conference on manufacturing systems, TokyoGoogle Scholar
  12. Cordeau J-F, Laporte G (2001) A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39:292–298Google Scholar
  13. Cordeau J-F, Desaulniers G, Desrosiers J, Solomon MM, Soumis F (2002) The vehicle routing problem. In: Toth P, Vigo D (eds) Volume 9 of SIAM monographs on discrete mathematics and applications 2002, Chap. 7, 157193. SIAM, PhilidelphiaGoogle Scholar
  14. Crainic TG, Ricciardi N, Storchi G (2009) Models for evaluating and planning city logistics systems. Transp Sci 43(4):432–454CrossRefGoogle Scholar
  15. De Koster RBM (2002) The logistics behind the enter click. In: Klose A, Speranza MG, Van Wassenhove L (eds) Quantitative approaches to distribution logistics and supply chain management. Springer, Berlin, pp 131–148CrossRefGoogle Scholar
  16. Du TC, Li EY, Chou D (2005) Dynamic vehicle routing problem for online B2C delivery. Omega 33:33–45CrossRefGoogle Scholar
  17. Francis P, Smilowitz K (2006) Modeling techniques for periodic vehicle routing problems. Transp Res Part B 2006(40):872–884CrossRefGoogle Scholar
  18. Gosman C, Cornea T, Dobre C, Pop F, Castiglione A (2016) Putting the user in control of the intelligent transportation system. In: Lecture notes in computer science vol 9722, pp 231–246Google Scholar
  19. Govindam K, Sarkis J, Chiappetta Jabbour CJ, Zhu K, Geng Y (2014) Eco-efficiency based green supply chain management: current status and opportunities. Eur J Oper Res 2014(233):293–298Google Scholar
  20. Hsu C-I, Li H-C (2006) Optimal delivery service strategy for Internet shopping with time-dependent consumer demand. Transp Res Part E 42:473–497CrossRefGoogle Scholar
  21. Johnson ME, Whang S (2002) E-business and supply chain management: an overview and framework. Prod Oper Manag 11(4):413–423CrossRefGoogle Scholar
  22. Kopfer W, Schönberger J, Kopfer H (2014) Reducing greenhouse gas emissions of a heterogeneous vehicle fleet. Flex Serv Manuf J 26(1):221–248CrossRefGoogle Scholar
  23. Lenstra JK, Rinnooy Kan AHG (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221–227CrossRefMATHGoogle Scholar
  24. Nag B, Golden B, Assad A (1988) Vehicle routing with site dependencies. Veh Routing methods Stud 16:149–159MathSciNetGoogle Scholar
  25. Negru C, Mocanu M, Chiru C, Draghia A, Drobot R (2015) Cost efficient cloud-based service oriented architecture for water pollution prediction. In: Intelligent computer communication and processing (ICCP), pp 417-423Google Scholar
  26. Petersen HL, Madsen OBG (2009) The double travelling salesman problem with multiple stacks: formulation and heuristic solution approaches. Eur J Oper Res 198(1):139–147CrossRefMATHGoogle Scholar
  27. Pop F, Negru C, Ciolofan SN, Mocanu M, Cristea V (2016) Optimizing intelligent reduction techniques for big data. Stud Big Data 18:49–70CrossRefGoogle Scholar
  28. Punakivi M, Saranen J (2001) Identifying the success factors in e-grocery home delivery. Int J Retail Distrib Manag 29(4):156–163CrossRefGoogle Scholar
  29. Qureshi AG, Taniguchi E, Yamada T (2009) An exact solution approach for vehicle routing and scheduling problems with soft time windows. Transp Res E 45(6):960–977CrossRefGoogle Scholar
  30. Sarkis J, Zhu Q, Lai KH (2011) An organizational theoretic review of green supply chain management literature. Int J Prod Econ 130(1):1–15CrossRefGoogle Scholar
  31. Sniezek J, Bodin L, Levy L, Ball M (2001) Capacitated Arc routing problem with vehicle-site dependencies: the Philadelphia experience. In: Toth P, Vigo D (eds) The vehicle routing problem, pp 287-308Google Scholar
  32. Simchi-Levi D, Wu DS, Shen ZJ (eds) (2004) Handbook of quantitative supply chain analysis: modeling in the E-business Era. Kluwer, BostonGoogle Scholar
  33. Swaminathan J, Tayur SR (2003) Models for supply chains in E-business. Manag Sci 49(10):1387–1406CrossRefMATHGoogle Scholar
  34. Toth P, Vigo D (eds) (2015) Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics, PennsylvaniaGoogle Scholar
  35. Yusuf I (2014) Solving multi-depot, heterogeneous, site dependent and asymmetric VRP using three steps heuristic. J Algorithms Optim 2:28–42Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of SalernoFiscianoItaly
  2. 2.Department of Economics and Business StudiesUniversity of GenoaGenoaItaly

Personalised recommendations