Author:
Elazouni Ashraf,Alghazi Anas,Selim Shokri Z.
Abstract
Purpose
– The purpose of this paper is to compare the performance of the genetic algorithm (GA), simulate annealing (SA) and shuffled frog-leaping algorithm (SFLA) in solving discrete versus continuous-variable optimization problems of the finance-based scheduling. This involves the minimization of the project duration and consequently the time-related cost components of construction contractors including overheads, finance costs and delay penalties.
Design/methodology/approach
– The meta-heuristics of the GA, SA and SFLA have been implemented to solve non-deterministic polynomial-time hard (NP-hard) finance-based scheduling problem employing the objective of minimizing the project duration. The traditional problem of generating unfeasible solutions in scheduling problems is adequately tackled in the implementations of the meta-heuristics in this paper.
Findings
– The obtained results indicated that the SA outperformed the SFLA and GA in terms of the quality of solutions as well as the computational cost based on the small-size networks of 30 activities, whereas it exhibited the least total duration based on the large-size networks of 120 and 210 activities after prolonged processing time.
Research limitations/implications
– From researchers’ perspective, finance-based scheduling is one of the few domain problems which can be formulated as discrete and continuous-variable optimization problems and, thus, can be used by researchers as a test bed to give more insight into the performance of new developments of meta-heuristics in solving discrete and continuous-variable optimization problems.
Practical implications
– Finance-based scheduling discrete-variable optimization problem is of high relevance to the practitioners, as it allows schedulers to devise finance-feasible schedules of minimum duration. The minimization of project duration is focal for the minimization of time-related cost components of construction contractors including overheads, finance costs and delay penalties. Moreover, planning for the expedient project completion is a major time-management aspect of construction contractors towards the achievement of the objective of client satisfaction through the expedient delivery of the completed project for clients to start reaping the anticipated benefits.
Social implications
– Planning for the expedient project completion is a major time-management aspect of construction contractors towards the achievement of the objective of client satisfaction.
Originality/value
– SFLA represents a relatively recent meta-heuristic that proved to be promising, based on its limited number of applications in the literature. This paper is to implement SFLA to solve the discrete-variable optimization problem of the finance-based scheduling and assess its performance by comparing its results against those of the GA and SA.
Subject
Economics and Econometrics,Finance,Accounting,Business and International Management
Reference22 articles.
1. Alghazi, A.
(2009), “Finance-based scheduling of activity networks”, Thesis submitted for the fulfillment of the M. Sc. degree, System Engineering Department, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia.
2. Alghazi, A.
,
Selim, S.
and
Elazouni, A.
(2012), “Performance of shuffled frog-leaping algorithm in finance-based scheduling”,
Journal of Computing in Civil Engineering
, Vol. 26, pp. 396-408.
3. Alghazi, A.
,
Selim, S.
and
Elazouni, A.
(2013), “Improved genetic algorithm for finance-based scheduling”,
Journal of Computing in Civil Engineering, ASCE
, Vol. 27 No. 4, pp. 379-394.
4. Bouffard, V.
and
Ferland, J.A.
(2007), “Improving simulated annealing with variable neighbourhood search to solve the resource-constrained scheduling problem”,
Journal of Scheduling
, Vol. 10, pp. 375-386.
5. Chen, P-H.
and
Shahandashti, S.
(2009), “Hybrid of genetic algorithm and simulated annealing for multiple project scheduling with multiple resource constraints”,
Automation in Construction
, Vol. 18 No. 4, pp. 434-443.
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献