TTTPLOTS

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 tttplots.pl.


References in zbMATH (referenced in 42 articles )

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

1 2 3 next

  1. Martins, Daniel; Vianna, Gabriel M.; Rosseti, Isabel; Martins, Simone L.; Plastino, Alexandre: Making a state-of-the-art heuristic faster with data mining (2018)
  2. Pinto, Bruno Q.; Ribeiro, Celso C.; Rosseti, Isabel; Plastino, Alexandre: A biased random-key genetic algorithm for the maximum quasi-clique problem (2018)
  3. Levorato, Mario; Figueiredo, Rosa; Frota, Yuri; Drummond, Lúcia: Evaluating balancing on social networks through the efficient solution of correlation clustering problems (2017)
  4. Máximo, Vinícius R.; Nascimento, Mariá C. V.; Carvalho, André C. P. L. F.: Intelligent-guided adaptive search for the maximum covering location problem (2017)
  5. Wang, Yang; Wu, Qinghua; Glover, Fred: Effective metaheuristic algorithms for the minimum differential dispersion problem (2017)
  6. Brandão, Julliany S.; Noronha, Thiago F.; Ribeiro, Celso C.: A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (2016)
  7. Chaves, A. A.; Lorena, L. A. N.; Senne, E. L. F.; Resende, M. G. C.: Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (2016)
  8. Coelho, V. N.; Grasas, A.; Ramalhinho, H.; Coelho, I. M.; Souza, M. J. F.; Cruz, R. C.: An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints (2016)
  9. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  10. González, Pedro Henrique; Simonetti, Luidi; Michelon, Philippe; Martinhon, Carlos; Santos, Edcarllos: A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (2016)
  11. Musmanno, Leonardo M.; Ribeiro, Celso C.: Heuristics for the generalized median graph problem (2016)
  12. Caniou, Yves; Codognet, Philippe; Richoux, Florian; Diaz, Daniel; Abreu, Salvador: Large-scale parallelism for constraint-based local search: the costas array case study (2015)
  13. Lopes, Ramon; Morais, Vinicius W. C.; Noronha, Thiago F.; Souza, Vitor A. A.: Heuristics and matheuristics for a real-life machine reassignment problem (2015)
  14. Martínez-Gavara, Anna; Campos, Vicente; Gallego, Micael; Laguna, Manuel; Martí, Rafael: Tabu search and GRASP for the capacitated clustering problem (2015)
  15. Öncan, Temel: MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem (2015)
  16. Ribeiro, Celso C.; Rosseti, Isabel: tttplots-compare: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (2015)
  17. Buer, Tobias; Kopfer, Herbert: A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (2014)
  18. Peiró, Juanjo; Corberán, Ángel; Martí, Rafael: GRASP for the uncapacitated $r$-allocation $p$-hub median problem (2014)
  19. 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)
  20. Arbelaez, Alejandro; Truchet, Charlotte; Codognet, Philippe: Using sequential runtime distributions for the parallel speedup prediction of SAT local search (2013)

1 2 3 next