A greedy randomized adaptive search with probabilistic learning for solving the uncapacitated plant cycle location problem

• Israel López-Plata ^[1] ; Christopher Expósito-Izquierdo ^[1] ; Eduardo Lalla-Ruiz ^[2] ; Belén Melián-Batista ^[1] ; J. Marcos Moreno-Vega ^[1]
  1. [1] Universidad de La Laguna

     Universidad de La Laguna

     San Cristóbal de La Laguna, España

     
  2. [2] University of Twente

     University of Twente

     Países Bajos

     
• Localización: IJIMAI, ISSN-e 1989-1660, Vol. 8, Nº. 2, 2023, págs. 123-133
• Idioma: inglés
• DOI: 10.9781/ijimai.2022.04.003
• Enlaces
  • Texto completo (pdf)
• Resumen

  • In this paper, we address the Uncapacitated Plant Cycle Location Problem. It is a location-routing problem aimed at determining a subset of locations to set up plants dedicated to serving customers. We propose a mathematical formulation to model the problem. The high computational burden required by the formulation when tackling large scenarios encourages us to develop a Greedy Randomized Adaptive Search Procedure with Probabilistic Learning Model. Its rationale is to divide the problem into two interconnected sub-problems.

    The computational results indicate the high performance of our proposal in terms of the quality of reported solutions and computational time. Specifically, we have overcome the best approach from the literature on a wide range of scenarios.

