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 条
  • [31] Solution for textile nesting problems using adaptive meta-heuristics and grouping
    Takahara, S
    Kusumoto, Y
    Miyamoto, S
    SOFT COMPUTING, 2003, 7 (03) : 154 - 159
  • [32] Problem feature based meta-heuristics with Q-learning for solving urban traffic light scheduling problems
    Wang, Liang
    Gao, Kaizhou
    Lin, Zhongjie
    Huang, Wuze
    Suganthan, Ponnuthurai Nagaratnam
    APPLIED SOFT COMPUTING, 2023, 147
  • [33] A problem solving environment for combinatorial optimization based on parallel meta-heuristics
    Huang, Rong
    Tong, Shurong
    Sheng, Weihua
    Fan, Zhun
    2007 INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE IN ROBOTICS AND AUTOMATION, 2007, : 505 - +
  • [34] Challenges in real world sightseeing tour optimization using meta-heuristics
    Jean-Marc, G. (godart@mathro.fpms.ac.be), 2005, WSEAS (02):
  • [35] The effect of elite pool in hybrid population-based meta-heuristics for solving combinatorial optimization problems
    Jaradat, Ghaith
    Ayob, Masri
    Almarashdeh, Ibrahim
    APPLIED SOFT COMPUTING, 2016, 44 : 45 - 56
  • [36] Strategic Migration Optimization Of Urban Access Networks Using Meta-Heuristics
    Tuerk, Stefan
    Noack, Johannes
    Radeke, Rico
    Lehnert, Ralf
    2014 26TH INTERNATIONAL TELETRAFFIC CONGRESS (ITC), 2014,
  • [37] Optimization of logistic processes in supply-chains using meta-heuristics
    Silva, CA
    Runkler, TA
    Sousa, JM
    da Costa, JMS
    PROGRESS IN ARTIFICIAL INTELLIGENCE-B, 2003, 2902 : 9 - 23
  • [38] Problem Feature-Based Meta-Heuristics with Reinforcement Learning for Solving Urban Traffic Light Scheduling Problems
    Wang, Liang
    Gao, Kaizhou
    Lin, Zhongjie
    Huang, Wuze
    2022 IEEE 25TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), 2022, : 845 - 850
  • [39] User Fairness in Radio Stripes Networks using Meta-Heuristics Optimization
    Conceicao, Filipe
    Antunes, Carlos Henggeler
    Gomes, Marco
    Silva, Vitor
    Dinis, Rui
    2022 IEEE 95TH VEHICULAR TECHNOLOGY CONFERENCE (VTC2022-SPRING), 2022,
  • [40] Particle swarm based meta-heuristics for function optimization and engineering applications
    Pant, Millie
    Thangaraj, Radha
    Abraham, Ajith
    SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT APPLICATIONS, PROCEEDINGS, 2008, : 84 - +