Experimental evaluation of simulated annealing algorithms for the time-cost trade-off problem

被引：31

作者：

Anagnostopoulos, K. P. ^{[1
]}

Kotsikas, L. ^{[2
]}

机构：

[1] Democritus Univ Thrace, Dept Prod & Management Engn, Sch Engn, Kimmeria Xanthi 67100, Greece

[2] Municipal Siatista, Siatista 50300, Greece

来源：

APPLIED MATHEMATICS AND COMPUTATION | 2010年 / 217卷 / 01期

关键词：

Heuristic evaluation; Extreme values statistics; Simulated annealing; Statistical tests; Time-cost trade-off; LARGE COMBINATORIAL PROBLEMS; PROJECT NETWORKS; OPTIMIZATION; CURVES;

D O I：

10.1016/j.amc.2010.05.056

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper evaluates variants of a simulated annealing algorithm which solve the total cost minimization problem in activity networks in the case that discrete time-cost execution modes are allowed on the project activities. This problem is a special case of the well known discrete time-cost trade-off problem (DTCTP). Based on a sample of randomly generated activity networks, formal tests of statistical significance are utilized to test both the quality of solutions and the time efficiency of algorithms versus problem factors. A procedure issued from the extreme values statistics is also applied on problem instances in order to determine, on the one hand, the confidence interval estimate of the optimum solution for each algorithm and, on the other hand, when to stop the running of an algorithm. (C) 2010 Elsevier Inc. All rights reserved.

引用

页码：260 / 270

页数：11

共 34 条

[1]

Aarts E.H. L., 1997, Local Search in Combinatorial Optimization, P91

[2] Bi-objective resource-constrained project scheduling with robustness and makespan criteria [J].

Abbasi, Babak ;

Shadrokh, Shahram ;

Arkat, Jamal .

APPLIED MATHEMATICS AND COMPUTATION, 2006, 180 (01) :146-152

[3] Network decomposition-based benchmark results for the discrete time-cost tradeoff problem [J].

Akkan, C ;

Drexl, A ;

Kimms, A .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (02) :339-358

[4]

ANAGNOSTOPOULOS K, 2001, OPERATIONAL RES INT, V1, P315

[5] DECISION CPM - A METHOD FOR SIMULTANEOUS PLANNING SCHEDULING AND CONTROL OF PROJECTS [J].

CROWSTON, W ;

THOMPSON, GL .

OPERATIONS RESEARCH, 1967, 15 (03) :407-&

[6] PROCEDURES FOR ESTIMATING OPTIMAL SOLUTION VALUES FOR LARGE COMBINATORIAL PROBLEMS [J].

DANNENBRING, DG .

MANAGEMENT SCIENCE, 1977, 23 (12) :1273-1283

[7] THE DISCRETE TIME-COST TRADEOFF PROBLEM REVISITED [J].

DE, P ;

DUNNE, EJ ;

GHOSH, JB ;

WELLS, CE .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 81 (02) :225-238

[8] Hardness of approximation of the discrete time-cost tradeoff problem [J].

Deineko, VG ;

Woeginger, GJ .

OPERATIONS RESEARCH LETTERS, 2001, 29 (05) :207-210

[9] A RANDOM ACTIVITY NETWORK GENERATOR [J].

DEMEULEMEESTER, E ;

DODIN, B ;

HERROELEN, W .

OPERATIONS RESEARCH, 1993, 41 (05) :972-980

[10]

Demeulemeester E, 1998, J OPER RES SOC, V49, P1153, DOI 10.2307/3010096

← 1 2 3 4 →