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 55 articles )

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

1 2 3 next

  1. Pinto, Bruno Q.; Ribeiro, Celso C.; Rosseti, Isabel; Noronha, Thiago F.: A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (2020)
  2. Rodrigues de Holanda Maia, Marcelo; Plastino, Alexandre; Penna, Puca Huachi Vaz: MineReduce: an approach based on data mining for problem size reduction (2020)
  3. Dos Reis, Daniel Morais; Goulart, Natã; Noronha, Thiago F.; De Souza, Sérgio Ricardo: On the problem of minimizing the cost with optical devices in wavelength division multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (2019)
  4. Napoletano, Antonio; Martínez-Gavara, Anna; Festa, Paola; Pastore, Tommaso; Martí, Rafael: Heuristics for the constrained incremental graph drawing problem (2019)
  5. Stefanello, Fernando; Aggarwal, Vaneet; Buriol, Luciana S.; Resende, Mauricio G. C.: Hybrid algorithms for placement of virtual machines across geo-separated data centers (2019)
  6. Zhou, Qing; Benlic, Una; Wu, Qinghua; Hao, Jin-Kao: Heuristic search to the capacitated clustering problem (2019)
  7. de Holanda Maia, Marcelo Rodrigues; Plastino, Alexandre; Penna, Puca Huachi Vaz: Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem (2018)
  8. Martins, Daniel; Vianna, Gabriel M.; Rosseti, Isabel; Martins, Simone L.; Plastino, Alexandre: Making a state-of-the-art heuristic faster with data mining (2018)
  9. Pinto, Bruno Q.; Ribeiro, Celso C.; Rosseti, Isabel; Plastino, Alexandre: A biased random-key genetic algorithm for the maximum quasi-clique problem (2018)
  10. Reyes, Alberto; Ribeiro, Celso C.: Extending time-to-target plots to multiple instances (2018)
  11. Levorato, Mario; Figueiredo, Rosa; Frota, Yuri; Drummond, Lúcia: Evaluating balancing on social networks through the efficient solution of correlation clustering problems (2017)
  12. 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)
  13. Wang, Yang; Wu, Qinghua; Glover, Fred: Effective metaheuristic algorithms for the minimum differential dispersion problem (2017)
  14. 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)
  15. 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)
  16. 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)
  17. De Santis, M.; Festa, P.; Liuzzi, G.; Lucidi, S.; Rinaldi, F.: A nonmonotone GRASP (2016)
  18. 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)
  19. Musmanno, Leonardo M.; Ribeiro, Celso C.: Heuristics for the generalized median graph problem (2016)
  20. Vilar Jacob, Vinícius; Arroyo, José Elias C.: ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total tardiness (2016)

1 2 3 next