首页> 外文期刊>Journal of financial management of property and construction >Finance-based scheduling using meta-heuristics: discrete versus continuous optimization problems
【24h】

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

机译:使用元启发式算法的基于财务的计划:离散与连续优化问题

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:目的-本文的目的是比较遗传算法(GA),模拟退火(SA)和改组蛙跳算法(SFLA)在解决基于财务的调度的离散和连续变量优化问题方面的性能。这涉及到最大程度地减少项目工期,并因此使建筑承包商的与时间有关的成本构成最小化,包括间接费用,财务成本和延误罚款。设计/方法/方法-已采用GA,SA和SFLA的元启发法,以最小化项目工期为目标,解决了基于非确定性多项式时间硬性(NP-hard)财务的调度问题。在元启发式算法的实现中,可以充分解决传统的在调度问题中生成不可行解决方案的问题。发现-根据30个活动的小型网络,解决方案的质量以及计算成本方面,SA的表现优于SFLA和GA,而基于大型活动的SA的总持续时间最少在延长处理时间后,将120和210活动的网络规模扩大。研究的局限性/意义-从研究者的角度来看,基于财务的调度是少数领域问题之一,可以将其表述为离散和连续变量优化问题,因此,研究人员可以将其用作测试床以提供更多见解在解决离散和连续变量优化问题中发挥了元启发式方法的新发展。实际意义-基于财务的调度离散变量优化问题与从业人员高度相关,因为它允许调度程序设计最小持续时间的财务可行的调度。项目工期的最小化是使建筑承包商与时间相关的成本成分(包括间接费用,财务成本和延迟罚款)最小化的重点。此外,为工程承包商完成权宜之计的时间管理是主要的时间管理方面,其目的是通过为已交付的工程权宜的交付给客户以开始收获预期收益来实现客户满意的目标。社会影响-计划快速完成项目是建筑承包商实现客户满意目标的主要时间管理方面。原创性/价值-SFLA代表了一种相对较新的元启发式方法,基于其在文献中的有限应用,事实证明是很有希望的。本文旨在实现SFLA,以解决基于财务的计划的离散变量优化问题,并通过将其结果与GA和SA的结果进行比较来评估其性能。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号