How to cite this paper
Londoño, J., Bastidas, J., González, P & Escobar, J. (2023). Inventory routing problem with backhaul considering returnable transport items collection.International Journal of Industrial Engineering Computations , 14(4), 837-862.
Refrences
Agra, A., Requejo, C., & Rodrigues, F. (2018). A hybrid heuristic for a stochastic production-inventory-routing problem. Electronic Notes in Discrete Mathematics, 64, 345-354.
Aksen, D., Kaya, O., Salman, F. S., & Akça, Y. (2012). Selective and periodic inventory routing problem for waste vegetable oil collection. Optimization Letters, 6(6), 1063-1080.
Aksen, D., Kaya, O., Salman, F. S., & Tüncel, Ö. (2014). An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. European Journal of Operational Research, 239(2), 413-426.
Al Shamsi, A., Al Raisi, A., & Aftab, M. (2014). Pollution-inventory routing problem with perishable goods. In Logistics operations, supply chain management and sustainability (pp. 585-596). Springer, Cham.
Alvarez, A., Munari, P., & Morabito, R. (2018). Iterated local search and simulated annealing algorithms for the inventory routing problem. International Transactions in Operational Research, 25(6), 1785-1809.
Alvarez, A., Cordeau, J. F., Jans, R., Munari, P., & Morabito, R. (2020). Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. European Journal of Operational Research, 283(2), 511-529.
Alvarez, A., Cordeau, J. F., Jans, R., Munari, P., & Morabito, R. (2021). Inventory routing under stochastic supply and demand. Omega, 102, 102304.
Arab, R., Ghaderi, S. F., & Tavakkoli-Moghaddam, R. (2018). Bi-objective inventory routing problem with backhauls under transportation risks: two meta-heuristics. Transportation Letters, 12(2), 1-17.
Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. G. (2007). A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41(3), 382-391.
Archetti, C., Desaulniers, G., & Speranza, M. G. (2017). Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics, 6(4), 289-306.
Archetti, C., Coelho, L. C., & Speranza, M. G. (2019). An exact algorithm for the inventory routing problem with logistic ratio. Transportation Research Part E: Logistics and Transportation Review, 131, 96-107.
Azadeh, A., Elahi, S., Farahani, M. H., & Nasirian, B. (2017). A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Computers & Industrial Engineering, 104, 124-133.
Bard, J. F., & Nananukul, N. (2009). Heuristics for a multiperiod inventory routing problem with production decisions. Computers & Industrial Engineering, 57(3), 713-723.
Bard, J. F., & Nananukul, N. (2010). A branch-and-price algorithm for an integrated production and inventory routing problem. Computers & Operations Research, 37(12), 2202-2217.
Benoist, T., Gardi, F., Jeanjean, A., Estellon, B. (2011). Randomized local search for real-life inventory routing. Transportation Science, 45(3), 381–398.
Bernal, J., Escobar, J. W., & Linfati, R. (2017). A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows. Journal of Industrial Engineering and Management, 10(4), 646-662.
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.
Bertazzi, L., Coelho, L. C., De Maio, A., & Laganà, D. (2019). A matheuristic algorithm for the multi-depot inventory routing problem. Transportation Research Part E: Logistics and Transportation Review, 122, 524-544.
Bolaños, 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.
Campbell, A., Clarke, L., Kleywegt, A., & Savelsbergh, M. (1998). The inventory routing problem. In Fleet management and logistics (pp. 95-113). Springer, Boston, MA.
Campbell, A. M., & Savelsbergh, M. W. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488-502.
Cárdenas-Barrón, L. E., & Melo, R. A. (2021). A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. Omega, 103, 102394.
Cárdenas-Barrón, L. E., González-Velarde, J. L., Treviño-Garza, G., & Garza-Nuñez, D. (2019). Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment. International Journal of Production Economics, 211, 44-59.
Carrasco-Gallego, R., Ponce-Cueto, E., & Dekker, R. (2012). Closed-loop supply chains of reusable articles: a typology grounded on case studies. International Journal of Production Research, 50(19), 5582-5596.
Chen, Y. M., & Lin, C. T. (2009). A coordinated approach to hedge the risks in stochastic inventory-routing problem. Computers & Industrial Engineering, 56(3), 1095-1112.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2012). The inventory-routing problem with transshipment. Computers & Operations Research, 39(11), 2537-2548.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014a). Thirty years of inventory routing. Transportation Science, 48(1), 1-19.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014b). Heuristics for dynamic and stochastic inventory-routing. Computers & Operations Research, 52, 55-67.
Escobar, J. W. (2014). Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem. 4OR, 12, 99 – 100.
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, J. W. (2017). Supply chain optimization with variable demand by considering financial criteria and scenarios. Revista Facultad de Ingeniería, 26(44), 23-34.
Escobar, J. W., Marin, A. A., & Lince, J. D. (2020). Multi-objective mathematical model for the redesign of supply chains considering financial criteria optimisation and scenarios. International Journal of Mathematics in Operational Research, 16(2), 238-256.
Escobar, J.W, Duque, J., & García-Cáceres, R. (2022). A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet. International Journal of Industrial Engineering Computations, 13(1), 135-150.
Escobar-Falcón, L., Álvarez-Martínez, D., Wilmer-Escobar, J., & Granada-Echeverri, M. (2021). A specialized genetic algorithm for the fuel consumption heterogeneous fleet vehicle routing problem with bidimensional packing constraints. International Journal of Industrial Engineering Computations, 12(2), 191–204.
Farias, K., Hadj-Hamou, K., & Yugma, C. (2019). Mathematical formulations for a two-echelon inventory routing problem. IFAC-PapersOnLine, 52(13), 1996-2001.
Fukunaga, T., Nikzad, A., & Ravi, R. (2014). Deliver or hold: approximation algorithms for the periodic inventory routing problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014).
Gaur, V., & Fisher, M. L. (2004). A periodic inventory routing problem at a supermarket chain. Operations Research, 52(6), 813-822.
Gavish, B., & Graves, S. C. (1978). The Travelling Salesman Problem and Related Problems.
Ghiami, Y., Demir, E., Van Woensel, T., Christiansen, M., & Laporte, G. (2019). A deteriorating inventory routing problem for an inland liquefied natural gas distribution network. Transportation Research Part B: Methodological, 126, 45-67.
Glock, C. H., & Kim, T. (2014). Container management in a single-vendor-multiple-buyer supply chain. Logistics Research, 7(1), 112.
Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2010). A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Science, 44(3), 400-415.
Hariga, M., Glock, C. H., & Kim, T. (2016). Integrated product and container inventory model for a single-vendor single-buyer supply chain with owned and rented returnable transport items. International Journal of Production Research, 54(7), 1964-1979.
Hellström, D., & Johansson, O. (2010). The impact of control strategies on the management of returnable transport items. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1128-1139.
Johansson, O., & Hellström, D. (2007). The effect of asset visibility on managing returnable transport items. International Journal of Physical Distribution & Logistics Management, 37(10), 799-815.
Juan, A. A., Grasman, S. E., Caceres-Cruz, J., & Bektaş, T. (2014). A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simulation Modelling Practice and Theory, 46, 40-52.
Kim, T., Glock, C. H., & Kwon, Y. (2014). A closed-loop supply chain for deteriorating products under stochastic container return times. Omega, 43, 30-40.
Kleywegt, A. J., Nori, V. S., & Savelsbergh, M. W. (2002). The stochastic inventory routing problem with direct deliveries. Transportation Science, 36(1), 94-118.
Koç, Ç., & Laporte, G. (2018). Vehicle routing with backhauls: Review and research perspectives. Computers & Operations Research, 91, 79-91.
Kroon, L., & Vrijens, G. (1995). Returnable containers: an example of reverse logistics. International Journal of Physical Distribution & Logistics Management, 25(2), 56-68.
Lefever, W., Aghezzaf, E. H., Hadj-Hamou, K., & Penz, B. (2018). Analysis of an improved branch-and-cut formulation for the Inventory-Routing Problem with Transshipment. Computers & Operations Research, 98, 137-148.
Linfati, R., Escobar, J. W., & Gatica, G. (2014a). Un algoritmo metaheurístico para el problema de localización y ruteo con flota heterogénea. Ingeniería y Ciencia, 10(19), 55–76.
Linfati, R., Escobar, J. W., & Cuevas, B. (2014b). An algorithm based on granular tabu search for the problem of balancing public bikes by using multiple vehicles. Dyna, 81(186), 284-294.
Liu, S. C., Lu, M. C., & Chung, C. H. (2016). A hybrid heuristic method for the periodic inventory routing problem. The International Journal of Advanced Manufacturing Technology, 85(9-12), 2345-2352.
Londoño, J. C., Tordecilla, R. D., Martins, L. D. C., & Juan, A. A. (2021a). A biased-randomized iterated local search for the vehicle routing problem with optional backhauls. TOP, 29(2), 387-416.
Londoño J.C, Bravo J.J., Escobar J.W, (2021b). Inventory Routing Problem categorization considering pickup decisions in closed loop supply chains. International Journal of Integrated Supply Management, forthcoming.
Mahjoob, M., Fazeli, S. S., Tavassoli, L. S., Mirmozaffari, M., & Milanlouei, S. (2021). A green multi-period inventory routing problem with pickup and split delivery: A case study in flour industry. Sustainable Operations and Computers, 2, 64-70.
Malladi, K. T., & Sowlati, T. (2018). Sustainability aspects in Inventory Routing Problem: A review of new trends in the literature. Journal of Cleaner Production, 197, 804-814.
Markov, I., Bierlaire, M., Cordeau, J. F., Maknoon, Y., & Varone, S. (2020). Waste collection inventory routing with non-stationary stochastic demands. Computers & Operations Research, 113, 104798.
Nikzad, E., Bashiri, M., & Oliveira, F. (2019). Two-stage stochastic programming approach for the medical drug inventory routing problem under uncertainty. Computers & Industrial Engineering, 128, 358-370.
Onggo, B. S., Panadero, J., Corlu, C. G., & Juan, A. A. (2019). Agri-food supply chains with stochastic demands: A multi-period inventory routing problem with perishable products. Simulation Modelling Practice and Theory, 97, 101970.
Polo, A., Peña, N., Muñoz, D., Cañón, A., & Escobar, J. W. (2019). Robust design of a closed-loop supply chain under uncertainty conditions integrating financial criteria. Omega, 88, 110-132.
Qin, L., Miao, L., Ruan, Q., & Zhang, Y. (2014). A local search method for periodic inventory routing problem. Expert Systems with Applications, 41(2), 765-778.
Puenayán, D. E., Londoño, J. C., Escobar, J. W., & Linfati, R. (2014). Un algoritmo basado en búsqueda tabú granular para la solución de un problema de ruteo de vehículos considerando flota heterogénea. Revista Ingenierías Universidad de Medellín, 13(25), 81-98.
Ramadhan, F., & Imran, A. (2020). Metaheuristic Algorithms for the Many-to-one IRP with Dynamic Velocity. In Journal of Physics: Conference Series, 1501(1), 012009. IOP Publishing.
Rau, H., Budiman, S. D., & Widyadana, G. A. (2018). Optimization of the multi-objective green cyclical inventory routing problem using discrete multi-swarm PSO method. Transportation Research Part E: Logistics and Transportation Review, 120, 51-75.
Sarkar, B., Ullah, M., & Kim, N. (2017). Environmental and economic assessment of closed-loop supply chain with remanufacturing and returnable transport items. Computers & Industrial Engineering, 111, 148-163.
Singh, T., Arbogast, J. E., & Neagu, N. (2015). An incremental approach using local-search heuristic for inventory routing problem in industrial gases. Computers & Chemical Engineering, 80, 199-210.
Thinkaran, N., Jayaprakash, J., & Elanchezhian, C. (2019). Optimization of Total Cost in Inventory Routing Problem with Homogenous type of Vehicles using Metaheuristic algorithm–A Review. Materials Today: Proceedings, 16, 1043-1047.
Tordecilla-Madera, R., Roa, A. P., Escobar, J. W., & Buriticá, N. C. (2018). A mathematical model for collecting and distributing perishable products by considering costs minimisation and CO2 emissions. International Journal of Services and Operations Management, 31(2), 207-234.
Wei, C., Gao, W. W., Hu, Z. H., Yin, Y. Q., & Pan, S. D. (2019). Assigning customer-dependent travel time limits to routes in a cold-chain inventory routing problem. Computers & Industrial Engineering, 133, 275-291.
Yadollahi, E., Aghezzaf, E. H., Walraevens, J., & Raa, B. (2018). Optimizing Storage Capacity of Retailers in Stochastic Periodic Inventory Routing Problem. In ICORES (pp. 217-223).
Yadollahi, E., Aghezzaf, E. H., Walraevens, J., Raa, B., & Claeys, D. (2019). Evaluating approximate solution models for the stochastic periodic inventory routing problem. Journal of Manufacturing Systems, 50, 25-35.
Aksen, D., Kaya, O., Salman, F. S., & Akça, Y. (2012). Selective and periodic inventory routing problem for waste vegetable oil collection. Optimization Letters, 6(6), 1063-1080.
Aksen, D., Kaya, O., Salman, F. S., & Tüncel, Ö. (2014). An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem. European Journal of Operational Research, 239(2), 413-426.
Al Shamsi, A., Al Raisi, A., & Aftab, M. (2014). Pollution-inventory routing problem with perishable goods. In Logistics operations, supply chain management and sustainability (pp. 585-596). Springer, Cham.
Alvarez, A., Munari, P., & Morabito, R. (2018). Iterated local search and simulated annealing algorithms for the inventory routing problem. International Transactions in Operational Research, 25(6), 1785-1809.
Alvarez, A., Cordeau, J. F., Jans, R., Munari, P., & Morabito, R. (2020). Formulations, branch-and-cut and a hybrid heuristic algorithm for an inventory routing problem with perishable products. European Journal of Operational Research, 283(2), 511-529.
Alvarez, A., Cordeau, J. F., Jans, R., Munari, P., & Morabito, R. (2021). Inventory routing under stochastic supply and demand. Omega, 102, 102304.
Arab, R., Ghaderi, S. F., & Tavakkoli-Moghaddam, R. (2018). Bi-objective inventory routing problem with backhauls under transportation risks: two meta-heuristics. Transportation Letters, 12(2), 1-17.
Archetti, C., Bertazzi, L., Laporte, G., & Speranza, M. G. (2007). A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transportation Science, 41(3), 382-391.
Archetti, C., Desaulniers, G., & Speranza, M. G. (2017). Minimizing the logistic ratio in the inventory routing problem. EURO Journal on Transportation and Logistics, 6(4), 289-306.
Archetti, C., Coelho, L. C., & Speranza, M. G. (2019). An exact algorithm for the inventory routing problem with logistic ratio. Transportation Research Part E: Logistics and Transportation Review, 131, 96-107.
Azadeh, A., Elahi, S., Farahani, M. H., & Nasirian, B. (2017). A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Computers & Industrial Engineering, 104, 124-133.
Bard, J. F., & Nananukul, N. (2009). Heuristics for a multiperiod inventory routing problem with production decisions. Computers & Industrial Engineering, 57(3), 713-723.
Bard, J. F., & Nananukul, N. (2010). A branch-and-price algorithm for an integrated production and inventory routing problem. Computers & Operations Research, 37(12), 2202-2217.
Benoist, T., Gardi, F., Jeanjean, A., Estellon, B. (2011). Randomized local search for real-life inventory routing. Transportation Science, 45(3), 381–398.
Bernal, J., Escobar, J. W., & Linfati, R. (2017). A granular tabu search algorithm for a real case study of a vehicle routing problem with a heterogeneous fleet and time windows. Journal of Industrial Engineering and Management, 10(4), 646-662.
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.
Bertazzi, L., Coelho, L. C., De Maio, A., & Laganà, D. (2019). A matheuristic algorithm for the multi-depot inventory routing problem. Transportation Research Part E: Logistics and Transportation Review, 122, 524-544.
Bolaños, 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.
Campbell, A., Clarke, L., Kleywegt, A., & Savelsbergh, M. (1998). The inventory routing problem. In Fleet management and logistics (pp. 95-113). Springer, Boston, MA.
Campbell, A. M., & Savelsbergh, M. W. (2004). A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488-502.
Cárdenas-Barrón, L. E., & Melo, R. A. (2021). A fast and effective MIP-based heuristic for a selective and periodic inventory routing problem in reverse logistics. Omega, 103, 102394.
Cárdenas-Barrón, L. E., González-Velarde, J. L., Treviño-Garza, G., & Garza-Nuñez, D. (2019). Heuristic algorithm based on reduce and optimize approach for a selective and periodic inventory routing problem in a waste vegetable oil collection environment. International Journal of Production Economics, 211, 44-59.
Carrasco-Gallego, R., Ponce-Cueto, E., & Dekker, R. (2012). Closed-loop supply chains of reusable articles: a typology grounded on case studies. International Journal of Production Research, 50(19), 5582-5596.
Chen, Y. M., & Lin, C. T. (2009). A coordinated approach to hedge the risks in stochastic inventory-routing problem. Computers & Industrial Engineering, 56(3), 1095-1112.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2012). The inventory-routing problem with transshipment. Computers & Operations Research, 39(11), 2537-2548.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014a). Thirty years of inventory routing. Transportation Science, 48(1), 1-19.
Coelho, L. C., Cordeau, J. F., & Laporte, G. (2014b). Heuristics for dynamic and stochastic inventory-routing. Computers & Operations Research, 52, 55-67.
Escobar, J. W. (2014). Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem. 4OR, 12, 99 – 100.
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, J. W. (2017). Supply chain optimization with variable demand by considering financial criteria and scenarios. Revista Facultad de Ingeniería, 26(44), 23-34.
Escobar, J. W., Marin, A. A., & Lince, J. D. (2020). Multi-objective mathematical model for the redesign of supply chains considering financial criteria optimisation and scenarios. International Journal of Mathematics in Operational Research, 16(2), 238-256.
Escobar, J.W, Duque, J., & García-Cáceres, R. (2022). A granular tabu search for the refrigerated vehicle routing problem with homogeneous fleet. International Journal of Industrial Engineering Computations, 13(1), 135-150.
Escobar-Falcón, L., Álvarez-Martínez, D., Wilmer-Escobar, J., & Granada-Echeverri, M. (2021). A specialized genetic algorithm for the fuel consumption heterogeneous fleet vehicle routing problem with bidimensional packing constraints. International Journal of Industrial Engineering Computations, 12(2), 191–204.
Farias, K., Hadj-Hamou, K., & Yugma, C. (2019). Mathematical formulations for a two-echelon inventory routing problem. IFAC-PapersOnLine, 52(13), 1996-2001.
Fukunaga, T., Nikzad, A., & Ravi, R. (2014). Deliver or hold: approximation algorithms for the periodic inventory routing problem. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2014).
Gaur, V., & Fisher, M. L. (2004). A periodic inventory routing problem at a supermarket chain. Operations Research, 52(6), 813-822.
Gavish, B., & Graves, S. C. (1978). The Travelling Salesman Problem and Related Problems.
Ghiami, Y., Demir, E., Van Woensel, T., Christiansen, M., & Laporte, G. (2019). A deteriorating inventory routing problem for an inland liquefied natural gas distribution network. Transportation Research Part B: Methodological, 126, 45-67.
Glock, C. H., & Kim, T. (2014). Container management in a single-vendor-multiple-buyer supply chain. Logistics Research, 7(1), 112.
Grønhaug, R., Christiansen, M., Desaulniers, G., & Desrosiers, J. (2010). A branch-and-price method for a liquefied natural gas inventory routing problem. Transportation Science, 44(3), 400-415.
Hariga, M., Glock, C. H., & Kim, T. (2016). Integrated product and container inventory model for a single-vendor single-buyer supply chain with owned and rented returnable transport items. International Journal of Production Research, 54(7), 1964-1979.
Hellström, D., & Johansson, O. (2010). The impact of control strategies on the management of returnable transport items. Transportation Research Part E: Logistics and Transportation Review, 46(6), 1128-1139.
Johansson, O., & Hellström, D. (2007). The effect of asset visibility on managing returnable transport items. International Journal of Physical Distribution & Logistics Management, 37(10), 799-815.
Juan, A. A., Grasman, S. E., Caceres-Cruz, J., & Bektaş, T. (2014). A simheuristic algorithm for the single-period stochastic inventory-routing problem with stock-outs. Simulation Modelling Practice and Theory, 46, 40-52.
Kim, T., Glock, C. H., & Kwon, Y. (2014). A closed-loop supply chain for deteriorating products under stochastic container return times. Omega, 43, 30-40.
Kleywegt, A. J., Nori, V. S., & Savelsbergh, M. W. (2002). The stochastic inventory routing problem with direct deliveries. Transportation Science, 36(1), 94-118.
Koç, Ç., & Laporte, G. (2018). Vehicle routing with backhauls: Review and research perspectives. Computers & Operations Research, 91, 79-91.
Kroon, L., & Vrijens, G. (1995). Returnable containers: an example of reverse logistics. International Journal of Physical Distribution & Logistics Management, 25(2), 56-68.
Lefever, W., Aghezzaf, E. H., Hadj-Hamou, K., & Penz, B. (2018). Analysis of an improved branch-and-cut formulation for the Inventory-Routing Problem with Transshipment. Computers & Operations Research, 98, 137-148.
Linfati, R., Escobar, J. W., & Gatica, G. (2014a). Un algoritmo metaheurístico para el problema de localización y ruteo con flota heterogénea. Ingeniería y Ciencia, 10(19), 55–76.
Linfati, R., Escobar, J. W., & Cuevas, B. (2014b). An algorithm based on granular tabu search for the problem of balancing public bikes by using multiple vehicles. Dyna, 81(186), 284-294.
Liu, S. C., Lu, M. C., & Chung, C. H. (2016). A hybrid heuristic method for the periodic inventory routing problem. The International Journal of Advanced Manufacturing Technology, 85(9-12), 2345-2352.
Londoño, J. C., Tordecilla, R. D., Martins, L. D. C., & Juan, A. A. (2021a). A biased-randomized iterated local search for the vehicle routing problem with optional backhauls. TOP, 29(2), 387-416.
Londoño J.C, Bravo J.J., Escobar J.W, (2021b). Inventory Routing Problem categorization considering pickup decisions in closed loop supply chains. International Journal of Integrated Supply Management, forthcoming.
Mahjoob, M., Fazeli, S. S., Tavassoli, L. S., Mirmozaffari, M., & Milanlouei, S. (2021). A green multi-period inventory routing problem with pickup and split delivery: A case study in flour industry. Sustainable Operations and Computers, 2, 64-70.
Malladi, K. T., & Sowlati, T. (2018). Sustainability aspects in Inventory Routing Problem: A review of new trends in the literature. Journal of Cleaner Production, 197, 804-814.
Markov, I., Bierlaire, M., Cordeau, J. F., Maknoon, Y., & Varone, S. (2020). Waste collection inventory routing with non-stationary stochastic demands. Computers & Operations Research, 113, 104798.
Nikzad, E., Bashiri, M., & Oliveira, F. (2019). Two-stage stochastic programming approach for the medical drug inventory routing problem under uncertainty. Computers & Industrial Engineering, 128, 358-370.
Onggo, B. S., Panadero, J., Corlu, C. G., & Juan, A. A. (2019). Agri-food supply chains with stochastic demands: A multi-period inventory routing problem with perishable products. Simulation Modelling Practice and Theory, 97, 101970.
Polo, A., Peña, N., Muñoz, D., Cañón, A., & Escobar, J. W. (2019). Robust design of a closed-loop supply chain under uncertainty conditions integrating financial criteria. Omega, 88, 110-132.
Qin, L., Miao, L., Ruan, Q., & Zhang, Y. (2014). A local search method for periodic inventory routing problem. Expert Systems with Applications, 41(2), 765-778.
Puenayán, D. E., Londoño, J. C., Escobar, J. W., & Linfati, R. (2014). Un algoritmo basado en búsqueda tabú granular para la solución de un problema de ruteo de vehículos considerando flota heterogénea. Revista Ingenierías Universidad de Medellín, 13(25), 81-98.
Ramadhan, F., & Imran, A. (2020). Metaheuristic Algorithms for the Many-to-one IRP with Dynamic Velocity. In Journal of Physics: Conference Series, 1501(1), 012009. IOP Publishing.
Rau, H., Budiman, S. D., & Widyadana, G. A. (2018). Optimization of the multi-objective green cyclical inventory routing problem using discrete multi-swarm PSO method. Transportation Research Part E: Logistics and Transportation Review, 120, 51-75.
Sarkar, B., Ullah, M., & Kim, N. (2017). Environmental and economic assessment of closed-loop supply chain with remanufacturing and returnable transport items. Computers & Industrial Engineering, 111, 148-163.
Singh, T., Arbogast, J. E., & Neagu, N. (2015). An incremental approach using local-search heuristic for inventory routing problem in industrial gases. Computers & Chemical Engineering, 80, 199-210.
Thinkaran, N., Jayaprakash, J., & Elanchezhian, C. (2019). Optimization of Total Cost in Inventory Routing Problem with Homogenous type of Vehicles using Metaheuristic algorithm–A Review. Materials Today: Proceedings, 16, 1043-1047.
Tordecilla-Madera, R., Roa, A. P., Escobar, J. W., & Buriticá, N. C. (2018). A mathematical model for collecting and distributing perishable products by considering costs minimisation and CO2 emissions. International Journal of Services and Operations Management, 31(2), 207-234.
Wei, C., Gao, W. W., Hu, Z. H., Yin, Y. Q., & Pan, S. D. (2019). Assigning customer-dependent travel time limits to routes in a cold-chain inventory routing problem. Computers & Industrial Engineering, 133, 275-291.
Yadollahi, E., Aghezzaf, E. H., Walraevens, J., & Raa, B. (2018). Optimizing Storage Capacity of Retailers in Stochastic Periodic Inventory Routing Problem. In ICORES (pp. 217-223).
Yadollahi, E., Aghezzaf, E. H., Walraevens, J., Raa, B., & Claeys, D. (2019). Evaluating approximate solution models for the stochastic periodic inventory routing problem. Journal of Manufacturing Systems, 50, 25-35.