{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T03:40:17Z","timestamp":1768102817131,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T00:00:00Z","timestamp":1313539200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10898-011-9769-z","type":"journal-article","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:49:47Z","timestamp":1313570987000},"page":"405-429","source":"Crossref","is-referenced-by-count":35,"title":["Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms"],"prefix":"10.1007","volume":"54","author":[{"given":"Celso C.","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[]},{"given":"Reinaldo","family":"Vallejos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,17]]},"reference":[{"key":"9769_CR1","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R.M. Aiex","year":"2005","unstructured":"Aiex R.M., Pardalos P.M., Resende M.G.C., Toraldo G.: GRASP with path relinking for three-index assignment. INFORMS J. Comput. 17, 224\u2013247 (2005)","journal-title":"INFORMS J. Comput."},{"key":"9769_CR2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex R.M., Resende M.G.C., Ribeiro C.C.: Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343\u2013373 (2002)","journal-title":"J. Heuristics"},{"key":"9769_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R.M. Aiex","year":"2007","unstructured":"Aiex R.M., Resende M.G.C., Ribeiro C.C.: TTTPLOTS: a perl program to create time-to-target plots. Optim. Lett. 1, 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"key":"9769_CR4","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., Tecchiolli G.: Parallel biased search for combinatorial optimization: genetic algorithms and TABU. Microproces. Microsyst. 16, 351\u2013367 (1992)","journal-title":"Microproces. Microsyst."},{"key":"9769_CR5","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S.A. Canuto","year":"2001","unstructured":"Canuto S.A., Resende M.G.C., Ribeiro C.C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks 38, 50\u201358 (2001)","journal-title":"Networks"},{"key":"9769_CR6","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1002\/net.20003","volume":"43","author":"G. Dahl","year":"2004","unstructured":"Dahl G., Johannessen B.: The 2-path network problem. Networks 43, 190\u2013199 (2004)","journal-title":"Networks"},{"key":"9769_CR7","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.: Slow annealing versus multiple fast annealing runs: An empirical investigation. Parallel Comput. 16, 269\u2013272 (1990)","journal-title":"Parallel Comput."},{"key":"9769_CR8","first-page":"605","volume-title":"Metaheuristics: Theory and Applications","author":"H.M.M. Ten Eikelder","year":"1996","unstructured":"Ten Eikelder H.M.M., Verhoeven M.G.A., Vossen T.W.M., Aarts E.H.L.: A probabilistic analysis of local search. In: Osman, I.H., Kelly, J.P. (eds) Metaheuristics: Theory and Applications, pp. 605\u2013618. Kluwer, Dordrecht, The Netherlands (1996)"},{"key":"9769_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"Feo T.A., Resende M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109\u2013133 (1995)","journal-title":"J. Glob. Optim."},{"key":"9769_CR10","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo T.A., Resende M.G.C., Smith S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"9769_CR11","unstructured":"Fonseca, E., Fuchsuber, R., Santos, L.F.M., Plastino, A., Martins, S.L.: Exploring the hybrid metaheuristic DM-GRASP for efficient server replication for reliable multicast. In: International Conference on Metaheuristics and Nature Inspired Computing, p. 44. Hammamet (2008)"},{"key":"9769_CR12","unstructured":"Hoos, H.H.: On the run-time behaviour of stochastic local search algorithms for SAT. In: Proceedings of the AAAI-99, pp. 661\u2013666. MIT Press (1999)"},{"key":"9769_CR13","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle T.: Evaluation of Las Vegas algorithms\u2014pitfalls and remedies. In: Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pp. 238\u2013245 (1998)","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"9769_CR14","unstructured":"Hoos, H.H., St\u00fctzle, T.: On the empirical evaluation of Las Vegas algorithms\u2014position paper. Technical report, Computer Science Department, University of British Columbia (1998)"},{"key":"9769_CR15","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Some surprising regularities in the behaviour of stochastic local search. Lecture Notes in Computer Science 1520, 470 (1998)","DOI":"10.1007\/3-540-49481-2_41"},{"key":"9769_CR16","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H.H. Hoos","year":"1999","unstructured":"Hoos H.H., St\u00fctzle T.: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artif. Intell. 112, 213\u2013232 (1999)","journal-title":"Artif. Intell."},{"key":"9769_CR17","unstructured":"Hyyti\u00e3, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Nordic Teletraffic Seminar 14, pp. 31\u201340. (1998)"},{"key":"9769_CR18","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv O., Hakimi S.L.: An algorithmic approach to network location problems ii: the p-medians. SIAM J. Appl. Math. 37, 513\u2013538 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"9769_CR19","first-page":"237","volume-title":"Quadratic Assignment and Related Problems, vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science","author":"Y. Li","year":"1994","unstructured":"Li Y., Pardalos P.M., Resende M.G.C.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P.M., Wolkowicz, H. (eds) Quadratic Assignment and Related Problems, vol. 16 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science, pp. 237\u2013261. American Mathematical Society, Providence (1994)"},{"key":"9769_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1007\/s10898-009-9430-2","volume":"46","author":"A.P. Lucena","year":"2010","unstructured":"Lucena A.P., Ribeiro C.C., Santos A.C.: A hybrid heuristic for the diameter constrained minimum spanning tree problem. J. Glob. Optim. 46, 363\u2013381 (2010)","journal-title":"J. Glob. Optim."},{"key":"9769_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"5","author":"P. Manohar","year":"2002","unstructured":"Manohar P., Manjunath D., Shevgaonkar R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Commun. Lett. 5, 211\u2013213 (2002)","journal-title":"IEEE Commun. Lett."},{"key":"9769_CR22","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"T.F. Noronha","year":"2006","unstructured":"Noronha T.F., Ribeiro C.C.: Routing and wavelength assignment by partition coloring. Eur. J. Oper. Res. 171, 797\u2013810 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9769_CR23","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L.J. Osborne","year":"1991","unstructured":"Osborne L.J., Gillett B.E.: A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA J. Comput. 3, 213\u2013225 (1991)","journal-title":"ORSA J. Comput."},{"key":"9769_CR24","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M.G.C. Resende","year":"1998","unstructured":"Resende M.G.C.: Computing approximate solutions of the maximum covering problem using GRASP. J. Heuristics 4, 161\u2013171 (1998)","journal-title":"J. Heuristics"},{"key":"9769_CR25","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1145\/293686.293690","volume":"24","author":"M.G.C. Resende","year":"1998","unstructured":"Resende M.G.C., Feo T.A., Smith S.H.: Algorithm 787: fortran subroutines for approximate solution of maximum independent set problems using GRASP. ACM Trans. Math. Softw. 24, 386\u2013394 (1998)","journal-title":"ACM Trans. Math. Softw."},{"key":"9769_CR26","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/225545.225553","volume":"22","author":"M.G.C. Resende","year":"1996","unstructured":"Resende M.G.C., Pardalos P.M., Li Y.: Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP. ACM Trans. Math. Softw. 22, 104\u2013118 (1996)","journal-title":"ACM Trans. Math. Softw."},{"key":"9769_CR27","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0166-218X(99)00171-7","volume":"100","author":"M.G.C. Resende","year":"2000","unstructured":"Resende M.G.C., Pitsoulis L.S., Pardalos P.M.: Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discret. Appl. Math. 100, 95\u2013113 (2000)","journal-title":"Discret. Appl. Math."},{"key":"9769_CR28","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.G.C. Resende","year":"1997","unstructured":"Resende M.G.C., Ribeiro C.C.: A GRASP for graph planarization. Networks 29, 173\u2013189 (1997)","journal-title":"Networks"},{"key":"9769_CR29","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M.G.C. Resende","year":"2005","unstructured":"Resende M.G.C., Ribeiro C.C.: GRASP with path-relinking: recent advances and applications. In: Ibaraki, T., Nonobe, K., Yagiura, M. (eds) Metaheuristics: Progress as Real Problem Solvers, pp. 29\u201363. Springer, Berlin (2005)"},{"key":"9769_CR30","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/978-1-4419-1665-5_10","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2010","unstructured":"Resende M.G.C., Ribeiro C.C.: Greedy randomized adaptive search procedures: advances and applications. In: Gendreau, M., Potvin, J.-Y. (eds) Handbook of Metaheuristics, 2nd edn, pp. 283\u2013319. Springer, Berlin (2010)","edition":"2"},{"key":"9769_CR31","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1145\/326147.326153","volume":"25","author":"C.C. Ribeiro","year":"1999","unstructured":"Ribeiro C.C., Resende M.G.C.: Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP. ACM Trans. Math. Softw. 25, 342\u2013352 (1999)","journal-title":"ACM Trans. Math. Softw."},{"key":"9769_CR32","doi-asserted-by":"crossref","first-page":"pp. 922","DOI":"10.1007\/3-540-45706-2_131","volume":"2400","author":"C.C. Ribeiro","year":"2002","unstructured":"Ribeiro C.C., Rosseti I.: A parallel GRASP heuristic for the 2-path network design problem. In: Lecture Notes in Computer Science 2400, pp. 922\u2013926 (2002)","journal-title":"In: Lecture Notes in Computer Science"},{"key":"9769_CR33","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.parco.2006.11.007","volume":"33","author":"C.C. Ribeiro","year":"2007","unstructured":"Ribeiro C.C., Rosseti I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Comput. 33, 21\u201335 (2007)","journal-title":"Parallel Comput."},{"key":"9769_CR34","first-page":"16","volume-title":"Engineering Stochastic Local Search Algorithms, vol. 5752 of Lecture Notes in Computer Science","author":"C.C. Ribeiro","year":"2009","unstructured":"Ribeiro C.C., Rosseti I., Vallejos R.: On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: St\u00fctzle, T., Biratari, M., Hoos, H.H. (eds) Engineering Stochastic Local Search Algorithms, vol. 5752 of Lecture Notes in Computer Science, pp. 16\u201330. Springer, Berlin (2009)"},{"key":"9769_CR35","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1111\/j.1475-3995.2008.00644.x","volume":"15","author":"L.F. Santos","year":"2008","unstructured":"Santos L.F., Martins S.L., Plastino A.: Applications of the DM-GRASP heuristic: a survey. Int. Trans. Oper. Res. 15, 387\u2013416 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"9769_CR36","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the AAAI-94, pp. 337\u2013343. MIT Press (1994)"},{"key":"9769_CR37","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E.D. Taillard","year":"1991","unstructured":"Taillard E.D.: Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443\u2013455 (1991)","journal-title":"Parallel Comput."},{"key":"9769_CR38","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M.G.A. Verhoeven","year":"1995","unstructured":"Verhoeven M.G.A., Aarts E.H.L.: Parallel local search. J. Heuristics 1, 43\u201366 (1995)","journal-title":"J. Heuristics"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9769-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9769-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9769-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T00:07:11Z","timestamp":1560470831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9769-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,17]]},"references-count":38,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["9769"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9769-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,17]]}}}