Calculating Critical Path: Comparison of Heuristic Methods

被引：0

作者：

Goryachev, A. A. ^{[1
]}

Goryachev, A. V. ^{[1
]}

Monakhov, A. V. ^{[1
]}

Novakova, N. E. ^{[1
]}

机构：

[1] St Petersburg Elect Univ LETI, St Petersburg, Russia

来源：

PROCEEDINGS OF THE XIX IEEE INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND MEASUREMENTS (SCM 2016) | 2016年

关键词：

project network; Critical path method; Dijkstra's algorithm; ACO; SA; GA; project scheduling; earliest event time; latest event time and slack time;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Network analysis provides an effective practical system for planning and controlling large projects in construction and many other fields. The purpose of the Critical Path Method (CPM) is to identify critical activities on the critical path so that resources may be concentrated on these activities in order to reduce project length time. In this paper, original CPM is compared with the other methods: modified Dijkstra's algorithm, Ant Colony Optimization (ACO), Simulated Annealing (SA) algorithm, Genetic algorithm (GA).

引用

页码：10 / 13

页数：4

共 5 条

[1]

Ottimizzazione M. Dorigo, 1992, OPTIMIZATION LEARNIN

[2]

Russell S., 2009, ARTIF INTELL, P68

[3]

Weise T., 2009, Global optimization algorithms -Theory and applications, P820

[4] Cuckoo Search via Levey Flights [J].

Yang, Xin-She ;

Deb, Suash .

2009 WORLD CONGRESS ON NATURE & BIOLOGICALLY INSPIRED COMPUTING (NABIC 2009), 2009, :210-+

[5] A SIMPLIFIED METHOD OF EVALUATING PERT/CPM NETWORK PARAMETERS [J].

ZHU, ZW ;

HEADY, RB .

IEEE TRANSACTIONS ON ENGINEERING MANAGEMENT, 1994, 41 (04) :426-430

← 1 →