• Referencias bibliográficas
  • G. Cornuéjols, G. Nemhauser, and L. Wolsey, “The uncapacitated facility location problem,” tech. rep., Cornell University Operations Research...
  • W. Ho, P. Ji, and P. K. Dey, “A multi-depot travelling salesman problem and its iterative and integrated approaches,” International Journal...
  • S. V. Ukkusuri and W. F. Yushimito, “Location routing approach for the humanitarian prepositioning problem,” Transportation research record,...
  • S. Schwarze, E. Lalla-Ruiz, and S. Voß, “Modeling the capacitated p-cable trench problem with facility costs,” Central European journal of...
  • E. Lalla-Ruiz and S. Voß, “A popmusic approach for the multi-depot cumulative capacitated vehicle routing problem,” Optimization Letters,...
  • R. T. Berger, C. R. Coullard, and M. S. Daskin, “Location-routing problems with distance constraints,” Transportation Science, vol. 41, no....
  • S. Çetiner, C. Sepil, and H. Süral, “Hubbing and routing in postal delivery systems,” Annals of Operations research, vol. 181, no. 1, pp....
  • A. Bruns, A. Klose, and P. Stähly, “Restructuring of swiss parcel delivery services,” OR-Spektrum, vol. 22, no. 2, pp. 285–302, 2000.
  • G. Reinelt, “Tsplib–a traveling salesman problem library,” ORSA journal on computing, vol. 3, no. 4, pp. 376–384, 1991.
  • H. Min, V. Jayaraman, and R. Srivastava, “Combined location-routing problems: A synthesis and future research directions,” European Journal...
  • D. Tuzun and L. Burke, “A two-phase tabu search approach to the location routing problem,” European Journal of Operational Research, vol....
  • A. Balakrishnan, J. Ward, and R. Wong, “Integrated facility location and vehicle routing models: Recent work and future prospects,” American...
  • G. Nagy and S. Salhi, “Location-routing: Issues, models and methods,” European Journal of Operational Research, vol. 177, no. 2, pp. 649...
  • C. Prodhon and C. Prins, “A survey of recent research on locationrouting problems,” European Journal of Operational Research, vol. 238, no....
  • M. Schneider and M. Drexl, “A survey of the standard location-routing problem,” Annals of Operations Research, vol. 259, no. 1-2, pp. 389–414,...
  • M. Drexl and M. Schneider, “A survey of variants and extensions of the location-routing problem,” European Journal of Operational Research,...
  • S. Alumur and B. Y. Kara, “A new model for the hazardous waste locationrouting problem,” Computers & Operations Research, vol. 34, no....
  • X. Yu, Y. Zhou, and X.-F. Liu, “The two-echelon multi-objective location routing problem inspired by realistic waste collection applications:...
  • S. Kumar, V. Kumar-Solanki, S. K. Choudhary, A. Selamat, and R. González-Crespo, “Comparative study on ant colony optimization (aco) and...
  • M. Rabbani, R. Heidari, H. Farrokhi-Asl, and N. Rahimi, “Using metaheuristic algorithms to solve a multi-objective industrial hazardous waste...
  • A. Billionnet, S. Elloumi, and L. G. Djerbi, “Designing radio-mobile access networks based on synchronous digital hierarchy rings,” Computers...
  • S. Zhang, M. Chen, and W. Zhang, “A novel location-routing problem in electric vehicle transportation with stochastic demands,” Journal of...
  • I. A. Martínez-Salazar, J. Molina, F. Ángel-Bello, T. Gómez, and R. Caballero, “Solving a bi-objective transportation location routing problem...
  • M. Borhani, K. Akbari, A. Matkan, and M. Tanasan, “A multicriteria optimization for flight route networks in large-scale airlines using intelligent...
  • B. Jarboui, H. Derbel, S. Hanafi, and N. Mladenović, “Variable neighborhood search for location routing,” Computers & Operations Research,...
  • C.-J. Ting and C.-H. Chen, “A multiple ant colony optimization algorithm for the capacitated location routing problem,” International Journal...
  • T.-H. Wu, C. Low, and J.-W. Bai, “Heuristic solutions to multi-depot location-routing problems,” Computers & Operations Research, vol....
  • P. Yang and B. Li-Jun, “An integrated optimization problem in logistics and the pso solution,” in 2006 International Conference on Service...
  • Y. Marinakis and M. Marinaki, “A particle swarm optimization algorithm with path relinking for the location routing problem,” Journal of...
  • R. Caballero, M. González, F. M. Guerrero, J. Molina, and Paralera, “Solving a multiobjective location routing problem with a metaheuristic...
  • C. Prins, C. Prodhon, and R. W. Calvo, “Solving the capacitated locationrouting problem by a grasp complemented by a learning process and...
  • S. Barreto, C. Ferreira, J. Paixao, and B. S. Santos, “Using clustering analysis in a capacitated location-routing problem,” European Journal...
  • I. López-Plata, C. Expósito-Izquierdo, E. Lalla-Ruiz,B. Melián-Batista, and J. M. Moreno-Vega, “A greedy randomized adaptive search procedure...
  • J. Escobar, R. Linfati, M. Baldoquin, and P. Toth, “A granular variable tabu neighborhood search for the capacitated location-routing problem,”...
  • R. Baldacci, A. Mingozzi, and R. Calvo, “An exact method for the capacitated location-routing problem.,” Operations Research, vol. 59, no....
  • J. Belenguer, E. Benavent, C. Prins, C. Prodhon, and R. Calvo, “A branchand-cut method for the capacitated location-routing problem,” Computers...
  • C. Contardo, J.F. Cordeau, and B. Gendron, “An exact algorithm based on cut-and-column generation for the capacitated location-routing problem,”...
  • A. Perugia, L. Moccia, J. Cordeau, and G. Laporte, “Designing a home-towork bus service in a metropolitan area,” Transportation Research...
  • I. Rodríguez-Martín, J.-J. Salazar-González, and H. Yaman, “A branchand-cut algorithm for two-level survivable network design problems,”...
  • M. Labbé, I. Rodríguez-Martín, and J. Salazar-Rodríguez, “A branchand-cut algorithm for the plant-cycle location problem,” Journal of the...
  • M. Albareda-Sambola, J. Díaz, and E. Fernández, “A compact model and tight bounds for a combined location-routing problem,” Computers &...
  • B. Melián-Batista, J. Moreno-Vega, N. Vaswani, and R. Yumar, “A nature inspired approach for the uncapacitated plant cycle location problem,”...
  • C. Fleming, S. Griffis, and J. Bell, “The effects of triangle inequality on the vehicle routing problem,” European Journal of Operational...
  • G. Gutin and A. Punnen, The Traveling Salesman Problem and Its Variations. Springer, 1 edition ed., 2002.
  • T. Feo and M. Resende, “Greedy randomized adaptive search procedures,” Journal of Global Optimization, vol. 6, no. 2, pp. 109–133, 1995....
  • W. W. Daniel, Applied nonparametric statistics. Boston: PWS-Kent Publishing Company, 1990.
  • F. Wilcoxon, “Individual comparisons by ranking methods,” Biometrics Bulletin, vol. 1, no. 6, pp. 80–83, 1945.