Enhancing and extending the classical GRASP framework with biased randomisation and simulation

References

• Ahn, S., Cooper, C., Cornuejols, G., & Frieze, A. (1988). Probabilistic analysis of a relaxation for the k-median problem. Mathematics of Operations Research, 13(1), 1–31. doi:10.1287/moor.13.1.1
   Web of Science ®Google Scholar
• Aiex, R., Binato, S., & Resende, M. (2003). Parallel GRASP with path-relinking for job shop scheduling. Parallel Computing, 29(4), 393–430. doi:10.1016/S0167-8191(03)00014-0
   Web of Science ®Google Scholar
• Alekseeva, E., Mezmaz, M.-S., Tuyttens, D., & Melab, N. (2017). Parallel multi-core hyper-heuristic grasp to solve permutation flow-shop problem. Concurrency and Computation: Practice and Experience, 29(9), e3835. doi:10.1002/cpe.3835
   Web of Science ®Google Scholar
• Ángel-Bello, F., Álvarez, A., Pacheco, J., & Martínez, I. (2011). A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times. Computers & Mathematics with Applications, 61(4), 797–808. doi:10.1016/j.camwa.2010.12.028
   Web of Science ®Google Scholar
• Augerat, P., Belenguer, J., Benavent, E., Corberán, A., Naddef, D., & Giovanni, R. (1998). Computational results with a branch and cut code for the capacitated vehicle routing problem (Technical Report IASI Research Report No. 495). Rome, Italy: Institute for Systems Analysis and Computer Science. Retrieved from http://www.iasi.cnr.it/reports_html/R495.
   Google Scholar
• Bertolazzi, P., Felici, G., Festa, P., & Lancia, G. (2008). Logic classification and feature selection for biomedical data. Computers & Mathematics with Applications, 55(5), 889–899. doi:10.1016/j.camwa.2006.12.093
   Web of Science ®Google Scholar
• Cabrera, G., Juan, A., Lazaro, D., Marques, J. M., & Proskurnia, I. (2014). A simulation-optimization approach to deploy Internet services in large-scale systems with user-provided resources. Simulation-Transactions of the Society for Modeling and Simulation International, 90(6), 644. doi:10.1177/0037549714531350
   Web of Science ®Google Scholar
• Colmenar, J. M., Greistorfer, P., Martí, R., & Duarte, A. (2016). Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem. European Journal of Operational Research, 252(2), 432–442. doi:10.1016/j.ejor.2016.01.047
   Web of Science ®Google Scholar
• Cornuejols, G., Nemhauser, G., & Wolsey, L. (1990). The uncapacitated facility location problem. In Pitu B. Mirchandani, & Richard L. Francis (Eds.), Discrete location theory (pp. 119–171). Hoboken, New Jersey: Wiley.
   Google Scholar
• de Armas, J., Cadarso, L., Juan, A. A., & Faulin, J. (2017). A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals. Annals of Operations Research, 258(2), 825–848. doi:10.1007/s10479-016-2260-y
   Web of Science ®Google Scholar
• de Armas, J., Juan, A. A., Marques, J., & Pedroso, J. (2017). Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic. Journal of the Operational Research Society, 68(10), 1161–1176.
   Web of Science ®Google Scholar
• de Armas, J., Lalla-Ruiz, E., Expósito-Izquierdo, C., Landa-Silva, D., & Melián-Batista, B. (2015). A hybrid grasp-vns for ship routing and scheduling problem with discretized time windows. Engineering Applications of Artificial Intelligence, 45, 350–360. doi:10.1016/j.engappai.2015.07.013
   Web of Science ®Google Scholar
• Domínguez, O., Guimarans, D., Juan, A. A., & de la Nuez, I. (2016). A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. European Journal of Operational Research, 255(2), 442–462. doi:10.1016/j.ejor.2016.05.002
   Web of Science ®Google Scholar
