{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:51:10Z","timestamp":1771491070244,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,5]]},"DOI":"10.1023\/a:1015061802659","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T22:07:59Z","timestamp":1041113279000},"page":"343-373","source":"Crossref","is-referenced-by-count":117,"title":["Probability Distribution of Solution Time in GRASP: An Experimental Investigation"],"prefix":"10.1007","volume":"8","author":[{"given":"Renata M.","family":"Aiex","sequence":"first","affiliation":[]},{"given":"Mauricio G.C.","family":"Resende","sequence":"additional","affiliation":[]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"403307_CR1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0141-9331(92)90003-C","volume":"16","author":"R. Battiti","year":"1992","unstructured":"Battiti, R. and G. Tecchiolli. (1992). \u201cParallel Biased Search for Combinatorial Optimization: Genetic Algorithms and TABU.\u201d Microprocessors and Microsystems 16, 351\u2013367.","journal-title":"Microprocessors and Microsystems"},{"key":"403307_CR2","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B. (1985). Random Graphs. San Diego, CA: Academic Press."},{"key":"403307_CR3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(91)90197-4","volume":"55","author":"R. Burkard","year":"1991","unstructured":"Burkard, R., S. Karisch, and F. Rendl. (1991). \u201cQAPLIB\u2014A Quadratic Assignment Problem Library.\u201d European Journal of Operations Research 55, 115\u2013119.","journal-title":"European Journal of Operations Research"},{"key":"403307_CR4","volume-title":"Graphical Methods for Data Analysis","author":"J.M. Chambers","year":"1983","unstructured":"Chambers, J.M., W.S. Cleveland, B. Kleiner, and P.A. Tukey. (1983). Graphical Methods for Data Analysis. London: Chapman &;; Hall."},{"key":"403307_CR5","unstructured":"Cimikowski, R. (1995). \u201cAn Analysis of Heuristics for the Maximum Planar Subgraph Problem.\u201d In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms, pp. 322\u2013331."},{"key":"403307_CR6","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0167-8191(90)90063-F","volume":"16","author":"N. Dodd","year":"1990","unstructured":"Dodd, N. (1990). \u201cSlow Annealing versus Multiple Fast Annealing Runs: An Empirical Investigation.\u201d Parallel Computing 16, 269\u2013272.","journal-title":"Parallel Computing"},{"key":"403307_CR7","first-page":"605","volume-title":"Metaheuristics: Theory &;; Applications","author":"H.T. Eikelder","year":"1996","unstructured":"Eikelder, H.T., M. Verhoeven, T. Vossen, and E. Aarts. (1996). \u201cA Probabilistic Analysis of Local Search.\u201d In I. Osman and J. Kelly (eds.), Metaheuristics: Theory &;; Applications. Norwell, MA: Kluwer Academic Publishers, pp. 605\u2013618."},{"key":"403307_CR8","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T. Feo","year":"1989","unstructured":"Feo, T. and M. Resende. (1989). \u201cA Probabilistic Heuristic for a Computationally Difficult Set Covering Problem.\u201d Operations Research Letters 8, 67\u201371.","journal-title":"Operations Research Letters"},{"key":"403307_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T. and M. Resende. (1995). \u201cGreedy Randomized Adaptive Search Procedures.\u201d Journal of Global Optimization 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"403307_CR10","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T. Feo","year":"1994","unstructured":"Feo, T., M. Resende, and S. Smith. (1994). \u201cA Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.\u201d Operations Research 42, 860\u2013878.","journal-title":"Operations Research"},{"key":"403307_CR11","series-title":"Technical Report","volume-title":"GRASP: An Annotated Bibliography","author":"P. Festa","year":"2000","unstructured":"Festa, P. and M. Resende. (2000). \u201cGRASP: An Annotated Bibliography.\u201d Technical Report, AT &;; T Labs Research, Florham Park, NJ 07733."},{"key":"403307_CR12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1287\/ijoc.11.2.198","volume":"11","author":"C. Fleurent","year":"1999","unstructured":"Fleurent, C. and F. Glover. (1999). \u201cImproved Constructive Multistart Strategies for the Quadratic Assignment Problem using Adaptive Memory.\u201d INFORMS Journal on Computing 11, 198\u2013204.","journal-title":"INFORMS Journal on Computing"},{"key":"403307_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/net.3230240203","volume":"24","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt, O. and A. Takvorian. (1994). \u201cAn Efficient Graph Planarization Two-Phase Heuristic.\u201d Networks 24, 69\u201373.","journal-title":"Networks"},{"key":"403307_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J. Hart","year":"1987","unstructured":"Hart, J. and A. Shogan. (1987). \u201cSemi-Greedy Heuristics: An Empirical Study.\u201d Operations Research Letters 6, 107\u2013114.","journal-title":"Operations Research Letters"},{"key":"403307_CR15","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H. Hoos","year":"1999","unstructured":"Hoos, H. and T. St\u00fctzle. (1999). \u201cTowards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT.\u201d Artificial Intelligence 112, 213\u2013232.","journal-title":"Artificial Intelligence"},{"key":"403307_CR16","series-title":"DIMACS Series on Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1090\/dimacs\/016\/12","volume-title":"Quadratic Assignment and Related Problems","author":"Y. Li","year":"1994","unstructured":"Li, Y., P. Pardalos, and M. Resende. (1994). \u201cA Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem.\u201d In P. Pardalos and H. Wolkowicz (eds.), Quadratic Assignment and Related Problems, Vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society, pp. 237\u2013261."},{"key":"403307_CR17","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1023\/A:1026546708757","volume":"17","author":"S. Martins","year":"2000","unstructured":"Martins, S., M. Resende, C. Ribeiro, and P. Pardalos. (2000). \u201cA Parallel GRASP for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy.\u201d Journal of Global Optimization 17, 267\u2013283.","journal-title":"Journal of Global Optimization"},{"key":"403307_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BFb0018547","volume-title":"Proceedings of IRREGULAR'98\u20135th International Symposium on Solving Irregularly Structured Problems in Parallel","author":"S. Martins","year":"1998","unstructured":"Martins, S., C. Ribeiro, and M. Souza. (1998). \u201cA Parallel GRASP for the Steiner Problem in Graphs.\u201d In A. Ferreira and J. Rolim (eds.), Proceedings of IRREGULAR'98\u20135th International Symposium on Solving Irregularly Structured Problems in Parallel, Vol. 1457 of Lecture Notes in Computer Science. Berlin: Springer-Verlag, pp. 285\u2013297."},{"key":"403307_CR19","series-title":"IMA Volumes in Mathematics and Its Applications","first-page":"159","volume-title":"Parallel Processing of Discrete Problems","author":"R. Murphey","year":"1998","unstructured":"Murphey, R., P. Pardalos, and L. Pitsoulis. (1998). \u201cA Parallel GRASP for the Data Association Multidimensional Assignment Problem.\u201d In P. Pardalos (ed.), Parallel Processing of Discrete Problems, Vol. 106 of The IMA Volumes in Mathematics and Its Applications. Berlin: Springer-Verlag, pp. 159\u2013180."},{"key":"403307_CR20","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L. Osborne","year":"1991","unstructured":"Osborne, L. and B. Gillett. (1991). \u201cA Comparison of Two Simulated Annealing Algorithms Applied to the Directed Steiner Problem on Networks.\u201d In ORSA J. Computing 3, 213\u2013225.","journal-title":"ORSA J. Computing"},{"key":"403307_CR21","first-page":"111","volume-title":"Parallel Algorithms for Irregularly Structured Problems\u2014 Irregular'94","author":"P. Pardalos","year":"1995","unstructured":"Pardalos, P., L. Pitsoulis, and M. Resende. (1995). \u201cA Parallel GRASP Implementation for the Quadratic Assignment Problem.\u201d In A. Ferreira and J. Rolim (eds.), Parallel Algorithms for Irregularly Structured Problems\u2014 Irregular'94. Norwell, MA: Kluwer Academic Publishers, pp. 111\u2013130."},{"key":"403307_CR22","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/3-540-62095-8_62","volume":"1184","author":"P. Pardalos","year":"1996","unstructured":"Pardalos, P., L. Pitsoulis, and M. Resende. (1996). \u201cA Parallel GRASP for MAX-SAT Problems.\u201d In Lecture Notes in Computer Science, Vol. 1184, pp. 575\u2013585.","journal-title":"Lecture Notes in Computer Science"},{"key":"403307_CR23","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1145\/264029.264038","volume":"23","author":"P. Pardalos","year":"1997","unstructured":"Pardalos, P., L. Pitsoulis, and M. Resende. (1997). \u201cAlgorithm 769 Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems using GRASP.\u201d ACM Transactions on Mathematical Software 23, 196\u2013208.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"403307_CR24","unstructured":"Rangel, M., N. Abreu, and P. Boaventura Netto. (1999) \u201cGRASP: In the QAP: An Acceptance Bound for Initial Solution.\u201d In Proc. of the Third Metaheuristics International Conference, pp. 381\u2013386."},{"key":"403307_CR25","series-title":"Technical Report, Production Engineering Program","volume-title":"A Modified Local Search for GRASP in the Quadratic Assignment Problem","author":"M. Rangel","year":"1998","unstructured":"Rangel, M., N. de Abreu, P. Boaventura Netto, and M. Boeres. (1998), \u201cA Modified Local Search for GRASP in the Quadratic Assignment Problem.\u201d Technical Report, Production Engineering Program, COPPE, Federal University of Rio de Janeiro, Rio de Janeiro, RJ Brazil."},{"key":"403307_CR26","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M. Resende","year":"1998","unstructured":"Resende, M. (1998). \u201cComputing Approximate Solutions of the Maximum Covering Problem using GRASP.\u201d J. Heuristics 4, 161\u2013171.","journal-title":"J. Heuristics"},{"key":"403307_CR27","series-title":"DIMACS Series on Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1090\/dimacs\/026\/24","volume-title":"Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge","author":"M. Resende","year":"1996","unstructured":"Resende, M. and T. Feo. (1996). \u201cA GRASP for Satisfiability.\u201d In D. Johnson and M. Trick (eds.), Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge, Vol. 26 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society, pp. 499\u2013520."},{"key":"403307_CR28","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1145\/293686.293690","volume":"24","author":"M. Resende","year":"1998","unstructured":"Resende, M., T. Feo, and S. Smith. (1998). \u201cAlgorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems using GRASP.\u201d ACM Trans. Math. Software 24, 386\u2013394.","journal-title":"ACM Trans. Math. Software"},{"key":"403307_CR29","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/225545.225553","volume":"22","author":"M. Resende","year":"1996","unstructured":"Resende, M., P. Pardalos, and Y. Li. (1996). \u201cAlgorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems using GRASP.\u201d ACM Transactions on Mathematical Software 22, 104\u2013118.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"403307_CR30","series-title":"DIMACS Series on Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1090\/dimacs\/035\/11","volume-title":"Satisfiability Problems","author":"M. Resende","year":"1997","unstructured":"Resende, M., L. Pitsoulis, and P. Pardalos. (1997). \u201cApproximate Solution of Weighted MAX-SAT Problems using GRASP.\u201d In J. Gu and P. Pardalos (eds.), Satisfiability Problems, Vol. 35 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society, pp. 393\u2013405."},{"key":"403307_CR31","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0166-218X(99)00171-7","volume":"100","author":"M. Resende","year":"2000","unstructured":"Resende, M., L. Pitsoulis, and P. Pardalos. (2000). \u201cFortran Subroutines for Computing Approximate Solutions of MAX-SAT Problems using GRASP.\u201d Discrete Applied Mathematics 100, 95\u2013113.","journal-title":"Discrete Applied Mathematics"},{"key":"403307_CR32","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1002\/(SICI)1097-0037(199705)29:3<173::AID-NET5>3.0.CO;2-E","volume":"29","author":"M. Resende","year":"1997","unstructured":"Resende, M. and C. Ribeiro. (1997). \u201cA GRASP for Graph Planarization.\u201d Networks 29, 173\u2013189.","journal-title":"Networks"},{"key":"403307_CR33","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/326147.326153","volume":"25","author":"C. Ribeiro","year":"1999","unstructured":"Ribeiro, C. and M. Resende. (1999). \u201cAlgorithm 797: Fortran Subroutines for Approximate Solution of Graph Planarization Problems using GRASP.\u201d ACM Transactions on Mathematical Software 25, 341\u2013352.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"403307_CR34","first-page":"337","volume-title":"Proceedings of the AAAI-94","author":"B. Selman","year":"1994","unstructured":"Selman, B., H. Kautz, and B. Cohen. (1994). \u201cNoise Strategies for Improving Local Search.\u201d In Proceedings of the AAAI-94, Cambridge, MA: MIT Press, pp. 337\u2013343."},{"key":"403307_CR35","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E. (1991). \u201cRobust Taboo Search for the Quadratic Assignment Problem.\u201d Parallel Computing 17, 443\u2013455.","journal-title":"Parallel Computing"},{"key":"403307_CR36","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M. Verhoeven","year":"1995","unstructured":"Verhoeven, M. and E. Aarts. (1995). \u201cParallel Local Search.\u201d J. Heuristics 1, 43\u201366.","journal-title":"J. Heuristics"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015061802659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1015061802659\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1015061802659.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:11:49Z","timestamp":1747653109000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1015061802659"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["403307"],"URL":"https:\/\/doi.org\/10.1023\/a:1015061802659","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}