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

Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-known metaheuristics to solve complex combinatorial optimisation problems (COPs). This paper proposes two extensions of the typical GRASP framework. On the one hand, applying biased randomisation techniques during the solution construction phase enhances the efficiency of the GRASP solving approach compared to the traditional use of a restricted candidate list. On the other hand, the inclusion of simulation at certain points of the GRASP framework constitutes an efficient simulation–optimisation approach that allows to solve stochastic versions of COPs. To show the effectiveness of these GRASP improvements and extensions, tests are run with both deterministic and stochastic problem settings related to flow shop scheduling, vehicle routing, and facility location.

[1]  Angel A. Juan,et al.  SimILS: a simulation-based extension of the iterated local search metaheuristic for stochastic combinatorial optimization , 2016, J. Simulation.

[2]  Angel A. Juan,et al.  A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs , 2016, Expert Syst. Appl..

[3]  Imma Ribas,et al.  Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization , 2015, Comput. Ind. Eng..

[4]  George L. Nemhauser,et al.  The uncapacitated facility location problem , 1990 .

[5]  Mauricio G. C. Resende,et al.  A hybrid multistart heuristic for the uncapacitated facility location problem , 2006, Eur. J. Oper. Res..

[6]  Angel A. Juan,et al.  Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem , 2015, Int. Trans. Oper. Res..

[7]  Celso C. Ribeiro,et al.  Multi-start methods for combinatorial optimization , 2013, Eur. J. Oper. Res..

[8]  Angel A. Juan,et al.  Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic , 2017, J. Oper. Res. Soc..

[9]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[10]  Angel A. Juan,et al.  A simheuristic algorithm for solving the permutation flow shop problem with stochastic processing times , 2014, Simul. Model. Pract. Theory.

[11]  Maurício Resende,et al.  GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .

[12]  Abraham Duarte,et al.  Advanced Greedy Randomized Adaptive Search Procedure for the Obnoxious p-Median problem , 2016, Eur. J. Oper. Res..

[13]  Angel A. Juan,et al.  Biased randomization of heuristics using skewed probability distributions: A survey and some applications , 2017, Comput. Ind. Eng..

[14]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[15]  Angel A. Juan,et al.  A biased-randomized algorithm for the two-dimensional vehicle routing problem with and without item rotations , 2014, Int. Trans. Oper. Res..

[16]  Javier Faulin,et al.  Using parallel & distributed computing for real-time solving of vehicle routing problems with stochastic demands , 2011, Annals of Operations Research.

[17]  Yannis Marinakis,et al.  Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem , 2012, Expert Syst. Appl..

[18]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[19]  Alan M. Frieze,et al.  Probabilistic Analysis of a Relaxation for the k-Median Problem , 1986, Math. Oper. Res..

[20]  Angel A. Juan,et al.  A discrete-event driven metaheuristic for dynamic home service routing with synchronised trip sharing , 2016 .

[21]  Christian Prins,et al.  Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking , 2006, 4OR.

[22]  Joaquín A. Pacheco,et al.  A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times , 2011, Comput. Math. Appl..

[23]  Magdalene Marinaki,et al.  A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands , 2016, Expert Syst. Appl..

[24]  Tom Page,et al.  A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints , 2011 .

[25]  Jésica de Armas,et al.  A hybrid GRASP-VNS for ship routing and scheduling problem with discretized time windows , 2015, Eng. Appl. Artif. Intell..

[26]  G. Prabhaharan,et al.  Implementation of grasp in flow shop scheduling , 2006 .

[27]  Laura Calvet,et al.  Waste collection under uncertainty: a simheuristic based on variable neighbourhood search , 2017 .

[28]  Renato F. Werneck,et al.  Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem , 2004, Math. Program..

[29]  Christian Prins,et al.  Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking , 2012, Eur. J. Oper. Res..

[30]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[31]  Renata M. Aiex,et al.  Parallel GRASP with path-relinking for job shop scheduling , 2003, Parallel Comput..

[32]  Angel A. Juan,et al.  A review of simheuristics: Extending metaheuristics to deal with stochastic combinatorial optimization problems , 2015 .

[33]  Angel A. Juan,et al.  An ILS-biased randomization algorithm for the two-dimensional loading HFVRP with sequential loading and items rotation , 2016, J. Oper. Res. Soc..

[34]  Celso C. Ribeiro,et al.  Optimization by GRASP: Greedy Randomized Adaptive Search Procedures , 2016 .

[35]  Michel Gendreau,et al.  Handbook of Metaheuristics , 2010 .

[36]  Stanley E. Griffis,et al.  Metaheuristics in Logistics and Supply Chain Management , 2012 .

[37]  Mauricio G. C. Resende,et al.  Multiobjective GRASP with Path Relinking , 2015, Eur. J. Oper. Res..

[38]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[39]  Angel A. Juan,et al.  A simheuristic algorithm for the Single-Period Stochastic Inventory-Routing Problem with stock-outs , 2014, Simul. Model. Pract. Theory.

[40]  Barry B. Barrios,et al.  MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems , 2013 .

[41]  Nouredine Melab,et al.  Parallel multi‐core hyper‐heuristic GRASP to solve permutation flow‐shop problem , 2017, Concurr. Comput. Pract. Exp..

[42]  Celso C. Ribeiro,et al.  GRASP with path-relinking , 2016 .

[43]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[44]  Angel A. Juan,et al.  Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands , 2011 .

[45]  Mauricio G. C. Resende,et al.  Improved heuristics for the regenerator location problem , 2014, Int. Trans. Oper. Res..

[46]  Angel A. Juan,et al.  A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals , 2017, Ann. Oper. Res..

[47]  Angel A. Juan,et al.  A simulation-optimization approach to deploy Internet services in large-scale systems with user-provided resources , 2014, Simul..

[48]  Angel A. Juan,et al.  A Biased-Randomised Large Neighbourhood Search for the two-dimensional Vehicle Routing Problem with Backhauls , 2016, Eur. J. Oper. Res..

[49]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[50]  Angel A. Juan,et al.  A biased-randomized metaheuristic for the capacitated location routing problem , 2017, Int. Trans. Oper. Res..

[51]  Angel A. Juan,et al.  Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet , 2016, Ann. Oper. Res..

[52]  Saïd Salhi,et al.  Handbook of Metaheuristics (2nd edition) , 2014, J. Oper. Res. Soc..

[53]  Juan José Ramos,et al.  A simheuristic algorithm for solving the arc-routing problem with stochastic demands , 2018, J. Simulation.

[54]  Angel A. Juan,et al.  Supporting multi-depot and stochastic waste collection management in clustered urban areas via simulation–optimization , 2017, J. Simulation.

[55]  Ángel Corberán,et al.  GRASP for the uncapacitated r-allocation p-hub median problem , 2014, Comput. Oper. Res..

[56]  Gert W. Wolf,et al.  Facility location: concepts, models, algorithms and case studies. Series: Contributions to Management Science , 2011, Int. J. Geogr. Inf. Sci..

[57]  Angel A. Juan,et al.  Horizontal cooperation in road transportation: a case illustrating savings in distances and greenhouse gas emissions , 2015, Int. Trans. Oper. Res..

[58]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[59]  Giovanni Felici,et al.  Logic classification and feature selection for biomedical data , 2008, Comput. Math. Appl..

[60]  Nacima Labadie,et al.  GRASP for the Vehicle Routing Problem with Time Windows, synchronization and precedence constraints , 2014, 2014 IEEE 10th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob).

[61]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[62]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..