• Domínguez, O., Juan, A. A., Barrios, B., Faulin, J., & Agustin, A. (2016). Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet. Annals of Operations Research, 236(2), 383–404. doi:10.1007/s10479-014-1551-4
   Web of Science ®Google Scholar
• Domínguez, O., Juan, A. A., & Faulin, J. (2014). A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations. International Transactions in Operational Research, 21(3), 375–398. doi:10.1111/itor.12070
   Web of Science ®Google Scholar
• Domínguez, O., Juan Pérez, A. A., de la Nuez Pestana, I. A., & Ouelhadj, D. (2016). An ils-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation. Journal of the Operational Research Society, 67(1), 37–53. doi:10.1057/jors.2015.48
   Web of Science ®Google Scholar
• Duarte, A., Marti, R., Resende, M., & Silva, R. (2014). Improved heuristics for the regenerator location problem. International Transactions in Operational Research, 21(4), 541–558. doi:10.1111/itor.12085
   Web of Science ®Google Scholar
• Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109–133. doi:10.1007/BF01096763
   Web of Science ®Google Scholar
• Ferrer, A., Guimarans, D., Ramalhinho, H., & Juan, A. (2016). A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs. Expert Systems with Applications, 44, 177–186. doi:10.1016/j.eswa.2015.09.011
   Web of Science ®Google Scholar
• Festa, P., & Resende, M. G. C. (2009a). An annotated bibliography of GRASP 16/j.eswa.2015.09.01. International Transactions in Operational Research, 16(1), 1–24. doi:10.1111/j.1475-3995.2009.00663.x
   Web of Science ®Google Scholar
• Festa, P., & Resende, M. G. C. (2009b). An annotated bibliography of GRASP 11/j.1475-3995.2009.0ns. International Transactions in Operational Research, 16(2), 131–172. doi:10.1111/j.1475-3995.2009.00664.x
   Web of Science ®Google Scholar
• Fikar, C., Juan, A. A., Martinez, E., & Hirsch, P. (2016). A discrete-event driven metaheuristic for dynamic home service routing with synchronised trip sharing. European J. Of Industrial Engineering, 10(3), 323–340. doi:10.1504/EJIE.2016.076382
   Web of Science ®Google Scholar
• Fukasawa, R., Longo, H., Lysgaard, J., Aragão, M. P D., Reis, M., Uchoa, E., & Werneck, R. F. (2006). Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming, 106(3), 491–511. doi:10.1007/s10107-005-0644-x
   Web of Science ®Google Scholar
• Garey, M. R., Johnson, D. S., & Sethi, R. (1976). The complexity of flowshop and jobshop scheduling. Mathematics of Operations Research, 1(2), 117–129. doi:10.1287/moor.1.2.117
   Google Scholar
• Gendreau, M., & Potvin, J.-Y. (2010). Handbook of metaheuristics (2nd ed.). New York, USA: Springer Publishing Company, Incorporated.
   Google Scholar
• Gonzalez-Martin, S., Juan, A. A., Riera, D., Elizondo, M. G., & Ramos, J. J. (2017). A simheuristic algorithm for solving the arc-routing problem with stochastic demands. Journal of Simulation,12(1), 53–66.
   PubMed Web of Science ®Google Scholar
• Grasas, A., Juan, A. A., Faulin, J., de Armas, J., & Ramalhinho, H. (2017). Biased randomization of heuristics using skewed probability distributions: A survey and some applications. Computers & Industrial Engineering, 110, 216–228. doi:10.1016/j.cie.2017.06.019
   Web of Science ®Google Scholar
• Grasas, A., Juan, A., & Lourenço, H. R. (2016). SimILS: A simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization. Journal of Simulation, 10(1), 69–77. doi:10.1057/jos.2014.25
   Web of Science ®Google Scholar
• Griffis, S. E., Bell, J. E., & Closs, D. J. (2012). Metaheuristics in logistics and supply chain management. Journal of Business Logistics, 33(2), 90–106. doi:10.1111/j.0000-0000.2012.01042.x
   Web of Science ®Google Scholar
