Premium
Extending time‐to‐target plots to multiple instances
Author(s) -
Reyes Alberto,
Ribeiro Celso C.
Publication year - 2018
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12507
Subject(s) - heuristics , computer science , set (abstract data type) , extension (predicate logic) , plot (graphics) , combinatorial optimization , mathematical optimization , mathematics , algorithm , statistics , programming language
Time‐to‐target plots (ttt‐plots) are a useful tool to characterize, evaluate, and compare the behavior of randomized heuristics for a given problem instance of some combinatorial optimization problem. Multiple time‐to‐target plots (mttt‐plots) are their natural extension to sets of multiple instances. We show how to build an mttt‐plot from the individual ttt‐plots of each instance in the set and we illustrate several case studies to illustrate the applicability and usefulness of the new tool.