期刊
SUSTAINABILITY
卷 10, 期 8, 页码 -出版社
MDPI
DOI: 10.3390/su10082802
关键词
bi-objective optimization; heuristics; discrete time/cost trade-off; project scheduling
资金
- Humanities and Social Sciences Foundation of the Ministry of Education of China [15YJCZH077]
- National Science Foundation of China [71602106, 71271019, 7161101015, 71702097]
- Fundamental Funds for Humanities and Social Sciences of Beijing Jiaotong University [2017jbwy004]
- College Young Teachers Training Program of Shanghai Municipal Education Commission [ZZSD16025]
In sustainable project management, time and cost are two critical factors affecting the success of a project. Time/cost trade-offs in projects accelerate the execution of some activities by increasing the amount of non-renewable resources committed to them and therefore shorten the project duration. The discrete time/cost trade-off problem (DTCTP) has been extensively studied during the past 20 years. However, due to its complexity, the DTCTP-especially the DTCTP curve problem (DTCTP-C)-has only been solved for relatively small instances. To the best of our knowledge, there is no computational performance analysis for solving the DTCTP-C on large project instances with up to 500 activities. This paper aims to fill this gap. We present two bi-objective heuristic algorithms for the DTCTP-C where both project duration and cost are minimized. The objective is to obtain a good appropriate efficient set for the large-scale instances. The first algorithm is based on the non-dominated sorting genetic algorithm II (NSGA-II) and uses a specially designed critical path-based crossover operator. The second algorithm is a steepest descent heuristic which generates efficient solutions by iteratively solving the DTCTP with different deadlines. Computational experiments are conducted to validate the proposed algorithms on a large set of randomly generated problem instances.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据