Bernal, J., Escobar, J. W., Paz, J. C., Linfati, R., & Gatica, G. (2018). A probabilistic granular tabu search for the distance constrained capacitated vehicle routing problem. International Journal of Industrial and Systems Engineering, 29(4), 453-477.
Bernal, J., Escobar, J. W., & Linfati, R. (2021). A simulated annealing-based approach for a real case study of vehicle routing problem with a heterogeneous fleet and time windows. International Journal of Shipping and Transport Logistics, 13(1-2), 185-204.
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., & 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., Hahn, T., Männel, D., & Mönch, L. (2015). Hybrid algorithms for the vehicle routing problem with clustered backhauls and 3D loading constraints. European Journal of Operational Research, 243(1), 82-96.
Cuellar-Usaquén, D., Gomez, C. and Álvarez-Martínez, D. (2022), A GRASP/Path-Relinking algorithm for the traveling purchaser problem. International Transaction in Operations Research. https://doi.org/10.1111/itor.12985
Escobar, J. W. (2012). Rediseño de una red de distribución con variabilidad de demanda usando la metodología de escenarios. Revista Facultad de Ingeniería, 21(32), 9-19.
Escobar, J. W., Bravo, J. J., & Vidal, C. J. (2012). Optimización de redes de distribución de productos de consumo masivo en condiciones de riesgo. In Proceedings of XXXIII Congreso Nacional de Estadística e Investigación Operativa (SEIO), Madrid, Spain.
Escobar, J. W., Bravo, J. J., & Vidal, C. J. (2013a). Optimización de una red de distribución con parámetros estocásticos usando la metodología de aproximación por promedios muestrales. Revista Científica Ingeniería y Desarrollo, 31(1), 135-160.
Escobar, J. W., Linfati, R., & Toth, P. (2013b). A two-phase hybrid heuristic algorithm for the capacitated location-routing problem. Computers & Operations Research, 40(1), 70-79.
Escobar, J. W., Linfati, R., Toth, P., & Baldoquin, M. G. (2014a). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of heuristics, 20(5), 483-509.
Escobar, J. W., Linfati, R., Baldoquin, M. G., & Toth, P. (2014b). A Granular Variable Tabu Neighborhood Search for the capacitated location-routing problem. Transportation Research Part B: Methodological, 67, 344-356.
Escobar, L. M., Martínez, D. Á., Escobar, J. W., Linfati, R., & Mauricio, G. E. (2015). A hybrid metaheuristic approach for the capacitated vehicle routing problem with container loading constraints. In 2015 International Conference on Industrial Engineering and Systems Management (IESM) (pp. 1374-1382). IEEE.
Escobar-Falcón, L. M., Álvarez-Martínez, D., Granada-Echeverri, M., Escobar, J. W., & Romero-Lázaro, R. A. (2016). A matheuristic algorithm for the three-dimensional loading capacitated vehicle routing problem (3L-CVRP). Revista Facultad de Ingeniería Universidad de Antioquia, 78, 09-20.
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.
Garey, M. R. & Johnson, D. S (1979). Computers and Intractability: A guide to the theory of NP completeness, W. H. Freeman and co., New York.
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.
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.
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.
Junqueira, L., & Morabito, R. (2015). Heuristic algorithms for a three-dimensional loading capacitated vehicle routing problem in a carrier. Computers & Industrial Engineering, 88, 110-130.
Lacomme, P., Toussaint, H., & Duhamel, C. (2013). A GRASP× ELS for the vehicle routing problem with basic three-dimensional loading constraints. Engineering Applications of Artificial Intelligence, 26(8), 1795-1810.
Linfati, R., Escobar, J. W., & Cuevas, B. (2014). An algorithm based on granular tabu search for the problem of balancing public bikes by using multiple vehicles. Dyna, 81(186), 284-294.
Linfati, R., & Escobar, J. W. (2018). Reoptimization heuristic for the capacitated vehicle routing problem. Journal of Advanced Transportation, 2018.
Mahvash, B., Awasthi, A., & Chauhan, S. (2017). A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints. International Journal of Production Research, 55(6), 1730-1747.
Mak-Hau, V., Moser, I., & Aleti, A. (2018). An exact algorithm for the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints. In Data and Decision Sciences in Action (pp. 91-101). Springer, Cham.
Männel, D., & 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.
Martínez, D. A., Alvarez-Valdes, R., & Parreño, F. (2015). A grasp algorithm for the container loading problem with multi-drop constraints. Pesquisa Operacional, 35(1), 1-24.
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.
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.
Paz, J., Orozco, J., Salinas, J., Buriticá, N., & Escobar, J. (2015). Redesign of a supply network by considering stochastic demand. International Journal of Industrial Engineering Computations, 6(4), 521-528.
Pinto, T., Alves, C., & de Carvalho, J. V. (2015). Exploring a Column Generation Approach for a Routing Problem with Sequential Packing Constraints. In Operations Research and Big Data (pp. 159-166). Springer, Cham.
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.
Tao, Y., & Wang, F. (2010). A new packing heuristic based algorithm for vehicle routing problem with three-dimensional loading constraints. In 2010 IEEE International Conference on Automation Science and Engineering (pp. 972-977). IEEE.
Tarantilis, C. D., Zachariadis, E. E., & Kiranoudis, C. T. (2009). A hybrid metaheuristic algorithm for the integrated vehicle routing and three-dimensional container-loading problem. IEEE Transactions on Intelligent Transportation Systems, 10(2), 255-271.
Vega-Mejía, C., González-Neira, E., Montoya-Torres, J., & Islam, S. (2020). Using a hybrid heuristic to solve the balanced vehicle routing problem with loading constraints. International Journal of Industrial Engineering Computations, 11(2), 255-280.
Wei, L., Zhang, Z., Zhang, D., & Leung, S. C. (2018). A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research, 265(3), 843-859.
Zhang, Z., Wei, L., & Lim, A. (2015). An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints. Transportation Research Part B: Methodological, 82, 20-35.