{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:51:58Z","timestamp":1770972718280,"version":"3.50.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,10,31]],"date-time":"2006-10-31T00:00:00Z","timestamp":1162252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2007,10,2]]},"DOI":"10.1007\/s11590-006-0031-4","type":"journal-article","created":{"date-parts":[[2006,10,30]],"date-time":"2006-10-30T12:53:02Z","timestamp":1162212782000},"page":"355-366","source":"Crossref","is-referenced-by-count":176,"title":["TTT plots: a perl program to create time-to-target plots"],"prefix":"10.1007","volume":"1","author":[{"given":"Renata M.","family":"Aiex","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Celso C.","family":"Ribeiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,31]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0167-8191(03)00014-0","volume":"29","author":"R.M. Aiex","year":"2003","unstructured":"Aiex R.M., Binato S., Resende M.G.C. (2003) Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput. 29, 393\u2013430","journal-title":"Parallel Comput."},{"key":"31_CR2","first-page":"224","volume":"17","author":"R.M. Aiex","year":"2005","unstructured":"Aiex R.M., Pardalos P.M., Resende M.G.C., Toraldo G. (2005) GRASP with path relinking for three-index assignment. INFORMS J. Comput. 17, 224\u2013247","journal-title":"Comput."},{"key":"31_CR3","first-page":"301","volume-title":"Metaheuristics: Progress as Real Problem Solvers","author":"R.M. Aiex","year":"2005","unstructured":"Aiex R.M., Resende M.G.C. (2005) Parallel strategies for GRASP with path-relinking. In: Ibaraki T., Nonobe K., Yagiura M. (eds) Metaheuristics: Progress as Real Problem Solvers. Springer, Berlin Heidelberg New York, pp. 301\u2013331"},{"key":"31_CR4","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. (2002) Probability distribution of solution time in GRASP: an experimental investigation. J. Heuristics 8, 343\u2013373","journal-title":"J. Heuristics"},{"key":"31_CR5","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. (1992) Parallel biased search for combinatorial optimization: genetic algorithms and TABU. Microprocess. Microsyst. 16, 351\u2013367","journal-title":"Microprocess. Microsyst."},{"key":"31_CR6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/net.20070","volume":"46","author":"L.S. Buriol","year":"2005","unstructured":"Buriol L.S., Resende M.G.C., Ribeiro C.C., Thorup M. (2005) A hybrid genetic algorithm for the weight setting problem in OSPF\/IS-IS routing. Networks 46, 36\u201356","journal-title":"Networks"},{"key":"31_CR7","volume-title":"Graphical Methods for Data Analysis","author":"J.M. Chambers","year":"1983","unstructured":"Chambers J.M., Cleveland W.S., Kleiner B., Tukey P.A. (1983) Graphical Methods for Data Analysis. Chapman Hall, London"},{"key":"31_CR8","unstructured":"Chiarandini, M., St\u00fctzle, T.: Experimental evaluation of course timetabeling algorithms. Technical Report AIDA-02-05, Fachgebiet Intellektik, Fachbereich Informatik Technische Universit\u00e4t Darmstadt (2002)"},{"key":"31_CR9","first-page":"172","volume-title":"ICAISC 2004. Lecture Notes in Artificial Intelligence, vol. 3070","author":"I. Czarnowski","year":"2004","unstructured":"Czarnowski I., J\u0229drzejowicz P. (2004) Probability distribution of solution time in ANN training using population learning algorithm. In: Rutkowski L., et\u00a0al. (eds) ICAISC 2004. Lecture Notes in Artificial Intelligence, vol. 3070. Springer, Berlin Heidelberg New York, pp. 172\u2013177"},{"key":"31_CR10","first-page":"558","volume-title":"WEA 2005. Lecture Notes in Computer Science, vol. 3503","author":"M.R.Q. Andrade de","year":"2005","unstructured":"de Andrade M.R.Q., de Andrade P.M.F., Martins S.L., Plastino A. (2005) GRASP with path-relinking for the maximum diversity problem. In: Nikoletseas S.E. (eds) WEA 2005. Lecture Notes in Computer Science, vol. 3503. Springer, Berlin Heidelberg New York, pp. 558\u2013569"},{"key":"31_CR11","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) Slow annealing versus multiple fast annealing runs: an empirical investigation. Parallel Comput. 16, 269\u2013272","journal-title":"Parallel Comput."},{"key":"31_CR12","first-page":"605","volume-title":"Metaheuristics: Theory 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. (1996) A probabilistic analysis of local search. In: Osman I.H., Kelly J.P. (eds) Metaheuristics: Theory Applications. Kluwer, Dordrecht, pp. 605\u2013618"},{"key":"31_CR13","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. (1994) A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878","journal-title":"Oper. Res."},{"key":"31_CR14","first-page":"4","volume-title":"WEA 2005 Lecture Notes in Computer Science, vol 3503","author":"E.R. Fernandes","year":"2005","unstructured":"Fernandes E.R., Ribeiro C.C. (2005) Using an adaptive memory strategy to improve a multistart heuristic for sequencing by hybridization. In: Nikoletseas S.E. (ed) WEA 2005. Lecture Notes in Computer Science, vol. 3503. Springer, Berlin Heidelberg New York, pp. 4\u201315"},{"key":"31_CR15","first-page":"367","volume-title":"WEA 2005. Lecture Notes in Computer Science, vol. 3503","author":"P. Festa","year":"2005","unstructured":"Festa P., Pardalos P.M., Pitsoulis L.S., Resende M.G.C. (2005) GRASP with path-relinking for the weighted maximum satisfiability problem. In: Nikoletseas S.E. (ed) WEA 2005. Lecture Notes in Computer Science, vol. 3503. Springer, Berlin Heidelberg New York, pp. 367\u2013379"},{"key":"31_CR16","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1080\/1055678021000090033","volume":"7","author":"P. Festa","year":"2002","unstructured":"Festa P., Pardalos P.M., Resende M.G.C., Ribeiro C.C. (2002) Randomized heuristics for the MAX-CUT problem. Optim. Methods Softw. 7, 1033\u20131058","journal-title":"Optim. Methods Softw."},{"key":"31_CR17","first-page":"348","volume-title":"CP 2003. Lecture Notes in Computer Science, vol. 2833","author":"I.P. Gent","year":"2003","unstructured":"Gent I.P., Hoos H.H., Rowley A.G.D., Smyth K. (2003) Using stochastic local search to solve quantified Boolean formulae. In: Rossi F. (ed) CP 2003. Lecture Notes in Computer Science, vol. 2833. Springer, Berlin Heidelberg New York, pp. 348\u2013362"},{"key":"31_CR18","unstructured":"Hoos, 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":"31_CR19","unstructured":"Hoos, H.H.: On the run-time behaviour of stochastic local search algorithms for SAT. In: Proceedings of AAAI-99, pp. 661\u2013666. MIT Press, Cambridge (1999)"},{"key":"31_CR20","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th conference on artificial intelligence (AAAI 2000), pp. 22\u201329, Austin. MIT Press, Cambridge (2000)"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Evaluation 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":"31_CR22","first-page":"470","volume-title":"CP\u201998. Lecture Notes in Computer Science, vol. 1520","author":"H.H. Hoos","year":"1998","unstructured":"Hoos H.H., St\u00fctzle T. (1998) Some surprising regularities in the behaviour of stochastic local search. In: Maher M., Puget J.-F. (eds) CP\u201998. Lecture Notes in Computer Science, vol. 1520. Springer, Berlin Heidelberg New York, pp. 470"},{"key":"31_CR23","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. (1999) Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artif. Intell. 112, 213\u2013232","journal-title":"Artif. Intell."},{"key":"31_CR24","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1023\/A:1006350622830","volume":"24","author":"H.H. Hoos","year":"2000","unstructured":"Hoos H.H., St\u00fctzle T. (2000) Local search algorithms for SAT: an empirical evaluation. J. Autom. Reason. 24, 421\u2013481","journal-title":"J. Autom. Reason."},{"key":"31_CR25","unstructured":"Hutter, F.: Stochastic local search for solving the most probable explanation problem in Bayesian networks. Master\u2019s Thesis, Computer Science Department, Darmstadt University of Technology (2004)"},{"key":"31_CR26","first-page":"233","volume-title":"CP 2002. Lecture Notes in Computer Science, vol. 2470","author":"F. Hutter","year":"2002","unstructured":"Hutter F., Tompkins D.A.D., Hoos H.H. (2002) Scaling and probabilistic smoothing: Efficient local search for SAT. In: Van Hentenryck P. (ed) CP 2002. Lecture Notes in Computer Science, vol. 2470. Springer, Berlin Heidelberg New York, pp. 233\u2013248"},{"key":"31_CR27","unstructured":"Marinho, E.H.: Heur\u00edsticas busca tabu para o problema de programa\u00e7ao de tripula\u00e7 oes de \u00f4nibus urbanos (in Portuguese). Master\u2019s Thesis, Universidade Federal Fluminense (2005)"},{"key":"31_CR28","first-page":"205","volume-title":"AACC 2004. Lecture Notes in Computer Science, vol. 3285","author":"S.L. Martins","year":"2004","unstructured":"Martins S.L., Ribeiro C.C., Rosseti I. (2004) Applications and parallel implementations of metaheuristics in network design and routing. In: Manandhar S., et\u00a0al. (eds) AACC 2004. Lecture Notes in Computer Science, vol. 3285. Springer, Berlin Heidelberg New York, pp. 205\u2013213"},{"key":"31_CR29","first-page":"438","volume-title":"CP 2004. Lecture Notes in Computer Science, vol. 3258","author":"E. Nudelman","year":"2004","unstructured":"Nudelman E., Leyton-Brown K., Hoos H.H., Devkar A., Shoham Y. (2004) Understanding random SAT: beyond the clauses-to-variables ratio. In: Wallace M. (ed) CP 2004. Lecture Notes in Computer Science, vol. 3258. Springer, Berlin Heidelberg New York, pp. 438\u2013452"},{"key":"31_CR30","first-page":"356","volume-title":"Efficient and Experimental Algorithms \u2013 WEA2004. Lecture Notes in Computer Science, vol. 3059","author":"C.A.S. Oliveira","year":"2004","unstructured":"Oliveira C.A.S., Pardalos P.M., Resende M.G.C. (2004) GRASP with path-relinking for the quadratic assignment problem. In: R ibeiro C.C., Martins S.L. (eds) Efficient and Experimental Algorithms \u2013 WEA2004. Lecture Notes in Computer Science, vol. 3059. Springer, Berlin Heidelberg New York, pp. 356\u2013368"},{"key":"31_CR31","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. (1991) A comparison of two simulated annealing algorithms applied to the directed Steiner problem on networks. ORSA J. Comput. 3, 213\u2013225","journal-title":"ORSA J. Comput."},{"key":"31_CR32","first-page":"61","volume":"19","author":"M.G.C. Resende","year":"2003","unstructured":"Resende M.G.C., Gonzalez Velarde J.L. (2003) GRASP: Procedimientos de b\u00fasqueda miope aleatorizado y adaptativo. Intel. Artif. 19, 61\u201376","journal-title":"Intel. Artif."},{"key":"31_CR33","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1002\/net.10065","volume":"41","author":"M.G.C. Resende","year":"2003","unstructured":"Resende M.G.C., Ribeiro C.C. (2003) A GRASP with path-relinking for private virtual circuit routing. Networks 41, 104\u2013114","journal-title":"Networks"},{"key":"31_CR34","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M.G.C. Resende","year":"2003","unstructured":"Resende M.G.C., Ribeiro C.C. (2003) Greedy randomized adaptive search procedures. In: Glover F., Kochenberger G. (eds) Handbook of Metaheuristics. Kluwer, Dordrecht, pp. 219\u2013249"},{"key":"31_CR35","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1002\/0471739383.ch14","volume-title":"Parallel Metaheuristics: A New Class of Algorithms","author":"M.G.C. Resende","year":"2005","unstructured":"Resende M.G.C., Ribeiro C.C. (2005) Parallel greedy randomized adaptive search procedures. In: Alba E. (ed) Parallel Metaheuristics: A New Class of Algorithms. Wiley, New York, pp. 315\u2013346"},{"key":"31_CR36","unstructured":"Santos, H.G., Ochi, L.S., Souza M, J.F.: A tabu search heuristic with efficient diversification strategies for the class\/teacher timetabling problem. In: Burke, E.K., Trick, M. (eds.) Proceedings of the 5th international conference on the practice and theory of automated timetabling (PATAT \u201904), pp. 343\u2013358 (2004)"},{"key":"31_CR37","first-page":"468","volume-title":"Efficient and Experimental Algorithms \u2013 WEA2004. Lecture Notes in Computer Science, vol. 3059","author":"H.G. Santos","year":"2004","unstructured":"Santos H.G., Ochi L.S., Souza M.J.F. (2004) An efficient tabu search heuristic for the school timetabling problem. In: Ribeiro C.C., Martins S.L. (eds) Efficient and Experimental Algorithms \u2013 WEA2004. Lecture Notes in Computer Science, vol. 3059. Springer, Berlin Heidelberg New York, pp. 468\u2013481"},{"key":"31_CR38","unstructured":"Selman, B., Kautz H.A., Cohen B. (1994) Noise strategies for improving local search. In: Proceedings of the AAAI-94, pp. 337\u2013343. MIT Press, Cambridge"},{"key":"31_CR39","first-page":"40","volume-title":"ANTS 2002. Lecture Notes in Computer Science, vol. 2463","author":"A. Shmygelska","year":"2002","unstructured":"Shmygelska A., Aguirre-Hern\u00e1ndez R., Hoos H.H. (2002) An ant colony optimization algorithm for the 2D HP protein folding problem. In: Dorigo M., et\u00a0al. (eds) ANTS 2002. Lecture Notes in Computer Science, vol. 2463. Springer, Berlin Heidelberg New York, pp. 40\u201352"},{"key":"31_CR40","first-page":"400","volume-title":"AI 2003. Lecture Notes in Artificial Intelligence, vol. 2671","author":"A. Shmygelska","year":"2003","unstructured":"Shmygelska A., Hoos H.H. (2003) An improved ant colony optimisation algorithm for the 2D HP protein folding problem. In: Xiang Y., Chaib-draa B. (eds) AI 2003. Lecture Notes in Artificial Intelligence, vol. 2671. Springer, Berlin Heidelberg New York, pp. 400\u2013417"},{"key":"31_CR41","first-page":"498","volume-title":"Efficient and Experimental Algorithms \u2013 WEA2004. Lecture Notes in Computer Science, vol. 3059","author":"G.C. Silva","year":"2004","unstructured":"Silva G.C., Ochi L.S., Martins S.L. (2004) Experimental comparison of greedy randomized adaptive search procedures for the maximum diversity problem. In: Ribeiro C.C., Martins S.L. (eds) Efficient and Experimental Algorithms \u2013 WEA2004. Lecture Notes in Computer Science, vol. 3059. Springer, Berlin Heidelberg New York, pp. 498\u2013512"},{"key":"31_CR42","unstructured":"St\u00fctzle, T., Hoos, H.H.: Analyzing the run-time behaviour of iterated local search for the TSP. Technical Report IRIDIA\/2000-01, IRIDIA, Universit\u00e9 Libre de Bruxelles (2000)"},{"key":"31_CR43","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. (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput. 17, 443\u2013455","journal-title":"Parallel Comput."},{"key":"31_CR44","first-page":"145","volume-title":"AI 2003. Lecture Notes in Artificial Intelligence, vol. 2671","author":"D.A.D. Tompkins","year":"2003","unstructured":"Tompkins D.A.D., Hoos H.H. (2003) Scaling and probabilistic smoothing: dynamic local search for unweighted MAX-SAT. In: Xiang Y., Chaib-draa B. (eds) AI 2003. Lecture Notes in Artificial Intelligence, vol. 2671. Springer, Berlin Heidelberg New York, pp. 145\u2013159"},{"key":"31_CR45","first-page":"418","volume-title":"AI 2003. Lecture Notes in Artificial Intelligence, vol. 2671","author":"D.C. Tulpan","year":"2003","unstructured":"Tulpan D.C., Hoos H.H. (2003) Hybrid randomised neighbourhoods improve stochastic local search for DNA code design. In: Xiang Y., Chaib-draa B. (eds) AI 2003. Lecture Notes in Artificial Intelligence, vol. 2671. Springer, Berlin Heidelberg New York, pp. 418\u2013433"},{"key":"31_CR46","first-page":"229","volume-title":"DNA8. Lecture Notes in Computer Science, vol. 2568","author":"D.C. Tulpan","year":"2003","unstructured":"Tulpan D.C., Hoos H.H., Condon A.E. (2003) Stochastic local search algorithms for DNA word design. In: Hagiya M., Ohuchi A. (eds) DNA8. Lecture Notes in Computer Science, vol. 2568. Springer, Berlin Heidelberg New York, pp. 229\u2013241"},{"key":"31_CR47","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. (1995) Parallel local search. J. Heuristics 1, 43\u201366","journal-title":"J. Heuristics"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0031-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-006-0031-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-006-0031-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:01Z","timestamp":1559574901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-006-0031-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,31]]},"references-count":47,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,10,2]]}},"alternative-id":["31"],"URL":"https:\/\/doi.org\/10.1007\/s11590-006-0031-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,31]]}}}