\texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms

DOI10.1007/s11590-014-0760-8zbMath1322.68259OpenAlexW1996201120MaRDI QIDQ2018872

Celso Carneiro Ribeiro, Isabel Rosseti

Publication date: 25 March 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-014-0760-8

zbMATH Keywords

metaheuristicsGRASPrandomized algorithmsstochastic local searchalgorithm performanceruntime distributionscomparison of two algorithmstttplots

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Randomized algorithms (68W20) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks, A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem, Extending time‐to‐target plots to multiple instances, On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics, Tttplots-compare, Solving the traveling delivery person problem with limited computational time

Uses Software

• PERL
• TTTPLOTS

Cites Work

• Unnamed Item
• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
• A hybrid data mining GRASP with path-relinking
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
• Routing and wavelength assignment by partition colouring
• Probability distribution of solution time in GRASP: an experimental investigation
• TTT plots: a perl program to create time-to-target plots
• GRASP with path relinking heuristics for the antibandwidth problem
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set