TTT plots: a perl program to create time-to-target plots. 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

References in zbMATH (referenced in 24 articles )

Showing results 1 to 20 of 24.
Sorted by year (citations)

1 2 next

  1. Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, Salvador: Large-scale parallelism for constraint-based local search: the costas array case study (2015)
  2. Martínez-Gavara, Anna; Campos, Vicente; Gallego, Micael; Laguna, Manuel; Martí, Rafael: Tabu search and GRASP for the capacitated clustering problem (2015)
  3. Ribeiro, Celso C.; Rosseti, Isabel: tttplots-compare: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (2015)
  4. Silva, Ricardo M.A.; Resende, Mauricio G.C.; Pardalos, Panos M.: Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (2014)
  5. Arbelaez, Alejandro; Truchet, Charlotte; Codognet, Philippe: Using sequential runtime distributions for the parallel speedup prediction of SAT local search (2013)
  6. Duhamel, Christophe; Gouveia, Luís; Moura, Pedro; De Souza, Maurício: Models and heuristics for the $k$-degree constrained minimum spanning tree problem with node-degree costs (2012)
  7. Lamghari, Amina; Dimitrakopoulos, Roussos: A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty (2012)
  8. Martins, Alexandre X.; Duhamel, Christophe; Mahey, Philippe; Saldanha, Rodney R.; De Souza, Mauricio C.: Variable neighborhood descent with iterated local search for routing and wavelength assignment (2012)
  9. Pavone, Mario; Narzisi, Giuseppe; Nicosia, Giuseppe: Clonal selection: an immunological algorithm for global optimization over continuous spaces (2012)
  10. Ravetti, Martín Gómez; Riveros, Carlos; Mendes, Alexandre: Parallel hybrid heuristics for the permutation flow shop problem (2012)
  11. Resende, Mauricio G.C.; Toso, Rodrigo F.; Gonçalves, José Fernando: A biased random-key genetic algorithm for the Steiner triple covering problem (2012)
  12. Ribeiro, Celso C.; Rosseti, Isabel; Vallejos, Reinaldo: Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (2012)
  13. Stracquadanio, Giovanni; Pappalardo, Elisa; Pardalos, Panos M.: A mesh adaptive basin hopping method for the design of circular antenna arrays (2012)
  14. Wang, Yang; Lü, Zhipeng; Glover, Fred; Hao, Jin-Kao: Path relinking for unconstrained binary quadratic programming (2012)
  15. Aloise, Daniel; Ribeiro, Celso C.: Adaptive memory in multistart heuristics for multicommodity network design (2011)
  16. De Leone, Renato; Festa, Paola; Marchitto, Emilia: A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (2011)
  17. Duarte, Abraham; Laguna, Manuel; Martí, Rafael: Tabu search for the linear ordering problem with cumulative costs (2011)
  18. Mateus, Geraldo R.; Resende, Mauricio G.C.; Silva, Ricardo M.A.: GRASP with path-relinking for the generalized quadratic assignment problem (2011)
  19. Noronha, Thiago F.; Resende, Mauricio G.C.; Ribeiro, Celso C.: A biased random-key genetic algorithm for routing and wavelength assignment (2011)
  20. da Silva, Rodrigo Ferreira; Urrutia, Sebastián: A general VNS heuristic for the traveling salesman problem with time windows (2010)

1 2 next