How to cite this paper
Herrera-Cobo, J., Escobar, J & Álvarez-Martínez, D. (2023). Metaheuristic algorithm for the location, routing and packing problem in the collection of recyclable waste.International Journal of Industrial Engineering Computations , 14(1), 157-172.
Refrences
Abdulkader, M. M., Gajpal, Y., & ElMekkawy, T. Y. (2015). Hybridized ant colony algorithm for the multi compartment vehicle routing problem. Applied Soft Computing, 37, 196-203.
Adil, N., & Lakhbab, H. (2020). A Discrete Bat Algorithm for the Multi-Compartment Vehicle Routing Problem. In 2020 IEEE 6th International Conference on Optimization and Applications (ICOA), pp. 1-5.
Bernal-Moyano, J. A., Escobar, J. W., Marín-Moreno, C., Linfati, R., & Gatica, G. (2017). A comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH). Dyna, 84(200), 193-201.
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.
Bolanos, R., Escobar, J., & Echeverri, M. (2018). A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet. International Journal of Industrial Engineering Computations, 9(4), 461 – 478.
Capelle, T., Cortés, C. E., Gendreau, M., Rey, P. A., & Rousseau, L. M. (2019). A column generation approach for location-routing problems with pickup and delivery. European Journal of Operational Research, 272(1), 121 – 131.
Caramia, M., & Guerriero, F. (2010). A milk collection problem with incompatibility constraints. Interfaces, 40(2), 130-143.
Chávez, J., Escobar, J., & Echeverri, M. (2016). A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls. International Journal of Industrial Engineering Computations, 7(1), 35 – 48.
Chen, J., & Shi, J. (2019). A multi-compartment vehicle routing problem with time windows for urban distribution–A comparison study on particle swarm optimization algorithms. Computers & Industrial Engineering, 133, 95-106.
Coelho, L. C., & Laporte, G. (2015). Classification, models and exact algorithms for multi-compartment delivery problems. European Journal of Operational Research, 242(3), 854-864.
Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013). Bin packing approximation algorithms: survey and classification. In Handbook of combinatorial optimization, pp. 455-531. Springer New York.
Dai, Z., Aqlan, F., Gao, K., & Zhou, Y. (2019). A two-phase method for multi-echelon location-routing problems in supply chains. Expert Systems with Applications, 115, 618-634.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80 – 91.
Dereli, T., & Daş, G. S. (2010). Development of a decision support system for solving container loading problems. Transport, 25(2), 138-147.
Dukkanci, O., Kara, B. Y., & Bektaş, T. (2019). The green location-routing problem. Computers & Operations Research, 105, 187 – 202.
El Fallahi, A., Prins, C., & Calvo, R. W. (2008). A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, 35(5), 1725-1741.
Escobar, J. W., & Linfati, R. (2012). Un algoritmo metaheurístico basado en recocido simulado con espacio de búsqueda granular para el problema de localización y ruteo con restricciones de capacidad. Revista Ingenierías Universidad de Medellín, 11(21), 139-150.
Escobar, J. W., Linfati, R., & Toth, P. (2013). 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, J. W., Linfati, R., & Adarme-Jaimes, W. (2015). A hybrid metaheuristic algorithm for the capacitated location routing problem. Dyna, 82(189), 243-251.
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.
Farrokhi-Asl, H., Makui, A., Jabbarzadeh, A., & Barzinpour, F. (2020). Solving a multi-objective sustainable waste collection problem considering a new collection network. Operational Research, 20(4), 1977-2015.
Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22(2), 340 – 349.
Golden, B. L., Magnanti, T. L., & Nguyen, H. Q. (1977). Implementing vehicle routing algorithms. Networks, 7(2), 113 –148.
Groër, C., Golden, B., & Wasil, E. (2010). A library of local search heuristics for the vehicle routing problem. Mathematical Programming Computation, 2(2), 79-101.
Gruler, A., Juan, A. A., Contreras-Bolton, C., & Gatica, G. (2015). A biased-randomized heuristic for the waste collection problem in smart cities. In International Forum for Interdisciplinary Mathematics, pp. 255-263. Springer, Cham.
Helsgaun, K. (2017), An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems. Technical Report, Roskilde University
Helsgaun, K. (2000). An effective implementation of the Lin–Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106-130.
Henke, T., Speranza, M. G., & Wäscher, G. (2015). The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research, 246(3), 730 – 743.
Herrera, J. S. (2020a). Instances and Results of LRP Algorithm. url: https://github.com/sebashc3712/ Instances_and_Results_of_LRP_Algorithm (visited 27-06-2020).
Herrera, J. S. (2020b). LRP Algorithm with GRASP. url: https://github.com/sebashc3712/LRP_ Algorithm (visitado 27-06-2020).
Herrera, J. S. (2020c). LRP Algorithm without GRASP. url: https://github.com/sebashc3712/LR_ Algorithm (visitado 27-06-2020).
Hübner, A., & Ostermeier, M. (2019). A multi-compartment vehicle routing problem with loading and unloading costs. Transportation Science, 53(1), 282-300.
Kaya, O., & Ozkok, D. (2018). A network design problem with location, inventory and routing decisions. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 139-140.
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, 1 – 8.
Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241-252.
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.
Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2010). A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research, 37(11), 1886-1898.
Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470 – 483.
Raft, O. M. (1982). A modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research, 11(1), 67 – 76.
Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.
Silvestrin, P. V., & Ritt, M. (2017). An iterated tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, 81, 192-202.
Vincent, F. Y., Lin, S. W., Lee, W., & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288 – 299.
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.
Wheeler, K. (2013). The Largest Environmental Movement: Recycling and Consumption Work in Sweden.
Wren, A., & Holliday, A. (1972). Computer scheduling of vehicles from one or more depots to a number of delivery points. Journal of the Operational Research Society, 23(3), 333 – 344.
Adil, N., & Lakhbab, H. (2020). A Discrete Bat Algorithm for the Multi-Compartment Vehicle Routing Problem. In 2020 IEEE 6th International Conference on Optimization and Applications (ICOA), pp. 1-5.
Bernal-Moyano, J. A., Escobar, J. W., Marín-Moreno, C., Linfati, R., & Gatica, G. (2017). A comparison of trajectory granular based algorithms for the location-routing problem with heterogeneous fleet (LRPH). Dyna, 84(200), 193-201.
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.
Bolanos, R., Escobar, J., & Echeverri, M. (2018). A metaheuristic algorithm for the multi-depot vehicle routing problem with heterogeneous fleet. International Journal of Industrial Engineering Computations, 9(4), 461 – 478.
Capelle, T., Cortés, C. E., Gendreau, M., Rey, P. A., & Rousseau, L. M. (2019). A column generation approach for location-routing problems with pickup and delivery. European Journal of Operational Research, 272(1), 121 – 131.
Caramia, M., & Guerriero, F. (2010). A milk collection problem with incompatibility constraints. Interfaces, 40(2), 130-143.
Chávez, J., Escobar, J., & Echeverri, M. (2016). A multi-objective Pareto ant colony algorithm for the Multi-Depot Vehicle Routing problem with Backhauls. International Journal of Industrial Engineering Computations, 7(1), 35 – 48.
Chen, J., & Shi, J. (2019). A multi-compartment vehicle routing problem with time windows for urban distribution–A comparison study on particle swarm optimization algorithms. Computers & Industrial Engineering, 133, 95-106.
Coelho, L. C., & Laporte, G. (2015). Classification, models and exact algorithms for multi-compartment delivery problems. European Journal of Operational Research, 242(3), 854-864.
Coffman, E. G., Csirik, J., Galambos, G., Martello, S., & Vigo, D. (2013). Bin packing approximation algorithms: survey and classification. In Handbook of combinatorial optimization, pp. 455-531. Springer New York.
Dai, Z., Aqlan, F., Gao, K., & Zhou, Y. (2019). A two-phase method for multi-echelon location-routing problems in supply chains. Expert Systems with Applications, 115, 618-634.
Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management Science, 6(1), 80 – 91.
Dereli, T., & Daş, G. S. (2010). Development of a decision support system for solving container loading problems. Transport, 25(2), 138-147.
Dukkanci, O., Kara, B. Y., & Bektaş, T. (2019). The green location-routing problem. Computers & Operations Research, 105, 187 – 202.
El Fallahi, A., Prins, C., & Calvo, R. W. (2008). A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, 35(5), 1725-1741.
Escobar, J. W., & Linfati, R. (2012). Un algoritmo metaheurístico basado en recocido simulado con espacio de búsqueda granular para el problema de localización y ruteo con restricciones de capacidad. Revista Ingenierías Universidad de Medellín, 11(21), 139-150.
Escobar, J. W., Linfati, R., & Toth, P. (2013). 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, J. W., Linfati, R., & Adarme-Jaimes, W. (2015). A hybrid metaheuristic algorithm for the capacitated location routing problem. Dyna, 82(189), 243-251.
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.
Farrokhi-Asl, H., Makui, A., Jabbarzadeh, A., & Barzinpour, F. (2020). Solving a multi-objective sustainable waste collection problem considering a new collection network. Operational Research, 20(4), 1977-2015.
Gillett, B. E., & Miller, L. R. (1974). A heuristic algorithm for the vehicle-dispatch problem. Operations Research, 22(2), 340 – 349.
Golden, B. L., Magnanti, T. L., & Nguyen, H. Q. (1977). Implementing vehicle routing algorithms. Networks, 7(2), 113 –148.
Groër, C., Golden, B., & Wasil, E. (2010). A library of local search heuristics for the vehicle routing problem. Mathematical Programming Computation, 2(2), 79-101.
Gruler, A., Juan, A. A., Contreras-Bolton, C., & Gatica, G. (2015). A biased-randomized heuristic for the waste collection problem in smart cities. In International Forum for Interdisciplinary Mathematics, pp. 255-263. Springer, Cham.
Helsgaun, K. (2017), An Extension of the Lin-Kernighan-Helsgaun TSP Solver for Constrained Traveling Salesman and Vehicle Routing Problems. Technical Report, Roskilde University
Helsgaun, K. (2000). An effective implementation of the Lin–Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106-130.
Henke, T., Speranza, M. G., & Wäscher, G. (2015). The multi-compartment vehicle routing problem with flexible compartment sizes. European Journal of Operational Research, 246(3), 730 – 743.
Herrera, J. S. (2020a). Instances and Results of LRP Algorithm. url: https://github.com/sebashc3712/ Instances_and_Results_of_LRP_Algorithm (visited 27-06-2020).
Herrera, J. S. (2020b). LRP Algorithm with GRASP. url: https://github.com/sebashc3712/LRP_ Algorithm (visitado 27-06-2020).
Herrera, J. S. (2020c). LRP Algorithm without GRASP. url: https://github.com/sebashc3712/LR_ Algorithm (visitado 27-06-2020).
Hübner, A., & Ostermeier, M. (2019). A multi-compartment vehicle routing problem with loading and unloading costs. Transportation Science, 53(1), 282-300.
Kaya, O., & Ozkok, D. (2018). A network design problem with location, inventory and routing decisions. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 139-140.
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, 1 – 8.
Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241-252.
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.
Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2010). A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research, 37(11), 1886-1898.
Prins, C., Prodhon, C., Ruiz, A., Soriano, P., & Wolfler Calvo, R. (2007). Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science, 41(4), 470 – 483.
Raft, O. M. (1982). A modular algorithm for an extended vehicle scheduling problem. European Journal of Operational Research, 11(1), 67 – 76.
Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.
Silvestrin, P. V., & Ritt, M. (2017). An iterated tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, 81, 192-202.
Vincent, F. Y., Lin, S. W., Lee, W., & Ting, C. J. (2010). A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering, 58(2), 288 – 299.
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.
Wheeler, K. (2013). The Largest Environmental Movement: Recycling and Consumption Work in Sweden.
Wren, A., & Holliday, A. (1972). Computer scheduling of vehicles from one or more depots to a number of delivery points. Journal of the Operational Research Society, 23(3), 333 – 344.