Optimization Letters

, Volume 1, Issue 4, pp 355–366

TTT plots: a perl program to create time-to-target plots

  • Renata M. Aiex
  • Mauricio G. C. Resende
  • Celso C. Ribeiro
Original Paper

DOI: 10.1007/s11590-006-0031-4

Cite this article as:
Aiex, R.M., Resende, M.G.C. & Ribeiro, C.C. Optimization Letters (2007) 1: 355. doi:10.1007/s11590-006-0031-4


This paper describes a perl language program to create time-to-target solution value plots for measured CPU times that are assumed to fit a shifted exponential distribution. This is often the case in local search based heuristics for combinatorial optimization, such as simulated annealing, genetic algorithms, iterated local search, tabu search, WalkSAT, and GRASP. Such plots are very useful in the comparison of different algorithms or strategies for solving a given problem and have been widely used as a tool for algorithm design and comparison. We first discuss how TTT plots are generated. This is followed by a description of the perl program tttplots.pl.

Copyright information

© Springer-Verlag 2006

Authors and Affiliations

  • Renata M. Aiex
    • 1
  • Mauricio G. C. Resende
    • 2
  • Celso C. Ribeiro
    • 3
  1. 1.Department of Computer ScienceCatholic University of Rio de JaneiroRio de JaneiroBrazil
  2. 2.Algorithms and Optimization Research DepartmentAT&T Labs ResearchFlorham ParkUSA
  3. 3.Department of Computer ScienceUniversidade Federal FluminenseNiteróiBrazil

Personalised recommendations