• Gruler, A., Araújo, C. L. Q., Calvet, L., & Juan, A. A. (2017). Waste collection under uncertainty: a simheuristic based on variable neighbourhood search. European Journal of Industrial Engineering, 11(2), 228–255. doi:10.1504/EJIE.2017.083257
   Web of Science ®Google Scholar
• Gruler, A., Fikar, C., Juan, A. A., Hirsch, P., & Contreras-Bolton, C. (2017). Supporting multi-depot and stochastic waste collection management in clustered urban areas via simulationfis. Journal of Simulation, 11(1), 11–19.
   PubMed Web of Science ®Google Scholar
• Haddadene, S. R. A., Labadie, N., & Prodhon, C. (2016). A GRASP ILS for the vehicle routing problem with time windows, synchronization and precedence constraints. Expert Systems with Applications, 66, 274–294. doi:10.1016/j.eswa.2015.10.012
   Web of Science ®Google Scholar
• Juan, A. A., Barrios, B. B., Vallada, E., Riera, D., & Jorba, J. (2014). A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times. Simulation Modelling Practice and Theory, 46, 101–117. doi:10.1016/j.simpat.2014.02.005.
   Web of Science ®Google Scholar
• Juan, A. A., Faulin, J., Ferrer, A., Lourenço, H., & Barrios, B. (2013). MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems. TOP, 21(1), 109–132. doi:10.1007/s11750-011-0245-1
   Web of Science ®Google Scholar
• Juan, A. A., Faulin, J., Grasman, S., Riera, D., Marull, J., & Mendez, C. (2011). Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transportation Research Part C: Emerging Technologies, 19(5), 751–765. doi:10.1016/j.trc.2010.09.007
   Web of Science ®Google Scholar
• Juan, A. A., Faulin, J., Grasman, S. E., Rabe, M., & Figueira, G. (2015). A review of simheuristics: extending metaheuristics to deal with stochastic combinatorial optimization problems. Operations Research Perspectives, 2, 62–72. doi:10.1016/j.orp.2015.03.001
   Web of Science ®Google Scholar
• Juan, A. A., Faulin, J., Jorba, J., Caceres, J., & Marquès, J. M. (2013). Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands. Annals of Operations Research, 207(1), 43–65. doi:10.1007/s10479-011-0918-z
   Web of Science ®Google Scholar
• 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. doi:10.1016/j.simpat.2013.11.008
   Web of Science ®Google Scholar
• Juan, A. A., Pascual, I., Guimarans, D., & Barrios, B. (2015). Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem. International Transactions in Operational Research, 22(4), 647–667. doi:10.1111/itor.12101
   Web of Science ®Google Scholar
• Laguna, M., & Marti, R. (2002). Scatter search: Methodology and implementations in C. Norwell, MA: Kluwer Academic Publishers.
   Google Scholar
• Marinaki, M., & Marinakis, Y. (2016). A glowworm swarm optimization algorithm for the vehicle routing problem with stochastic demands. Expert Systems with Applications, 46, 145–163. doi:10.1016/j.eswa.2015.10.012
   Web of Science ®Google Scholar
• Marinakis, Y. (2012). Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem. Expert Systems with Applications, 39(8), 6807–6815. doi:10.1016/j.eswa.2012.01.015
   Web of Science ®Google Scholar
• Martí, R., Campos, V., Resende, M. G., & Duarte, A. (2015). Multiobjective GRASP with path relinking. European Journal of Operational Research, 240(1), 54–71. doi:10.1016/j.ejor.2014.06.042
   Web of Science ®Google Scholar
• Martí, R., Resende, M. G., & Ribeiro, C. C. (2013). Multi-start methods for combinatorial optimization. European Journal of Operational Research, 226(1), 1–8. doi:10.1016/j.ejor.2012.10.012
   Web of Science ®Google Scholar
• Nawaz, M., Enscore, E. E., & Ham, I. (1983). A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega, 11(1), 91–95. doi:10.1016/0305-0483(83)90088-9
   Web of Science ®Google Scholar
