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 条
  • [1] A Look-Ahead Based Meta-heuristics for Optimizing Continuous Optimization Problems
    Nordli, Thomas
    Bouhmala, Noureddine
    OPTIMIZATION, LEARNING ALGORITHMS AND APPLICATIONS, OL2A 2021, 2021, 1488 : 48 - 55
  • [2] Meta-heuristics for manufacturing scheduling and logistics problems
    Liao, Ching-Jong
    Gen, Mitsuo
    Tiwari, Manoj Kumar
    Chang, Pei-Chann
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2013, 141 (01) : 1 - 3
  • [3] Improved Optimization Model for Finance-Based Scheduling
    Shiha, Ahmed
    Hosny, Ossama
    COMPUTING IN CIVIL ENGINEERING 2019: DATA, SENSING, AND ANALYTICS, 2019, : 438 - 444
  • [4] Network migration optimization using meta-heuristics
    Tuerk, Stefan
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2014, 68 (07) : 584 - 586
  • [5] Solving Traffic Signal Scheduling Problems in Heterogeneous Traffic Network by Using Meta-Heuristics
    Gao, Kaizhou
    Zhang, Yicheng
    Su, Rong
    Yang, Fajun
    Suganthan, Ponnuthurai Nagaratnam
    Zhou, MengChu
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (09) : 3272 - 3282
  • [6] Review on ensemble meta-heuristics and reinforcement learning for manufacturing scheduling problems
    Fu, Yaping
    Wang, Yifeng
    Gao, Kaizhou
    Huang, Min
    COMPUTERS & ELECTRICAL ENGINEERING, 2024, 120
  • [7] Optimization of PEMFC Model Parameters Using Meta-Heuristics
    Mahdinia, Saeideh
    Rezaie, Mehrdad
    Elveny, Marischa
    Ghadimi, Noradin
    Razmjooy, Navid
    SUSTAINABILITY, 2021, 13 (22)
  • [8] Performance of Priority Rules for Finance-Based and Resource-Constrained Project Scheduling Heuristics
    Liu, Wanlin
    Zhang, Jingwen
    Qu, Chunli
    Zhang, Haotian
    JOURNAL OF CONSTRUCTION ENGINEERING AND MANAGEMENT, 2024, 150 (06)
  • [9] Solving optimization problems in the fifth generation of cellular networks by using meta-heuristics approaches
    Boughaci, Dalila
    LEARNING AND TECHNOLOGY CONFERENCE 2020; BEYOND 5G: PAVING THE WAY FOR 6G, 2021, 182 : 56 - 62
  • [10] Scheduling Multiobjective Dynamic Surgery Problems via Q-Learning-Based Meta-Heuristics
    Yu, Hui
    Gao, Kaizhou
    Wu, Naiqi
    Zhou, MengChu
    Suganthan, Ponnuthurai N.
    Wang, Shouguang
    IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS, 2024, 54 (06): : 3321 - 3333