A hybrid matheuristic approach for the integrated location routing problem of the pineapple supply chain

Abstract: This paper proposes a matheuristic approach for the location-routing of industrial platforms of the pineapple supply chain problem. We have proposed a three-phase methodology to solve the considered problem. The first phase consists of obtaining the potential supply in terms of suitability and productivity, the potential location of platforms, and the times of the value chain echelons. In the second phase, a mathematical optimization model for the location problem of platforms considering the coverage in terms of timing is proposed. Finally, the final phase proposes a cluster-routing and a granular reactive tabu search approach for the routing phase. The proposed methodology uses official information on production times, speed, and capacity and georeferenced aptitude, spatial, economic, and land yield information for the first time. The proposed approach has been validated through scenarios, particularly pineapple exports for the Colombian country. The obtained results show the efficiency of the proposed approach.

How to cite this paper

 Torres, J., Paloma, D., Gatica, G., Álvarez-Martínez, D & Escobar, J. (2024). A hybrid matheuristic approach for the integrated location routing problem of the pineapple supply chain.Decision Science Letters , 13(2), 483-498.

Refrences

Asohufrucol (2023). Fondo Nacional de Fomento Hortifrutícola, Programa de Transformación Productiva, (2013), Plan de Negocios de Piña, [Online] https://www.andi.com.co/Uploads/PLAN-NEG-hortofruticola-2013.pdf, Access: 10/18/2023.
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.
Bortfeldt, A., & Homberger, J. (2013). Packing first, routing second—a heuristic for the vehicle routing and loading problem. Computers and Operations Research, 40(3), 873-885.
Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (1979). The vehicle routing problem, Combinatorial Optimization. Wiley, Chichester, pp. 315– 338.
Cordeau, J. F., Gendreau, M., & Laporte, G. (1997). A tabu search heuristic for periodic and multi‐depot vehicle routing problems. Networks: An International Journal, 30(2), 105-119.
Cordeau, J. F., & Laporte, G. (2005). Tabu search heuristics for the vehicle routing problem (pp. 145-163). Springer US.
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. (2014). A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. Journal of Heuristics, 20(5), 483-509.
Food and Agriculture Organization (1976), A framework for land evaluation, Soils Bulletin 52, Rome, Italy. FAO, S590.
Franco, C.,& Barona, G. (2019). Retos de ingeniería para la producción de piña de alta calidad en el valle del Cauca: el caso de bengala agrícola. Revista de Ingeniería, 47, 50-59.
Gendreau, M., Hertz, A., & Laporte, G. (1994). A tabu search heuristic for the vehicle routing problem. Management Science, 40(10), 1276-1290.
Gomez, C. H., Alvarez, D., Saavedra, S., Uribe, R. (2019). Cartama, el método al servicio de la calidad. Revista de Ingenieria, 47, 20-31.
Groër, C., Golden, B., & Wasil, E. (2011). A parallel algorithm for the vehicle routing problem. INFORMS Journal on Computing, 23(2), 315-330.
Helsgaun, K. (2000). An effective implementation of the Lin–Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106-130.
Irnich, S., Toth, P., & Vigo, D. (2014). Chapter 1: The family of vehicle routing problems. In Vehicle Routing: Problems, Methods, and Applications, Second Edition (pp. 1-33). Society for Industrial and Applied Mathematics.
Jin, J., Crainic, T. G., & Løkketangen, A. (2012). A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. European Journal of Operational Research, 222(3), 441-451.
Jin, J., Crainic, T. G., & Løkketangen, A. (2014). A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Computers Operations Research, 44, 33-41.
Kirchler, D., Calvo, R. W. (2013). A granular tabu search algorithm for the dial-a-ride problem. Transportation Research Part B: Methodological, 56, 120-135.
Li, F., Golden, B., & Wasil, E. (2005). Very large-scale vehicle routing: new test problems, algorithms, and results. Computers & Operations Research, 32(5), 1165-1179.
Mester, D., & Bräysy, O. (2005). Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research, 32(6), 1593-1614.
Medaglia, A. L., Villegas, J. G., & Rodríguez-Coca, D. M. (2009). Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network. Journal of Heuristics, 15, 153-176.
Ministerio de Agricultura y Desarrollo Rural (2017). Anuario Estadístico del Sector Agropecuario [Online] http://bibliotecadigital.agronet.gov.co/handle/11438/8628, Access: 10/18/2023.
Ministerio de Transporte Colombia (2018). Sistemas de Información de Costos Eficientes para el Transporte Automotor de Carga (SICE-TAC). https://www.mintransporte.gov.co/publicaciones/4462/sice-tac/, access: 18/07/2018.
Montero, M., & Cerdas, M., (2005). Guías técnicas del manejo postcosecha para el mercado fresco (Piña), [Online] https://www.mag.go.cr/bibliotecavirtual/J11-8874.pdf, access: 10/18/2023.
Nagata, Y., & Bräysy, O. (2009). Edge assembly‐based memetic algorithm for the capacitated vehicle routing problem. Networks: An International Journal, 54(4), 205-215.
Pecin, D., Pessoa, A., Poggi, M., & Uchoa, E. (2017). Improved branch- cut-and-price for capacitated vehicle routing. Mathematical Programming Computation, 9(1), 61-100.
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.
Rochat, Y., & Taillard, E. D. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1(1), 147-167.
Taillard, E. (1993). Parallel iterative search methods for vehicle routing problems. Networks, 23(8), 661-673.
Tarantilis, C. D., & Kiranoudis, C. T. (2002). BoneRoute: An adaptive memory-based method for effective fleet management. Annals of operations Research, 115, 227-241.
Toth, P., & Vigo, D. (2003). The granular tabu search and its application to the vehicle-routing problem. Informs Journal on Computing, 15(4), 333- 346.
Toklu, N. E., Gambardella, L. M., & Montemanni, R. (2014). A multiple ant colony system for a vehicle routing problem with time windows and uncertain travel times. Journal of Traffic and Logistics Engineering, 2(1).
Tridge (2018), Pineapple, [Online] https://www.tridge.com/products/pineapple, Access: 10/18/2023.
Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A. (2017). New benchmark instances for the capacitated vehicle routing problem. European Journal of Operational Research, 257(3), 845-858.
Unidad de Planificación Rural Agropecuaria (UPRA) (2016). Cultivo comercial de papa – Identificación de zonas aptas en Colombia. Escala 1:100.000. http://bibliotecadigital.agronet.gov.co/handle/11438/8630, access: 20/09/2018.
Unidad de Planificacion Rural Agropecuaria (UPRA) (2017). Zonificación de aptitud para el cultivo comercial de pin en Colombia. [Online] https://sigra.upra.gov.co/, access: 10/18/2023.
Unión Temporal (2013). Sistema de Información Geográfica Municipal 2013, [Online] http://bibliotecadigital.agronet.gov.co/bitstream/11348/3709/2/SIG-ACTUALIZACION_GIGANTE_HUILA.pdf, access: 10/18/2023.
Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research, 60(3), 611-624.