Optimization and Machine Learning. Patrick Siarry

T. and Imreh, C. (2011). Pickup and delivery vehicle routing with multidimensional loading constraints. Acta Cybernetica, 20, 17–33.

      Bortfeldt, A. (2012). A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Computers & Operations Research, 39(9), 2248–2257.

      Bortfeldt, A. and Homberger, J. (2013). Packing first, routing second: A heuristic for the vehicle routing and loading problem. Computers & Operations Research, 40(3), 873–885.

Bortfeldt, A. and Yi, J. (2020). The split delivery vehicle routing problem with three-dimensional loading constraints. European Journal of Operational Research, 282(2), 545–558.

      Bortfeldt, A., Hahn, T., Mannel, D., Monch, L. (2015). Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints. European Journal of Operational Research, 243, 82–96.

      Ceschia, S., Schaerf, A., Stutzle, T. (2013). Local search techniques for a routing-packing problem. Computers & Industrial Engineering, 66(4), 1138–1149.

      Christofides, N. and Beasley, J. (1984). The period routing problem. Networks, 14, 237–256.

      Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F. (2002). A guide to vehicle routing heuristics. Journal of the Operational Research Society, 53(5), 512–522.

      Cote, J.F., Gendreau, M., Potvin, J.Y. (2013). The Vehicle Routing Problem with Stochastic Two-Dimensional Items. CIRRELT, Quebec.

      Cote, J.F., Gendreau, M., Potvin, J.Y. (2020). The vehicle routing problem with stochastic two-dimensional items. Transportation Science, 54(2), 453–469.

      Dominguez, O., Guimarans, D., Juan, A.A., de la Nuez, I. (2016). A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. European Journal of Operational Research, 255(2), 442–462.

      Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H. (2011). A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research, 38, 617–640.

      Fekete, S.P. and Schepers, J. (2004). A general framework for bounds for higher-dimensional orthogonal packing problems. Mathematical Methods of Operations Research, 60(2), 311–329.

      Fisher, M., Jakumar, R., van Wassenhove, L. (1981). A generalized assignment heuristic for vehicle routing. Networks, 11, 109–124.

      Fuellerer, G., Doerner, K., Hartl, R., Iori, M. (2009). Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research, 36, 655–673.

      Fuellerer, G., Doerner, K.F., Hartl, R.F., Iori, M. (2010). Metaheuristics for vehicle routing problems with three-dimensional loading constraints. European Journal of Operational Research, 201(3), 751–759.

Gendreau, M., Iori, M., Laporte, G., Martello, S. (2006). A Tabu search algorithm for a routing and container loading problem. Transportation Science, 40(3), 342–350.

      Gendreau, M., Iori, M., Laporte, G., Martello, S. (2008). A Tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks, 51, 4–18.

      Guimarans, D., Dominguez, O., Panadero, J., Juan, A.A. (2018). A simheuristic approach for the two-dimensional vehicle routing problem with stochastic travel times. Simulation Modelling Practice and Theory, 89, 1–14.

      Hokama, P., Miyazawa, F.K., Xavier, E.C. (2016). A branch-and-cut approach for the vehicle routing problem with loading constraints. Expert Systems with Applications, 47, 1–13.

      Holland, J.H. and Holland, J.H. (1975). Adaptations in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. The University of Michigan Press, Ann Arbor.

      Iori, M. and Martello, S. (2010). Routing problems with loading constraints. Top, 18(1), 4–27.

      Iori, M., Salazar, J.J., Vigo, D. (2007). An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science, 41, 253–264.

      Junqueira, L., Oliveira, J.F., Carravilla, M.A., Morabito, R. (2013). An optimization model for the vehicle routing problem with practical three-dimensional loading constraints. International Transactions in Operational Research, 20(5), 645–666.

      Khebbache, S., Prins, C., Yalaoui, A. (2008). Iterated local search algorithm for the constrained two-dimensional non-guillotine cutting problem. Journal of Industrial and Systems Engineering, 2(3), 164–179.

      Khebbache-Hadji, S., Prins, C., Yalaoui, A., Reghioui, M. (2013). Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows. Central European Journal of Operations Research, 21(2), 307–336.

      Kilby, P., Prosser, P., Shaw, P. (1998). Dynamic VRPs: A study of scenarios. Technical Report, University of Strathclyde, Glasgow.

      Koch, H., Bortfeldt, A., Wascher, G. (2018). A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints. OR Spectrum, 40, 1029–1075.

      Koch, H., Schlogell, M., Bortfeldt, A. (2020). A hybrid algorithm for the vehicle routing problem with three-dimensional loading constraints and mixed backhauls. Journal of Scheduling, 23(1), 71–93.

Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408–416.

      Leung, S., Zhou, X., Zhang, D., Zheng, J. (2011). Extended guided Tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research, 38(1), 205–215.

      Leung, S., Zhang, Z., Zhang, D., Hua, X., Lim, M. (2013). A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Computers & Operations Research, 225, 199–210.

      Li, X., Yuan, M., Chen, D., Yao, J., Zeng, J. (2018). A data-driven three-layer algorithm for split delivery vehicle routing problem with 3D container loading constraint. In Proceedings of the KDD’18: The 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. ACM, London.

      Malapert, A., Guéret, C., Jussien, N., Langevin, A., Rousseau, L.M. (2008). Two-dimensional pickup and delivery routing problem with loading constraints. In First CPAIOR Workshop on Bin Packing and Placement Constraints (BPPC’08), Paris.

      Mannel, D. and Bortfeldt, A. (2016). A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints. European Journal of Operational Research, 254(3), 840–858.

      Massen, F., Deville, Y., Van Hentenryck, P. (2012). Pheromone-based heuristic column generation for vehicle routing problems with black box feasibility. In International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming. Springer, Heidelberg.

      Miao, L., Ruan, Q., Woghiren, K., Ruo, Q. (2012). A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints. RAIRO-Operations Research – Recherche Opérationnelle, 46(1), 63–82.

      Moura, A. (2008). A multi-objective genetic algorithm for the vehicle routing with time windows and loading problem. In Intelligent Decision Support, Bortfeldt, D.A., Homberger, P.D.J., Kopfer, P.D.H., Pankratz, G., Strangmeier, D.R. (eds). Gabler, Wiesbaden.

      Moura, A. (2019). A model-based heuristic to the vehicle routing and loading problem. International Transactions in Operational Research, 26(3), 888–907.

      Moura, A. and Oliveira, J.F. (2009). An integrated approach to the vehicle routing and container loading problems. OR Spectrum,