• Nguyen, V.-P., Prins, C., & Prodhon, C. (2012). Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. European Journal of Operational Research, 216(1), 113–126. doi:10.1016/j.ejor.2011.07.030
   Web of Science ®Google Scholar
• Peiró, J., Corberán, A., & Marti, R. (2014). GRASP for the uncapacitated r-allocation p-hub median problem. Computers & Operations Research, 43, 50–60. doi:10.1016/j.cor.2013.08.026
   Web of Science ®Google Scholar
• Pérez-Bernabeu, E., Juan, A. A., Faulin, J., & Barrios, B. B. (2015). Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions. International Transactions in Operational Research, 22(3), 585–606. doi:10.1111/itor.12130
   Web of Science ®Google Scholar
• Pinedo, M. L. (2008). Scheduling: Theory, algorithms, and systems (3rd ed.). New York, USA: Springer Publishing Company, Incorporated.
   Google Scholar
• Prabhaharan, G., Khan, B. S. H., & Rakesh, L. (2006). Implementation of GRASP in flow shop scheduling. The International Journal of Advanced Manufacturing Technology, 30(11–12), 1126–1131. doi:10.1007/s00170-005-0134-6
   Web of Science ®Google Scholar
• Prins, C., Prodhon, C., & Calvo, R. W. (2006). Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR, 4(3), 221–238. doi:10.1007/s10288-006-0001-9
   Google Scholar
• Quintero-Araujo, C. L., Caballero-Villalobos, J. P., Juan, A. A., & Montoya-Torres, J. R. (2017). A biased-randomized metaheuristic for the capacitated location routing problem. International Transactions in Operational Research, 24(5), 1079–1098.
   Web of Science ®Google Scholar
• Rajkumar, M., Asokan, P., Anilkumar, N., & Page, T. (2011). A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. International Journal of Production Research, 49(8), 2409–2423. doi:10.1080/00207541003709544
   Web of Science ®Google Scholar
• Resende, M., & Ribeiro, C. (2016a). Optimization by GRASP – Greedy randomized adaptive search procedures. New York, NY: Springer Science + Business Media.
   Google Scholar
• Resende, M. G., & Werneck, R. F. (2006). A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research, 174(1), 54–68. doi:10.1016/j.ejor.2005.02.046
   Web of Science ®Google Scholar
• Resende, M. G. C., & Ribeiro, C. C. (2003). GRASP: Greedy randomized adaptive search procedures. In F. Glover, & G. Kochenberger (Eds.), Handbook of metaheuristics (pp. 219–249). New York, NY: Springer.
   Google Scholar
• Resende, M. G. C., & Ribeiro, C. C. (2016b). GRASP with path-relinking. In Optimization by GRASP: Greedy randomized adaptive search procedures (pp. 189–204). New York, NY: Springer New York.
   Google Scholar
• Ribas, I., & Companys, R. (2015). Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization. Computers & Industrial Engineering, 87, 30–39. doi:10.1016/j.cie.2015.04.013
   Web of Science ®Google Scholar
• Taillard, E. (1993). Benchmarks for basic scheduling problems. European Journal of Operational Research, 64(2), 278–285. doi:10.1016/0377-2217(93)90182-M
   Web of Science ®Google Scholar
• Toth, P., & Vigo, D. (2014). Vehicle routing – Problems, methods and applications (2nd ed.). Philadelphia, PA: SIAM Monographs on Discrete Mathematics and Applications.
   Google Scholar
• Wolf, G. W. (2011). Facility location: concepts, models, algorithms and case studies. series: Contributions to management science. International Journal of Geographical Information Science, 25(2), 331–333. doi:10.1007/978-3-7908-2151-2
   Web of Science ®Google Scholar
• Zobolas, G. I., Tarantilis, C. D., & Ioannou, G. (2009). Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm. Computers & Operations Research, 36(4), 1249–1267. doi:10.1016/j.cor.2008.01.007
   Web of Science ®Google Scholar