Extending time‐to‐target plots to multiple instances

DOI10.1111/itor.12507zbMath1407.90278OpenAlexW2789977313MaRDI QIDQ4624885

Alberto Reyes, Celso Carneiro Ribeiro

Publication date: 20 February 2019

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12507

zbMATH Keywords

runtime distributionmultiple time-to-target plotrandomized metaheuristicstime-to-target plot

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (7)

Solution approaches for the vehicle routing problem with occasional drivers and time windows ⋮ A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands ⋮ Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping ⋮ A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem ⋮ Multi‐mode resource‐constrained project scheduling using modified variable neighborhood search heuristic ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ An extended goal programming model for the multiobjective integrated lot-sizing and cutting stock problem

Uses Software

• PERL
• TTTPLOTS
• Tttplots-compare

Cites Work

• Restart strategies for GRASP with path-relinking heuristics
• 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
• GRASP with path-relinking for the generalized quadratic assignment problem
• Routing and wavelength assignment by partition colouring
• On the complexity of the maximum satisfiability problem for Horn formulas
• The quadratic assignment problem. Theory and algorithms
• Probability distribution of solution time in GRASP: an experimental investigation
• Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
• \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
• TTT plots: a perl program to create time-to-target plots
• Optimization by GRASP
• GRASP with path relinking for the weighted MAXSAT problem
• P-Complete Approximation Problems
• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• The 2-path network problem
• A GRASP with path-relinking for private virtual circuit routing
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending time‐to‐target plots to multiple instances