How to cite this paper
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.
Refrences
Alinaghian, M., Zamanlou, K., & Sabbagh, M. S. (2017). A bi-objective mathematical model for two-dimensional loading time-dependent vehicle routing problem. Journal of the Operational Research Society, 68(11), 1422–1441.
Baldi, M. M., Perboli, G., & Tadei, R. (2012). The three-dimensional knapsack problem with balancing constraints. Applied Mathematics and Computation, 218(19), 9802–9818.
Bischoff, E. E., & Ratcliff, M. S. W. (1995). Issues in the development of approaches to container loading. Omega, 23(4), 377–390.
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.
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., & Wäscher, G. (2013). Constraints in container loading - A state-of-the-art review. European Journal of Operational Research, 229(1), 1–20.
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2014). Rich vehicle routing problem. ACM Computing Surveys, 47(2), 1–28.
Ceschia, S., Schaerf, A., Stützle, T., & Stuzle, T. (2013). Local search techniques for a routing-packing problem. Computers & Industrial Engineering, 66(4), 1138–1149.
Christofides, N., & Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30–44.
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.
Cui, Y. (2007). Exact algorithm for generating two-segment cutting patterns of punched strips. Applied Mathematical Modelling, 31(9), 1865–1873.
Davies, A. P., & Bischoff, E. E. (1999). Weight distribution considerations in container loading. European Journal of Operational Research, 114(3), 509–527.
Dominguez, O., Guimarans, D., Juan, A. A., & de la Nuez, I. (2016a). A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. European Journal of Operational Research, 255(2), 442–462.
Dominguez, O., Juan, A. A., Barrios, B., Faulin, J., & Agustin, A. (2016b). Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet. Annals of Operations Research, 236(2), 383–404.
Dominguez, O., Juan, A. A., de la Nuez, I., & Ouelhadj, D. (2016c). An ILS-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation. Journal of the Operational Research Society, 67, 37–53.
Dominguez, O., Juan, A. A., & Faulin, J. (2014). A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations. International Transactions in Operational Research, 21(3), 375–398.
Egeblad, J., Garavelli, C., Lisi, S., & Pisinger, D. (2010). Heuristics for container loading of furniture. European Journal of Operational Research, 200(3), 881–892.
Eley, M. (2002). Solving container loading problems by block arrangement. European Journal of Operational Research, 141(2), 393–409.
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.
García-Cáceres, R. G., Vega-Mejía, C. A., & Caballero-Villalobos, J. P. (2011). Integral optimization of the container loading problem. In I. Dritsas (Ed.), Stochastic Optimization - Seeing the Optimal for the Uncertain (1st ed., pp. 225–254). Rijeka, Croatia: InTech.
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.
Guimarans, D., Dominguez, O., Juan, A. A., & Martinez, E. (2016). A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem. In T. Roede, P. Frazier, R. Szechtman, & E. Zhou (Eds.), 2016 Winter Simulation Conference (WSC) (pp. 2326–2334). Washington, US: IEEE Publishing.
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(May), 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.
Iori, M., & Martello, S. (2010). Routing problems with loading constraints. Top, 18(1), 4–27.
Iori, M., & Riera-Ledesma, J. (2015). Exact algorithms for the double vehicle routing problem with multiple stacks. Computers & Operations Research, 63, 83–101.
Juan, A. A., Faulin, J., Grasman, S. E., Rabe, M., & Figueira, G. (2015). A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems. Operations Research Perspectives, 2, 62–72.
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.
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.
Koch, H., Bortfeldt, A., & Wäscher, G. (2018). A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints. OR Spectrum, 40, 1029–1075.
Kramer, R., Subramanian, A., Vidal, T., & Cabral, L. dos A. F. (2015). A matheuristic approach for the pollution-routing problem. European Journal of Operational Research, 243(2), 523–539.
Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408–416.
Lim, A., Ma, H., Qiu, C., & Zhu, W. (2013). The single container loading problem with axle weight constraints. International Journal of Production Economics, 144(1), 358–369.
Lin, C., Choy, K. L., Ho, G. T. S., Chung, S. H., & Lam, H. Y. (2014). Survey of green vehicle routing problem: Past and future trends. Expert Systems with Applications, 41(4), 1118–1138.
Mehrjerdi, Y. Z. (2014). A multiple objective stochastic approach to vehicle routing problem. International Journal of Advanced Manufacturing Technology, 74(5–8), 1149–1158.
Montoya-Torres, J. R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79, 115–129.
Moura, A., & Oliveira, J. F. (2009). An integrated approach to the vehicle routing and container loading problems. Or Spectrum, 31(4), 775–800.
Pisinger, D. (2002). Heuristics for the container loading problem. European Journal of Operational Research, 141(2), 382–392.
Ramos, A. G., Silva, E., & Oliveira, J. F. (2018). A new load balance methodology for container loading problem in road transportation. European Journal of Operational Research, 266(3), 1140–1152.
Resende, M. G. C., & Ribeiro, C. C. (2010). Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (2nd ed., pp. 283–319). New York, NY: Springer New York.
Sicilia, J. A., Quemada, C., Royo, B., & Escuin, D. (2016). An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics. Journal of Computational and Applied Mathematics, 291, 468–477.
Tricoire, F., Doerner, K. F., Hartl, R. F., & Iori, M. (2011). Heuristic and exact algorithms for the multi-pile vehicle routing problem. Or Spectrum, 33(4), 931–959.
Vega-Mejía, C. A., & Montoya-Torres, J. R. (2017). A Hybrid Heuristic for a Balanced Vehicle Routing Problem with Time Windows and Loading Constraints. In A. Duarte, A. Viana, A. A. Juan, B. Mélian, & H. Ramalhinho (Eds.), MIC 2017 - 12th Metaheuristics International Conference (pp. 617–626). Barcelona, Es: Universitat Pompeu Fabra. Retrieved from http://mic2017.upf.edu/proceedings/
Vega-Mejía, C. A., Montoya-Torres, J. R., & Islam, S. M. N. (2019a). A nonlinear optimization model for the balanced vehicle routing problem with loading constraints. International Transactions in Operational Research, 26(3), 794–835.
Vega-Mejía, C. A., Montoya-Torres, J. R., & Islam, S. M. N. (2019b). Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review. Annals of Operations Research, 273(Operations Research for Transportation), 311–375.
Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109–1130.
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2013). Designing vehicle routes for a mix of different request types, under time windows and loading constraints. European Journal of Operational Research, 229(2), 303–317.
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2016). The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints. European Journal of Operational Research, 251(2), 369–386.
Zhang, D., Cai, S., Ye, F., Si, Y.-W., & Nguyen, T. T. (2017). A hybrid algorithm for a vehicle routing problem with realistic constraints. Information Sciences, 394, 167–182.
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.
Baldi, M. M., Perboli, G., & Tadei, R. (2012). The three-dimensional knapsack problem with balancing constraints. Applied Mathematics and Computation, 218(19), 9802–9818.
Bischoff, E. E., & Ratcliff, M. S. W. (1995). Issues in the development of approaches to container loading. Omega, 23(4), 377–390.
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.
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., & Wäscher, G. (2013). Constraints in container loading - A state-of-the-art review. European Journal of Operational Research, 229(1), 1–20.
Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D., & Juan, A. A. (2014). Rich vehicle routing problem. ACM Computing Surveys, 47(2), 1–28.
Ceschia, S., Schaerf, A., Stützle, T., & Stuzle, T. (2013). Local search techniques for a routing-packing problem. Computers & Industrial Engineering, 66(4), 1138–1149.
Christofides, N., & Whitlock, C. (1977). An algorithm for two-dimensional cutting problems. Operations Research, 25(1), 30–44.
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.
Cui, Y. (2007). Exact algorithm for generating two-segment cutting patterns of punched strips. Applied Mathematical Modelling, 31(9), 1865–1873.
Davies, A. P., & Bischoff, E. E. (1999). Weight distribution considerations in container loading. European Journal of Operational Research, 114(3), 509–527.
Dominguez, O., Guimarans, D., Juan, A. A., & de la Nuez, I. (2016a). A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. European Journal of Operational Research, 255(2), 442–462.
Dominguez, O., Juan, A. A., Barrios, B., Faulin, J., & Agustin, A. (2016b). Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet. Annals of Operations Research, 236(2), 383–404.
Dominguez, O., Juan, A. A., de la Nuez, I., & Ouelhadj, D. (2016c). An ILS-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation. Journal of the Operational Research Society, 67, 37–53.
Dominguez, O., Juan, A. A., & Faulin, J. (2014). A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations. International Transactions in Operational Research, 21(3), 375–398.
Egeblad, J., Garavelli, C., Lisi, S., & Pisinger, D. (2010). Heuristics for container loading of furniture. European Journal of Operational Research, 200(3), 881–892.
Eley, M. (2002). Solving container loading problems by block arrangement. European Journal of Operational Research, 141(2), 393–409.
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.
García-Cáceres, R. G., Vega-Mejía, C. A., & Caballero-Villalobos, J. P. (2011). Integral optimization of the container loading problem. In I. Dritsas (Ed.), Stochastic Optimization - Seeing the Optimal for the Uncertain (1st ed., pp. 225–254). Rijeka, Croatia: InTech.
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.
Guimarans, D., Dominguez, O., Juan, A. A., & Martinez, E. (2016). A multi-start simheuristic for the stochastic two-dimensional vehicle routing problem. In T. Roede, P. Frazier, R. Szechtman, & E. Zhou (Eds.), 2016 Winter Simulation Conference (WSC) (pp. 2326–2334). Washington, US: IEEE Publishing.
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(May), 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.
Iori, M., & Martello, S. (2010). Routing problems with loading constraints. Top, 18(1), 4–27.
Iori, M., & Riera-Ledesma, J. (2015). Exact algorithms for the double vehicle routing problem with multiple stacks. Computers & Operations Research, 63, 83–101.
Juan, A. A., Faulin, J., Grasman, S. E., Rabe, M., & Figueira, G. (2015). A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems. Operations Research Perspectives, 2, 62–72.
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.
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.
Koch, H., Bortfeldt, A., & Wäscher, G. (2018). A hybrid algorithm for the vehicle routing problem with backhauls, time windows and three-dimensional loading constraints. OR Spectrum, 40, 1029–1075.
Kramer, R., Subramanian, A., Vidal, T., & Cabral, L. dos A. F. (2015). A matheuristic approach for the pollution-routing problem. European Journal of Operational Research, 243(2), 523–539.
Laporte, G. (2009). Fifty years of vehicle routing. Transportation Science, 43(4), 408–416.
Lim, A., Ma, H., Qiu, C., & Zhu, W. (2013). The single container loading problem with axle weight constraints. International Journal of Production Economics, 144(1), 358–369.
Lin, C., Choy, K. L., Ho, G. T. S., Chung, S. H., & Lam, H. Y. (2014). Survey of green vehicle routing problem: Past and future trends. Expert Systems with Applications, 41(4), 1118–1138.
Mehrjerdi, Y. Z. (2014). A multiple objective stochastic approach to vehicle routing problem. International Journal of Advanced Manufacturing Technology, 74(5–8), 1149–1158.
Montoya-Torres, J. R., López Franco, J., Nieto Isaza, S., Felizzola Jiménez, H., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79, 115–129.
Moura, A., & Oliveira, J. F. (2009). An integrated approach to the vehicle routing and container loading problems. Or Spectrum, 31(4), 775–800.
Pisinger, D. (2002). Heuristics for the container loading problem. European Journal of Operational Research, 141(2), 382–392.
Ramos, A. G., Silva, E., & Oliveira, J. F. (2018). A new load balance methodology for container loading problem in road transportation. European Journal of Operational Research, 266(3), 1140–1152.
Resende, M. G. C., & Ribeiro, C. C. (2010). Greedy randomized adaptive search procedures: Advances, hybridizations, and applications. In M. Gendreau & J.-Y. Potvin (Eds.), Handbook of Metaheuristics (2nd ed., pp. 283–319). New York, NY: Springer New York.
Sicilia, J. A., Quemada, C., Royo, B., & Escuin, D. (2016). An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics. Journal of Computational and Applied Mathematics, 291, 468–477.
Tricoire, F., Doerner, K. F., Hartl, R. F., & Iori, M. (2011). Heuristic and exact algorithms for the multi-pile vehicle routing problem. Or Spectrum, 33(4), 931–959.
Vega-Mejía, C. A., & Montoya-Torres, J. R. (2017). A Hybrid Heuristic for a Balanced Vehicle Routing Problem with Time Windows and Loading Constraints. In A. Duarte, A. Viana, A. A. Juan, B. Mélian, & H. Ramalhinho (Eds.), MIC 2017 - 12th Metaheuristics International Conference (pp. 617–626). Barcelona, Es: Universitat Pompeu Fabra. Retrieved from http://mic2017.upf.edu/proceedings/
Vega-Mejía, C. A., Montoya-Torres, J. R., & Islam, S. M. N. (2019a). A nonlinear optimization model for the balanced vehicle routing problem with loading constraints. International Transactions in Operational Research, 26(3), 794–835.
Vega-Mejía, C. A., Montoya-Torres, J. R., & Islam, S. M. N. (2019b). Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review. Annals of Operations Research, 273(Operations Research for Transportation), 311–375.
Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109–1130.
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2013). Designing vehicle routes for a mix of different request types, under time windows and loading constraints. European Journal of Operational Research, 229(2), 303–317.
Zachariadis, E. E., Tarantilis, C. D., & Kiranoudis, C. T. (2016). The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints. European Journal of Operational Research, 251(2), 369–386.
Zhang, D., Cai, S., Ye, F., Si, Y.-W., & Nguyen, T. T. (2017). A hybrid algorithm for a vehicle routing problem with realistic constraints. Information Sciences, 394, 167–182.
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.