{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:58Z","timestamp":1725536878559},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037504"},{"type":"electronic","value":"9783642037511"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03751-1_2","type":"book-chapter","created":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T05:27:42Z","timestamp":1251782862000},"page":"16-30","source":"Crossref","is-referenced-by-count":15,"title":["On the Use of Run Time Distributions to Evaluate and Compare Stochastic Local Search Algorithms"],"prefix":"10.1007","author":[{"given":"Celso C.","family":"Ribeiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reinaldo","family":"Vallejos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T. Feo","year":"1994","unstructured":"Feo, T., Resende, M., Smith, S.: A greedy randomized adaptive search procedure for maximum independent set. Operations Research\u00a042, 860\u2013878 (1994)","journal-title":"Operations Research"},{"key":"2_CR2","unstructured":"Hoos, H., St\u00fctzle, T.: On the empirical evaluation of Las Vegas algorithms - Position paper. Technical report, Computer Science Department, University of British Columbia (1998)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Hoos, H., St\u00fctzle, T.: Evaluation of Las Vegas algorithms - Pitfalls 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":"2_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R. Aiex","year":"2002","unstructured":"Aiex, R., Resende, M., Ribeiro, C.: Probability distribution of solution time in GRASP: An experimental investigation. Journal of Heuristics\u00a08, 343\u2013373 (2002)","journal-title":"Journal of Heuristics"},{"key":"2_CR5","doi-asserted-by":"publisher","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 Computing\u00a016, 269\u2013272 (1990)","journal-title":"Parallel Computing"},{"key":"2_CR6","first-page":"605","volume-title":"Metaheuristics: Theory and Applications","author":"H.T. Eikelder","year":"1996","unstructured":"Eikelder, H.T., Verhoeven, M., Vossen, T., Aarts, E.: A probabilistic analysis of local search. In: Osman, I., Kelly, J. (eds.) Metaheuristics: Theory and Applications, pp. 605\u2013618. Kluwer, Dordrecht (1996)"},{"key":"2_CR7","first-page":"661","volume-title":"Proc. AAAI 1999","author":"H. Hoos","year":"1999","unstructured":"Hoos, H.: On the run-time behaviour of stochastic local search algorithms for SAT. In: Proc. AAAI 1999, pp. 661\u2013666. MIT Press, Cambridge (1999)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H. Hoos","year":"1999","unstructured":"Hoos, H., St\u00fctzle, T.: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence\u00a0112, 213\u2013232 (1999)","journal-title":"Artificial Intelligence"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1287\/ijoc.3.3.213","volume":"3","author":"L. Osborne","year":"1991","unstructured":"Osborne, L., Gillett, B.: A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA Journal on Computing\u00a03, 213\u2013225 (1991)","journal-title":"ORSA Journal on Computing"},{"key":"2_CR10","first-page":"337","volume-title":"Proceedings of the AAAI 1994","author":"B. Selman","year":"1994","unstructured":"Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the AAAI 1994, pp. 337\u2013343. MIT Press, Cambridge (1994)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/S0167-8191(05)80147-4","volume":"17","author":"E. Taillard","year":"1991","unstructured":"Taillard, E.: Robust taboo search for the quadratic assignment problem. Parallel Computing\u00a017, 443\u2013455 (1991)","journal-title":"Parallel Computing"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M. Verhoeven","year":"1995","unstructured":"Verhoeven, M., Aarts, E.: Parallel local search. Journal of Heuristics\u00a01, 43\u201366 (1995)","journal-title":"Journal of Heuristics"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/3-540-49481-2_41","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"H. Hoos","year":"1998","unstructured":"Hoos, H., St\u00fctzle, T.: Some surprising regularities in the behaviour of stochastic local search. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, p. 470. Springer, Heidelberg (1998)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"R. Aiex","year":"2007","unstructured":"Aiex, R., Resende, M., Ribeiro, C.: TTTPLOTS: A perl program to create time-to-target plots. Optimization Letters\u00a01, 355\u2013366 (2007)","journal-title":"Optimization Letters"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.parco.2006.11.007","volume":"33","author":"C. Ribeiro","year":"2007","unstructured":"Ribeiro, C., Rosseti, I.: Efficient parallel cooperative implementations of GRASP heuristics. Parallel Computing\u00a033, 21\u201335 (2007)","journal-title":"Parallel Computing"},{"key":"2_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., Pardalos, P., Resende, M.: A greedy randomized adaptive search procedure for the quadratic assignment problem. In: Pardalos, P., Wolkowicz, H. (eds.) Quadratic Assignment and Related Problems. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a016, pp. 237\u2013261. American Mathematical Society, Providence (1994)"},{"key":"2_CR17","doi-asserted-by":"publisher","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., Ribeiro, C.: A GRASP for graph planarization. Networks\u00a029, 173\u2013189 (1997)","journal-title":"Networks"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0166-218X(99)00171-7","volume":"100","author":"M. Resende","year":"2000","unstructured":"Resende, M., Pitsoulis, L., Pardalos, P.: Fortran subroutines for computing approximate solutions of MAX-SAT problems using GRASP. Discrete Applied Mathematics\u00a0100, 95\u2013113 (2000)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M. Resende","year":"1998","unstructured":"Resende, M.: Computing approximate solutions of the maximum covering problem using GRASP. Journal of Heuristics\u00a04, 161\u2013171 (1998)","journal-title":"Journal of Heuristics"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"S. Canuto","year":"2001","unstructured":"Canuto, S., Resende, M., Ribeiro, C.: Local search with perturbations for the prize-collecting Steiner tree problem in graphs. Networks\u00a038, 50\u201358 (2001)","journal-title":"Networks"},{"key":"2_CR21","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/0-387-25383-1_2","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"M. Resende","year":"2005","unstructured":"Resende, M., Ribeiro, 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, Heidelberg (2005)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1287\/ijoc.1030.0059","volume":"17","author":"R. Aiex","year":"2005","unstructured":"Aiex, R., Pardalos, P., Resende, M., Toraldo, G.: GRASP with path relinking for three-index assignment. INFORMS Journal on Computing\u00a017, 224\u2013247 (2005)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/j.1475-3995.2008.00644.x","volume":"15","author":"L. Santos","year":"2008","unstructured":"Santos, L., Martins, S., Plastino, A.: Applications of the DM-GRASP heuristic: A survey. International Transactions in Operational Research\u00a015, 387\u2013416 (2008)","journal-title":"International Transactions in Operational Research"},{"key":"2_CR24","unstructured":"Fonseca, E., Fuchsuber, R., Santos, L., Plastino, A., Martins, S.: Exploring the hybrid metaheuristic DM-GRASP for efficient server replication for reliable multicast. In: International Conference on Metaheuristics and Nature Inspired Computing, Hammamet (2008)"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"T. Noronha","year":"2006","unstructured":"Noronha, T., Ribeiro, C.: Routing and wavelength assignment by partition coloring. European Journal of Operational Research\u00a0171, 797\u2013810 (2006)","journal-title":"European Journal of Operational Research"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/4234.1001667","volume":"5","author":"P. Manohar","year":"2002","unstructured":"Manohar, P., Manjunath, D., Shevgaonkar, R.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Communications Letters\u00a05, 211\u2013213 (2002)","journal-title":"IEEE Communications Letters"},{"key":"2_CR27","unstructured":"Hyyti\u00e3, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Nordic Teletraffic Seminar 14, pp. 31\u201340 (1998)"},{"key":"2_CR28","doi-asserted-by":"publisher","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\u00a043, 190\u2013199 (2004)","journal-title":"Networks"},{"key":"2_CR29","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M. Resende","year":"2003","unstructured":"Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 219\u2013249. Kluwer, Dordrecht (2003)"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03751-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T05:17:24Z","timestamp":1558502244000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03751-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037504","9783642037511"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03751-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}