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

DOI10.1007/S11590-014-0760-8MaRDI QIDQ2018872zbMATH OpenOpenAlexFDO

Authors Celso C. 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

metaheuristicsrandomized algorithmsstochastic local searchGRASPruntime distributionsalgorithm performancecomparison 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)

Recommendations

• TTT plots: a perl program to create time-to-target plots
• A simple expected running time analysis for randomized ``divide and conquer algorithms
• The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• scientific article; zbMATH DE number 5182609

Cites work

• scientific article; zbMATH DE number 2090689 (Why is no real title available?)
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• 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
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• GRASP with path relinking heuristics for the antibandwidth problem
• Probability distribution of solution time in GRASP: an experimental investigation
• Routing and wavelength assignment by partition colouring
• TTT plots: a perl program to create time-to-target plots

Cited in

(8)

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

Describes a project that uses

Uses Software

• PERL
• TTTPLOTS

This page was built for publication: \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018872)