{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:07:43Z","timestamp":1753884463049},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,6,22]],"date-time":"2014-06-22T00:00:00Z","timestamp":1403395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,3]]},"DOI":"10.1007\/s11590-014-0760-8","type":"journal-article","created":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T07:26:01Z","timestamp":1403335561000},"page":"601-614","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["tttplots-compare: a perl program to compare time-to-target plots or general runtime distributions of randomized algorithms"],"prefix":"10.1007","volume":"9","author":[{"given":"Celso C.","family":"Ribeiro","sequence":"first","affiliation":[]},{"given":"Isabel","family":"Rosseti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,6,22]]},"reference":[{"key":"760_CR1","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA 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":"760_CR2","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":"760_CR3","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":"760_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM 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":"760_CR5","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"RM 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. Heurist. 8, 343\u2013373 (2002)","journal-title":"J. Heurist."},{"key":"760_CR6","doi-asserted-by":"crossref","unstructured":"Ribeiro, C.C., Rosseti, I., Vallejos, R.: On the use of run time distributions to evaluate and compare stochastic local search algorithms. In: Sttzle, T., Biratari, M., Hoos, H.H. (eds.) Engineering Stochastic Local Search Algorithms. Lecture Notes in Computer Science, vol. 5752, pp 16\u201330. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-03751-1_2"},{"key":"760_CR7","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10898-011-9769-z","volume":"54","author":"CC Ribeiro","year":"2012","unstructured":"Ribeiro, C.C., Rosseti, I., Vallejos, R.: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms. J. Global Optim. 54, 405\u2013429 (2012)","journal-title":"J. Global Optim."},{"key":"760_CR8","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1016\/j.ejor.2004.09.007","volume":"171","author":"TF 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":"760_CR9","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":"760_CR10","unstructured":"Hyyti, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Nordic Teletraffic Seminar 14, pp. 31\u201340 (1998)"},{"key":"760_CR11","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1007\/3-540-45706-2_131","volume":"2400","author":"CC Ribeiro","year":"2002","unstructured":"Ribeiro, C.C., Rosseti, I.: A parallel GRASP heuristic for the 2-path network design problem. Lect. Notes Comput. Sci. 2400, 922\u2013926 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"760_CR12","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.parco.2006.11.007","volume":"33","author":"CC 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":"760_CR13","doi-asserted-by":"crossref","unstructured":"Andrade, C.E., Miyazawa, F.K., Resende, M.G.C.: Evolutionary algorithm for the $$k$$ k -interconnected multi-depot multi-traveling salesmen problem. In: Proceedings of the Genetic and Evolutionary Computation Conference, Amsterdam, pp. 463\u2013470 (2013)","DOI":"10.1145\/2463372.2463434"},{"key":"760_CR14","unstructured":"Andrade, C.E., Miyazawa, F.K., Resende, M.G.C., Toso, R.F.: Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions (2013, submitted)"},{"key":"760_CR15","unstructured":"Resende, M.G.C., Gon\u00e7alves, J.F., Toso, R.F.: Biased and unbiased random-key genetic algorithms: an experimental analysis. In: Abstracts of the X Metaheuristics International Conference, Singapore (2013)"},{"key":"760_CR16","doi-asserted-by":"crossref","first-page":"3159","DOI":"10.1016\/j.cor.2012.02.022","volume":"40","author":"H Barbalho","year":"2013","unstructured":"Barbalho, H., Rosseti, I., Martins, S.L., Plastino, A.: A hybrid data mining GRASP with path-relinking. Comput. Oper. Res. 40, 3159\u20133173 (2013)","journal-title":"Comput. Oper. Res."},{"key":"760_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1002\/net.20418","volume":"58","author":"A Duarte","year":"2011","unstructured":"Duarte, A., Mart\u00ed, R., Resende, M.G.C., Silva, R.M.A.: GRASP with path relinking heuristics for the antibandwidth problem. Networks 58, 171\u2013189 (2011)","journal-title":"Networks"},{"key":"760_CR18","doi-asserted-by":"crossref","unstructured":"Brandao, J. S., Noronha, T. F., Ribeiro, C. C.: A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (2014, submitted)","DOI":"10.1007\/s10898-015-0389-x"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0760-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0760-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0760-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,11]],"date-time":"2019-08-11T16:11:35Z","timestamp":1565539895000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0760-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,22]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,3]]}},"alternative-id":["760"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0760-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,22]]}}}