We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Imperialist competitive algorithm for subcontractor selection in multiple project environments.
- Authors
Afshar, Mohammad Reza; Zavari, Masoud
- Abstract
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.
- Subjects
IMPERIALIST competitive algorithm; SUBCONTRACTORS; COST overruns; GENETIC algorithms
- Publication
Soft Computing - A Fusion of Foundations, Methodologies & Applications, 2024, Vol 28, Issue 3, p2107
- ISSN
1432-7643
- Publication type
Article
- DOI
10.1007/s00500-023-09180-y