677
Views
2
CrossRef citations to date
0
Altmetric
Research Articles

A hybridisation of linear programming and genetic algorithm to solve the capacitated facility location problem

ORCID Icon & ORCID Icon
Pages 3331-3349 | Received 27 Oct 2021, Accepted 11 May 2022, Published online: 01 Jun 2022

References

  • Al-Betar, M. A., M. A. Awadallah, H. Faris, I. Aljarah, and A. I. Hammouri. 2018. “Natural Selection Methods for Grey Wolf Optimizer.” Expert Systems with Applications 113: 481–498. doi:10.1016/j.eswa.2018.07.022.
  • Alenezy, E. J. 2020. “Solving Capacitated Facility Location Problem Using Lagrangian Decomposition and Volume Algorithm.” Advances in Operations Research 2020: 5239176, 1–7. doi:10.1155/2020/5239176.
  • An, H. C., M. Singh, and O. Svensson. 2017. “LP-based Algorithms for Capacitated Facility Location.” SIAM Journal on Computing 46 (1): 272–306. doi:10.1137/151002320.
  • Avella, P., and M. Boccia. 2009. “A Cutting Plane Algorithm for the Capacitated Facility Location Problem.” Computational Optimization and Applications 43 (1): 39–65. doi:10.1007/s10589-007-9125-x.
  • Avella, P., M. Boccia, A. Sforza, and I. Vasil’ev. 2009. “An Effective Heuristic for Large-Scale Capacitated Facility Location Problems.” Journal of Heuristics 15 (6): 597–615. doi:10.1007/s10732-008-9078-y.
  • Baldacci, R., M. Caserta, E. Traversi, and R. Wolfler Calvo. 2022. “Robustness of Solutions to the Capacitated Facility Location Problem with Uncertain Demand.” Optimization Letters, 1–17. doi:10.1007/s11590-021-01848-4.
  • Beasley, J. E. 1988. “An Algorithm for Solving Large Capacitated Warehouse Location Problems.” European Journal of Operational Research 33 (3): 314–325. doi:10.1016/0377-2217(88)90175-0.
  • Cabrera G, G., E. Cabrera, R. Soto, L. Rubio, B. Crawford, and F. Paredes. 2012. “A Hybrid Approach Using an Artificial bee Algorithm with Mixed Integer Programming Applied to a Large-Scale Capacitated Facility Location Problem.” Mathematical Problems in Engineering 2012: 954249, 1–14. doi:10.1155/2012/954249.
  • Caserta, M., and S. Voß. 2020. “A General Corridor Method-Based Approach for Capacitated Facility Location.” International Journal of Production Research 58 (13): 3855–3880. doi:10.1080/00207543.2019.1636320.
  • Caserta, M., and S. Voß. 2021. “Accelerating Mathematical Programming Techniques with the Corridor Method.” International Journal of Production Research 59 (9): 2739–2771. doi:10.1080/00207543.2020.1740343.
  • Chen, C. H., and C. J. Ting. 2008. “Combining Lagrangian Heuristic and ant Colony System to Solve the Single Source Capacitated Facility Location Problem.” Transportation Research Part E: Logistics and Transportation Review 44 (6): 1099–1122. doi:10.1016/j.tre.2007.09.001.
  • Christofides, N. B. J. E., and J. E. Beasley. 1983. “Extensions to a Lagrangean Relaxation Approach for the Capacitated Warehouse Location Problem.” European Journal of Operational Research 12 (1): 19–28. doi:10.1016/0377-2217(83)90179-0.
  • Contreras, I. A., and J. A. Díaz. 2008. “Scatter Search for the Single Source Capacitated Facility Location Problem.” Annals of Operations Research 157 (1): 73–89. doi:10.1007/s10479-007-0193-1.
  • Contreras, I., E. Fernández, and A. Marín. 2010. “The Tree of Hubs Location Problem.” European Journal of Operational Research 202 (2): 390–400. doi:10.1016/j.ejor.2009.05.044.
  • Derrac, J., S. García, D. Molina, and F. Herrera. 2011. “A Practical Tutorial on the use of Nonparametric Statistical Tests as a Methodology for Comparing Evolutionary and Swarm Intelligence Algorithms.” Swarm and Evolutionary Computation 1 (1): 3–18. doi:10.1016/j.swevo.2011.02.002.
  • Eberhart, R., and J. Kennedy. 1995. “A new optimizer using particle swarm theory.” Paper presented at the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, October, 39-43. https://doi.org/10.1109/MHS.1995.494215.
  • Fernandes, D. R., C. Rocha, D. Aloise, G. M. Ribeiro, E. M. Santos, and A. Silva. 2014. “A Simple and Effective Genetic Algorithm for the two-Stage Capacitated Facility Location Problem.” Computers & Industrial Engineering 75: 200–208. doi:10.1016/j.cie.2014.05.023.
  • Fischetti, M., I. Ljubić, and M. Sinnl. 2016. “Benders Decomposition Without Separability: A Computational Study for Capacitated Facility Location Problems.” European Journal of Operational Research 253 (3): 557–569. doi:10.1016/j.ejor.2016.03.002.
  • Gölcük, İ, and F. B. Ozsoydan. 2020. “Evolutionary and Adaptive Inheritance Enhanced Grey Wolf Optimization Algorithm for Binary Domains.” Knowledge-Based Systems 194: 105586. doi:10.1016/j.knosys.2020.105586.
  • Görtz, S., and A. Klose. 2012. “A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem.” INFORMS Journal on Computing 24 (4): 597–610. doi:10.1287/ijoc.1110.0468.
  • Guastaroba, G., and M. G. Speranza. 2012. “Kernel Search for the Capacitated Facility Location Problem.” Journal of Heuristics 18 (6): 877–917. doi:10.1007/s10732-012-9212-8.
  • Guastaroba, G., and M. G. Speranza. 2014. “A Heuristic for BILP Problems: The Single Source Capacitated Facility Location Problem.” European Journal of Operational Research 238 (2): 438–450. doi:10.1016/j.ejor.2014.04.007.
  • Holland, J. H. 1975. Adaptation in Natural and Artificial Systems. Ann Arbor MI: The University of Michigan Press. doi:10.1137/1018105.
  • Kennedy, J., and R. Eberhart. 1995. “Particle swarm optimization.” Paper presented at the ICNN'95-international conference on neural networks, Perth, WA, Australia, November, 1942-1948. doi:10.1109/ICNN.1995.488968.
  • Klose, A., and S. Görtz. 2007. “A Branch-and-Price Algorithm for the Capacitated Facility Location Problem.” European Journal of Operational Research 179 (3): 1109–1125. doi:10.1016/j.ejor.2005.03.078.
  • Levi, R., D. B. Shmoys, and C. Swamy. 2012. “LP-based Approximation Algorithms for Capacitated Facility Location.” Mathematical Programming 131 (1): 365–379. doi:10.1007/s10107-010-0380-8.
  • Liao, K., and D. Guo. 2008. “A Clustering-Based Approach to the Capacitated Facility Location Problem.” Transactions in GIS 12 (3): 323–339. doi:10.1111/j.1467-9671.2008.01105.x.
  • Lorena, L. A., and E. L. Senne. 1999. “Improving Traditional Subgradient Scheme for Lagrangean Relaxation: An Application to Location Problems.” International Journal of Mathematical Algorithms 1: 133–151.
  • Matos, T., Ó Oliveira, and D. Gamboa. 2021. “RAMP Algorithms for the Capacitated Facility Location Problem.” Annals of Mathematics and Artificial Intelligence 89 (8): 799–813. doi:10.1007/s10472-021-09757-z.
  • Mirjalili, S., S. M. Mirjalili, and A. Lewis. 2014. “Grey Wolf Optimizer.” Advances in Engineering Software 69: 46–61. doi:10.1016/j.advengsoft.2013.12.007.
  • Nasiri, M. M., V. Mahmoodian, A. Rahbari, and S. Farahmand. 2018. “A Modified Genetic Algorithm for the Capacitated Competitive Facility Location Problem with the Partial Demand Satisfaction.” Computers & Industrial Engineering 124: 435–448. doi:10.1016/j.cie.2018.07.045.
  • Ozsoydan, F. B. 2019a. “Artificial Search Agents with Cognitive Intelligence for Binary Optimization Problems.” Computers & Industrial Engineering 136: 18–30. doi:10.1016/j.cie.2019.07.007.
  • Ozsoydan, F. B. 2019b. “Effects of Dominant Wolves in Grey Wolf Optimization Algorithm.” Applied Soft Computing 83: 105658. doi:10.1016/j.asoc.2019.105658.
  • Ozsoydan, F. B., and A. Baykasoglu. 2019. “A Swarm Intelligence-Based Algorithm for the set-Union Knapsack Problem.” Future Generation Computer Systems 93: 560–569. doi:10.1016/j.future.2018.08.002.
  • Ozsoydan, F. B., and A. Sipahioglu. 2013. “Heuristic Solution Approaches for the Cumulative Capacitated Vehicle Routing Problem.” Optimization 62 (10): 1321–1340. doi:10.1080/02331934.2013.841158.
  • Pochet, Y., and L. A. Wolsey. 1988. “Lot-size Models with Backlogging: Strong Reformulations and Cutting Planes.” Mathematical Programming 40 (1): 317–335. doi:10.1007/BF01580738.
  • Rahmani, A., and S. A. MirHassani. 2014. “A Hybrid Firefly-Genetic Algorithm for the Capacitated Facility Location Problem.” Information Sciences 283: 70–78. doi:10.1016/j.ins.2014.06.002.
  • Rahmati, R., M. Bashiri, E. Nikzad, and A. Siadat. 2021. “A two-Stage Robust hub Location Problem with Accelerated Benders Decomposition Algorithm.” International Journal of Production Research, in press. doi:10.1080/00207543.2021.1953179.
  • Ryu, J., and S. Park. 2022. “A Branch-and-Price Algorithm for the Robust Single-Source Capacitated Facility Location Problem Under Demand Uncertainty.” EURO Journal on Transportation and Logistics 100069), doi:10.1016/j.ejtl.2021.100069.
  • Saif, A., and E. Delage. 2021. “Data-driven Distributionally Robust Capacitated Facility Location Problem.” European Journal of Operational Research 291 (3): 995–1007. doi:10.1007/s11590-021-01848-4.
  • Senne, E. L., L. A. Lorena, and M. A. Pereira. 2005. “A Branch-and-Price Approach to p-Median Location Problems.” Computers & Operations Research 32 (6): 1655–1664. doi:10.1016/j.cor.2003.11.024.
  • Silva, F. J. F., and D. S. De la Figuera. 2007. “A Capacitated Facility Location Problem with Constrained Backlogging Probabilities.” International Journal of Production Research 45 (21): 5117–5134. doi:10.1080/00207540600823195.
  • Souto, G., I. Morais, G. R. Mauri, G. M. Ribeiro, and P. H. González. 2021. “A Hybrid Matheuristic for the Two-Stage Capacitated Facility Location Problem.” Expert Systems with Applications 185: 115501. doi:10.1016/j.eswa.2021.115501.
  • Storn, R., and K. Price. 1997. “Differential Evolution–a Simple and Efficient Heuristic for Global Optimization Over Continuous Spaces.” Journal of Global Optimization 11 (4): 341–359. doi:10.1023/A:1008202821328.
  • Sun, M. 2012. “A Tabu Search Heuristic Procedure for the Capacitated Facility Location Problem.” Journal of Heuristics 18 (1): 91–118. doi:10.1007/s10732-011-9157-3.
  • Van Roy, T. J. 1986. “A Cross Decomposition Algorithm for Capacitated Facility Location.” Operations Research 34 (1): 145–163. doi:10.1287/opre.34.1.145.
  • Wentges, P. 1996. “Accelerating Benders’ Decomposition for the Capacitated Facility Location Problem.” Mathematical Methods of Operations Research 44 (2): 267–290. doi:10.1007/BF01194335.
  • Wu, T., F. Chu, Z. Yang, Z. Zhou, and W. Zhou. 2017. “Lagrangean Relaxation and Hybrid Simulated Annealing Tabu Search Procedure for a two-Echelon Capacitated Facility Location Problem with Plant Size Selection.” International Journal of Production Research 55 (9): 2540–2555. doi:10.1080/00207543.2016.1240381.
  • Wu, L. Y., X. S. Zhang, and J. L. Zhang. 2006. “Capacitated Facility Location Problem with General Setup Cost.” Computers & Operations Research 33 (5): 1226–1241. doi:10.1016/j.cor.2004.09.012.
  • Yamamoto, H. 2018. “A heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.” PhD diss., Texas A&M University.
  • Zhang, J., B. Chen, and Y. Ye. 2005. “A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem.” Mathematics of Operations Research 30 (2): 389–403. doi:10.1287/moor.1040.0125.
  • Zhang, B., M. Zhao, and X. Hu. 2022. “Location Planning of Electric Vehicle Charging Station with Users’ Preferences and Waiting Time: Multi-Objective bi-Level Programming Model and HNSGA-II Algorithm.” International Journal of Production Research, in press. doi:10.1080/00207543.2021.2023832.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.