Finance-based scheduling using meta-heuristics: discrete versus continuous optimization problems

被引:15
|
作者
Elazouni, Ashraf [1 ]
Alghazi, Anas [2 ]
Selim, Shokri [2 ]
机构
[1] King Fahd Univ Petr & Minerals, Engn & Management Dept, Dhahran, Saudi Arabia
[2] King Fahd Univ Petr & Minerals, Syst Engn Dept, Dhahran, Saudi Arabia
关键词
Financial management; Project scheduling;
D O I
10.1108/JFMPC-07-2014-0013
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
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.
引用
收藏
页码:85 / +
页数:21
相关论文
共 50 条
  • [21] A review of task scheduling based on meta-heuristics approach in cloud computing
    Singh, Poonam
    Dutta, Maitreyee
    Aggarwal, Naveen
    KNOWLEDGE AND INFORMATION SYSTEMS, 2017, 52 (01) : 1 - 51
  • [22] Beamforming Optimization for Multiuser Wireless Systems using Meta-Heuristics
    Bento, Pedro
    Antunes, Carlos Henggeler
    Gomes, Marco
    Dinis, Rui
    Silva, Vitor
    2016 IEEE 84TH VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL), 2016,
  • [23] A review of task scheduling based on meta-heuristics approach in cloud computing
    Poonam Singh
    Maitreyee Dutta
    Naveen Aggarwal
    Knowledge and Information Systems, 2017, 52 : 1 - 51
  • [24] Optimization of the cellular manufacturing scheduling using the RC-filter and EGD hybrid Meta-heuristics Approach
    Mahmoud Alzidani
    Thien-My Dao
    International Journal on Interactive Design and Manufacturing (IJIDeM), 2019, 13 : 1549 - 1556
  • [25] Optimization of the cellular manufacturing scheduling using the RC-filter and EGD hybrid Meta-heuristics Approach
    Alzidani, Mahmoud
    Thien-My Dao
    INTERNATIONAL JOURNAL OF INTERACTIVE DESIGN AND MANUFACTURING - IJIDEM, 2019, 13 (04): : 1549 - 1556
  • [26] A survey on meta-heuristics for solving disassembly line balancing, planning and scheduling problems in remanufacturing
    Gao, K. Z.
    He, Z. M.
    Huang, Y.
    Duan, P. Y.
    Suganthan, P. N.
    SWARM AND EVOLUTIONARY COMPUTATION, 2020, 57
  • [27] ENHANCED META-HEURISTICS WITH VARIABLE NEIGHBORHOOD SEARCH STRATEGY FOR COMBINATORIAL OPTIMIZATION PROBLEMS
    Bouhmala, Noureddine
    ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2016, 17 (02): : 125 - 149
  • [28] Finance-based scheduling multi-objective optimization: Benchmarking of evolutionary algorithms
    El-Abbasy, Mohammed S.
    Elazouni, Ashraf
    Zayed, Tarek
    AUTOMATION IN CONSTRUCTION, 2020, 120
  • [29] A Greener Meta-Heuristics Scheduling Algorithm With Energized Optimization Dynamics by Deeper Intelligence Fusion
    Wang, Jinglian
    Gong, Bin
    Liu, Hong
    Li, Shaohui
    IEEE ACCESS, 2021, 9 : 18373 - 18382
  • [30] Solution for textile nesting problems using adaptive meta-heuristics and grouping
    S. Takahara
    Y. Kusumoto
    S. Miyamoto
    Soft Computing, 2003, 7 : 154 - 159