TTT plots: a perl program to create time-to-target plots

被引：143

作者：

Aiex, Renata M. ^{[3
]}

Resende, Mauricio G. C. ^{[1
]}

Ribeiro, Celso C. ^{[2
]}

机构：

[1] AT&T Labs Res, Algorithms & Optimizat Res Dept, Florham Pk, NJ 07932 USA

[2] Univ Fed Fluminense, Dept Comp Sci, BR-24210240 Niteroi, RJ, Brazil

[3] Pontificia Univ Catolica Rio de Janeiro, Dept Comp Sci, BR-22451 Rio De Janeiro, Brazil

来源：

OPTIMIZATION LETTERS | 2007年 / 1卷 / 04期

关键词：

STOCHASTIC LOCAL SEARCH; PATH-RELINKING; PROBABILITY-DISTRIBUTION; GRASP; ALGORITHMS; OPTIMIZATION; BEHAVIOR; IMPROVE; SAT;

D O I：

10.1007/s11590-006-0031-4

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

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 tttplots.pl.

引用

页码：355 / 366

页数：12

共 47 条

[1]

Aiex R.M., 2005, METAHEURISTICS PROGR, P301

[2] Parallel GRASP with path-relinking for job shop scheduling [J].

Aiex, RM ;

Binato, S ;

Resende, MGC .

PARALLEL COMPUTING, 2003, 29 (04) :393-430

[3] GRASP with path relinking for three-index assignment [J].

Aiex, RM ;

Resende, MGC ;

Pardalos, PM ;

Toraldo, G .

INFORMS JOURNAL ON COMPUTING, 2005, 17 (02) :224-247

[4] Probability distribution of solution time in GRASP: An experimental investigation [J].

Aiex, RM ;

Resende, MGC ;

Ribeiro, CC .

JOURNAL OF HEURISTICS, 2002, 8 (03) :343-373

[5] PARALLEL BIASED SEARCH FOR COMBINATORIAL OPTIMIZATION - GENETIC ALGORITHMS AND TABU [J].

BATTITI, R ;

TECCHIOLLI, G .

MICROPROCESSORS AND MICROSYSTEMS, 1992, 16 (07) :351-367

[6] A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing [J].

Buriol, LS ;

Resende, MGC ;

Ribeiro, CC ;

Thorup, M .

NETWORKS, 2005, 46 (01) :36-56

[7]

Chambers JM, 1983, GRAPHICAL METHODS DA

[8]

CHIARANDINI M, 2002, AIDA0205 FACHB INF T

[9]

Czarnowski I, 2004, LECT NOTES ARTIF INT, V3070, P172

[10]

de Andrade MRQ, 2005, LECT NOTES COMPUT SC, V3503, P558

← 1 2 3 4 5 →