Patrick Siarry - Optimization and Machine Learning

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 , 31(4), 775–800.

Pace, S., Turky, A., Moser, I., Aleti, A. (2015). Distributing fibre boards: A practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. Procedia Computer Science , 51, 2257–2266.

Pinto, T., Alves, C., de Carvalho, J.V., Moura, A. (2015). An insertion heuristic for the capacitated vehicle routing problem with loading constraints and mixed linehauls and backhauls. FME Transactions , 43(4), 311–318.

Pinto, T., Alves, C., de Carvalho, J.V. (2017). Variable neighborhood search algorithms for pickup and delivery problems with loading constraints. Electronic Notes in Discrete Mathematics , 58, 111–118.

Pinto, T., Alves, C., de Carvalho, J.V. (2020). Variable neighborhood search algorithms for the vehicle routing problem with two-dimensional loading constraints and mixed linehauls and backhauls. International Transactions in Operational Research , 27(1), 549–572.

Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S. (2015). Vehicle routing problems with loading constraints: State-of-the-art and future directions. OR Spectrum , 37(2), 297–330.

Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S. (2017). Iterated local search for the capacitated vehicle routing problem with sequence: Based pallet loading and axle weight constraints. Networks , 69(3), 304–316.

Pugliese, L.D.P., Guerriero, F., Calbi, R. (2019). Solving a three-dimensional bin-packing problem arising in the groupage process: Application to the port of Gioia Tauro. In A View of Operations Research Applications in Italy , Dell’Amico, M., Gaudioso, M., Stecca, G. (eds). Springer, Cham.

Reil, S., Bortfeldt, A., Monch, L. (2018). Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints. European Journal of Operational Research , 266(3), 877–894.

Ren, J., Tian, Y., Sawaragi, T. (2011). A relaxation method for the three-dimensional loading capacitated vehicle routing problem. In 2011 IEEE/SICE International Symposium on System Integration (SII) , IEEE, 750–755.

Ruan, Q., Zhang, Z., Miao, L., Shen, H. (2013). A hybrid approach for the vehicle routing problem with three-dimensional loading constraints. Computers & Operations Research , 40(6), 1579–1589.

Sabar, N.R., Bhaskar, A., Chung, E., Turky, A., Song, A. (2020). An adaptive memetic approach for heterogeneous vehicle routing problems with two-dimensional loading constraints. Swarm and Evolutionary Computation , 100730.

Sbai, I. and Krichen, S. (2019). A hybrid PSO-LS approach for solving the two-dimensional bin packing problem with weight capacities constraint: A case study. In Proceedings of the 9th International Conference on Information Systems and Technologies . Association for Computing Machinery, NY, United States and Cairo, Egypt.

Sbai, I., Limem, O., Krichen, S. (2017). An adaptive genetic algorithm for the capacitated vehicle routing problem with time windows and two-dimensional loading constraints. In Computer Systems and Applications (AICCSA), 2017 IEEE/ACS 14th International Conference , IEEE.

Sbai, I., Krichen, S., Limam, O. (2020a). Two meta-heuristics for solving the capacitated vehicle routing problem: The case of the Tunisian Post Office. Operational Research , ISO 690.