返回
Imperialist competitive algorithm for subcontractor selection in multiple project environments
DOI:10.1007/s00500-023-09180-y.png)
摘要
En 中文
The selection of subcontractors is a significant aspect of any project since it can have a meaningful impact on the success of the project. In other words, choosing the wrong subcontractor can lead to delays and cost overruns. Thus, selecting the best subcontractors is crucial for every general contractor. In this study, imperialist competitive algorithm (ICA) is presented to solve the subcontractor selection problem (SSP) in multiple project environments by minimizing the general contractor's cost as the objective subject to resource and precedence constraints under two different circumstances. In the first circumstance, the project deadline can be postponed by paying a penalty; while the deadline cannot be deferred in the second one. The random key (RK) and the subcontractor list representation schemes are employed as encoding procedures, and the serial schedule generation scheme (SSGS) is utilized as a decoding scheme. Comparing the results of applying the presented ICA in a case study with the results obtained using an exact method and genetic algorithm (GA) validates the effectiveness of the proposed algorithm to solve SSP in multiple project environments. The outcomes demonstrate that the proposed ICA is more efficient in cases where the project deadline is restricted.
Keyword:
Portfolio optimization
Subcontractor selection
Scheduling
Imperialist competitive algorithm
Multiple project environments
期刊
IF:
2.5
论文数:
1.0W
被引数:
2.1W
机构
引用论文
A randomized phase II trial of preoperative chemoradiotherapy with or without cetuximab in locally advanced adenocarcinoma of the rectum.一项随机II期临床试验,研究术前放化疗联合或不联合西妥昔单抗治疗局部晚期直肠腺癌。
Hybrid Optimization Method for Large-Scale Multimode Resource-Constrained Project Scheduling Problem

