首页> 中文期刊>管理工程学报 >自适应粒子群算法求解资源受限多项目调度问题

自适应粒子群算法求解资源受限多项目调度问题

     

摘要

With the continuons development of social economy,the scale of modem enterprises is expanding,and the scope of business is becoming more and more diversified,the traditional single project management mode has been not suitable for the development requirements of modern enterprises,so the need of multi-project management theory in the practice of multi project management become more and more urgent.Due to the need to deal with a number of constraints at the same time,the optimal allocation of project resources in a single project environment has been a NP-hard problem.In the multi-project environment,such problems are further complicated.In this paper,we study the problem of resource constrained project scheduling,extend the research object to multi-project environment,and construct multi-project schedule model aiming at the minimization of multi-project weighted duration on the base of multi-project priority evaluation.Under the condition of limited resources,we can provide the decision basis for the project manager to allocate resources rationally by making reasonable scheduling of the multiple parallel projects.In order to solve the problem of the standard particle swarm optimization algorithm is easy to premature which can affect the optimization results,this paper will adopt an adaptive particle swarm optimization algorithm with dynamic inertia weight.This algorithm will improve the seeking ability and effect of particle swarm optimization algorithm through the dynamic change of inertia weight to solve the resource constrained multi-project scheduling problem model more effectively.The test results of standard test functions show that the final fitness values obtained by the particle swarm optimization algorithm with adaptive variable weights strategy are the smallest,and the convergence speed has some advantages.To further verify the effectiveness of the DCWPSO algorithm used in this paper for solving the resource constrained multi-project scheduling problem,we can solve the same problem model by using the GA algorithm and basic PSO algorithm.Through the analysis of the calculated results and the computational performance,the results show that the DCWPSO algorithm has an advantage in solving the resource constrained multi-project scheduling problem model.Among them,in terms of the time spent on the algorithm,DCWPSO algorithm with variable inertia weight can search for the optimal scheduling scheme for the first time in a shorter time,so the seeking speed of DCWPSO algorithm is faster.In the algorithm iteration,the change of the objective function value is very large,and the slope of the curve shows that the convergence rate of the algorithm is higher.Thus,compared to the other two algorithms,the DCWPSO algorithm is more stable and effective in solving the resource constrained multi-project scheduling problem model,then it can guide the multi-project optimization scheduling effectively,so it provides a reference for the task scheduling and resource allocation of the project implementation process.%研究资源约束条件下的项目调度问题,并将研究对象扩展到多项目环境,在多项目优先级评价基础上以多项目加权工期最小化为目标,构建多项目进度计划模型.通过在资源限定条件下,对共享资源的多个并行项目进行合理调度安排,为项目管理者在资源限制条件下合理配置资源以满足各项目的工期要求并尽量缩短多项目加权总工期提供决策依据.针对标准粒子群容易早熟从而影响优化结果的问题,采用一种具有动态变惯性权重的自适应粒子群算法(DCWPSO)对模型进行求解.采用标准测试函数和具体算例进行检验,结果表明DCWPSO算法可以较好地解决RCMPSP问题.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号