\r\nlevels in the past few years. As this trend is only predicted to

\r\ngo up as we continue into the ’20s, new challenges will be faced

\r\nby companies when planning and controlling e-commerce logistics.

\r\nIn this paper, we survey the related literature on Optimization and

\r\nMachine Learning as well as on combined methodologies. We

\r\nalso identify the distinctive features of next-generation planning

\r\nalgorithms - namely scalability, model-and-run features and learning

\r\ncapabilities - that will be fundamental to cope with the scale and

\r\ncomplexity of logistics in the next decade.","references":"[1] Allied Market Research (2017), E-Commerce Logistics Market Report.\r\n[2] Ashton, K. That \u2018internet of things\u2019 thing, RFID journal 22(7), 97\u2013114,\r\n2009.\r\n[3] Attanasio, A., Cordeau, J.-F., Ghiani, G. and Laporte, G. Parallel tabu\r\nsearch heuristics for the dynamic multi-vehicle dial-a-ride problem.\r\nParallel Computing, 30(3), 377\u2013387, 2004.\r\n[4] Baker, B.M. and Sheasby, J. Extensions to the generalised assignment\r\nheuristic for vehicle routing. European Journal of Operational Research,\r\n119(1), 147\u2013157, 1999. [5] Bektas\u00b8, T., Erdo\u02d8gan, G. and R\u00f8pke, S. Formulations and branch-and-cut\r\nalgorithms for the generalized vehicle routing problem. Transportation\r\nScience, 45(3), 299\u2013316, 2011.\r\n[6] Bondi, A.B. Characteristics of scalability and their impact on\r\nperformance. In: Proceedings of the 2nd international workshop on\r\nSoftware and performance, pp. 195\u2013203, 2000.\r\n[7] Baldacci, R., Hadjiconstantinou, E. and Mingozzi, A. An exact algorithm\r\nfor the capacitated vehicle routing problem based on a two-commodity\r\nnetwork flow formulation. Operations research, 52(5), 723\u2013738, 2004.\r\n[8] Baldacci, R., Christofides, N. and Mingozzi, A. An exact algorithm for\r\nthe vehicle routing problem based on the set partitioning formulation\r\nwith additional cuts. Mathematical Programming, 115(2), 351\u2013385,\r\n2008.\r\n[9] Braekers, K., Ramaekers, K. and Van Nieuwenhuyse, I. The vehicle\r\nrouting problem: State of the art classification and review. Computers\r\n& Industrial Engineering, 99, 300\u2013313, 2016.\r\n[10] Brand\u02dcao, J. A tabu search algorithm for the heterogeneous fixed fleet\r\nvehicle routing problem. Computers & Operations Research, 38(1),\r\n140\u2013151, 2011.\r\n[11] Christofides, N., Mingozzi, A. and Toth, P. State-space relaxation\r\nprocedures for the computation of bounds to routing problems.\r\nNetworks, 11(2), 145\u2013164, 1981.\r\n[12] Clarke, G. and Wright, J.W. Scheduling of vehicles from a central depot\r\nto a number of delivery points. Operations research, 12(4), 568\u2013581,\r\n1964.\r\n[13] Cooray, P.L.N.U. and Rupasinghe, T.D. Machine learning-based\r\nparameter tuned genetic algorithm for energy minimizing vehicle routing\r\nproblem. Journal of Industrial Engineering, 2017.\r\n[14] Dantzig, G.B. and Ramser, J.H. The truck dispatching problem.\r\nManagement science, 6(1):80\u201391, 1959.\r\n[15] Ferrucci, F. and Bock, S. Real-time control of express pickup and\r\ndelivery processes in a dynamic environment. Transportation Research\r\nPart B: Methodological, 63, 1\u201314, 2014.\r\n[16] Gendreau, M. and Potvin, J.Y. (Eds.). Handbook of metaheuristics (Vol.\r\n2). New York: Springer, 2010.\r\n[17] Ghiani, G., Manni, A. and Manni, E. A scalable anticipatory policy for\r\nthe dynamic pickup and delivery problem. Submitted for publication,\r\n2019.\r\n[18] Ghiani, G., Manni, E., Quaranta, A. and Triki, C. Anticipatory\r\nalgorithms for same-day courier dispatching. Transportation Research\r\nPart E: Logistics and Transportation Review, 45(1), 96\u2013106, 2009.\r\n[19] Godfrey, G.A. and Powell, W.B. An adaptive dynamic programming\r\nalgorithm for dynamic fleet management, I: Single period travel times.\r\nTransportation Science, 36(1), 21\u201339, 2002.\r\n[20] Golden, B.L., Raghavan, S. and Wasil, E.A. (Eds.). The vehicle routing\r\nproblem: latest advances and new challenges (Vol. 43). Springer Science\r\n& Business Media, 2008.\r\n[21] Gutierrez-Rodr\u00b4\u0131guez, A.E., Conant-Pablos, S.E., Ortiz-Bayliss, J.C.\r\nand Terashima-Mar\u00b4\u0131n, H. Selecting meta-heuristics for solving vehicle\r\nrouting problems with time windows via meta-learning. Expert Systems\r\nwith Applications, 118, 470\u2013481, 2019.\r\n[22] Hadjiconstantinou, E., Christofides, N. and Mingozzi, A. A new exact\r\nalgorithm for the vehicle routing problem based on q-paths and\r\nk-shortest paths relaxations. Annals of Operations Research, 61(1),\r\n21\u201343, 1995.\r\n[23] He, Q., Irnich, S. and Song, Y. Branch-and-Cut-and-Price for the\r\nVehicle Routing Problem with Time Windows and Convex Node Costs.\r\nTransportation Science, 53(5), 1409\u20131426, 2019.\r\n[24] Holler, J., Vuorio, R., Qin, Z., Tang, X., Jiao, Y., Jin, T., Singh., S.,\r\nWang, C. and Ye, J. Deep Reinforcement Learning for Multi-Driver\r\nVehicle Dispatching and Repositioning Problem. In: 2019 IEEE\r\nInternational Conference on Data Mining (ICDM), pp. 1090\u20131095,\r\n2019.\r\n[25] Koza, J.R. Human-competitive results produced by genetic\r\nprogramming. Genetic programming and evolvable machines, 11(3-4),\r\n251\u2013284, 2010.\r\n[26] Kunze, O. Replicators, ground drones and crowd logistics a vision of\r\nurban logistics in the year 2030. Transportation Research Procedia,\r\n19:286\u2013299, 2016.\r\n[27] Laporte, G. Fifty years of vehicle routing. Transportation science, 43(4),\r\n408\u2013416, 2009.\r\n[28] Laporte, G., Nobert, Y. and Desrochers, M. Optimal routing\r\nunder capacity and distance restrictions. Operations research, 33(5),\r\n1050\u20131073, 1985.\r\n[29] Lu, H., Zhang, X. and Yang, S. A Learning-based Iterative Method\r\nfor Solving Vehicle Routing Problems. In: International Conference on\r\nLearning Representations, 2019.\r\n[30] Magrassi, P., Panarella, A., Deighton, N. and Johnson, G. (2001),\r\nComputers to acquire control of the physical world, Gartner research\r\nreport T-14-0301.\r\n[31] Mao, C. and Shen, Z. A reinforcement learning framework for\r\nthe adaptive routing problem in stochastic time-dependent network.\r\nTransportation Research Part C: Emerging Technologies, 93, 179\u2013197,\r\n2018.\r\n[32] Nazari, M., Oroojlooy, A., Snyder, L. and Tak\u00b4ac, M. Reinforcement\r\nlearning for solving the vehicle routing problem. In: Advances in Neural\r\nInformation Processing Systems, pp. 9839\u20139849, 2018.\r\n[33] Potvin, J.Y., Lapalme, G. and Rousseau, J.M. Integration of AI and OR\r\ntechniques for computer-aided algorithmic design in the vehicle routing\r\ndomain. Journal of the Operational Research Society, 41(6), 517\u2013525,\r\n1990.\r\n[34] Reischel, G. Die Post macht den Kofferraum zum Briefkasten. Future\r\nzone Technology News, 2015.\r\n[35] Renaud, J., Boctor, F.F. and Laporte, G. An improved petal heuristic\r\nfor the vehicle routeing problem. Journal of the operational Research\r\nSociety, 47(2), 329\u2013336, 1996.\r\n[36] Schilde, M., Doerner, K.F. and Hartl, R.F. Integrating stochastic\r\ntime-dependent travel speed in solution methods for the dynamic\r\ndial-a-ride problem. European journal of operational research, 238(1),\r\n18\u201330, 2014.\r\n[37] Secomandi, N. Comparing neuro-dynamic programming algorithms for\r\nthe vehicle routing problem with stochastic demands. Computers &\r\nOperations Research, 27(11-12), 1201\u20131225, 2000.\r\n[38] T-systems. Big Data in Logistics, 2020.\r\n[39] Teng, S.H. Scalable algorithms for data and network analysis.\r\nFoundations and Trends in Theoretical Computer Science, 12(1-2),\r\n1\u2013274, 2016.\r\n[40] Thomas, B.W. Waiting strategies for anticipating service requests from\r\nknown customer locations. Transportation Science, 41(3), 319\u2013331,\r\n2007.\r\n[41] Thompson, P.M. and Psaraftis, H.N. Cyclic transfer algorithm for\r\nmultivehicle routing and scheduling problems. Operations Research,\r\n41(5), 935\u2013946, 1993.\r\n[42] Toth, P. and Vigo, D. (Eds.). Vehicle routing: problems, methods, and\r\napplications. Society for Industrial and Applied Mathematics, 2014.\r\n[43] Ulmer, M.W., Mattfeld, D.C. and K\u00a8oster, F. Budgeting time for dynamic\r\nvehicle routing with stochastic customer requests. Transportation\r\nScience, 52(1), 20\u201337, 2018.\r\n[44] Voccia, S.A., Campbell, A.M. and Thomas, B.W. The same-day delivery\r\nproblem for online purchases. Transportation Science, 53(1), 167\u2013184,\r\n2019.\r\n[45] Wei, L., Zhang, Z., Zhang, D. and Leung, S.C. A simulated\r\nannealing algorithm for the capacitated vehicle routing problem with\r\ntwo-dimensional loading constraints. European Journal of Operational\r\nResearch, 265(3), 843.-859, 2018.\r\n[46] Wei, L., Zhang, Z., Zhang, D. and Lim, A. A variable neighborhood\r\nsearch for the capacitated vehicle routing problem with two-dimensional\r\nloading constraints. European Journal of Operational Research, 243(3),\r\n798\u2013814, 2015.\r\n[47] Yu, J.J.Q., Yu, W. and Gu, J. Online vehicle routing with neural\r\ncombinatorial optimization and deep reinforcement learning. IEEE\r\nTransactions on Intelligent Transportation Systems, 20(10), 3806\u20133817,\r\n2019.","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 171, 2021"}