期刊文献+

融入逻辑关系的项目调度遗传算法 被引量:1

Genetic Algorithm for Project Scheduling with Logical Relation
下载PDF
导出
摘要 为解决复杂施工项目中存在的模型表述和计算问题,研究互斥、共存、依赖3种逻辑关系在调度计划表述模型中的应用,建立复杂施工调度问题的混合整数线性规划模型,并设计一种改进的遗传算法以快速求解模型。基于布尔变量划分的顺序编码方式,将染色体分为独立变量和半独立变量编码基因段,以最短工期的倒数为适应度函数进行最优解的启发式求解。在遗传操作后进行冲突检测,消除由种群初始化、交叉和变异操作生成的违反约束规则的个体,保证算法的有效性。工程案例计算结果表明,与传统精确式算法相比,该算法能有效缩短大型工程项目工期的求解时间。 In order to solve the problems of model expression and calculation in complex construction projects,this paper conducts a study on the application of three logical relations,including mutual exclusion,coexistence and dependence in the scheduling project expression model.On this basis,a mixed integer linear programming model for complex construction scheduling problem is proposed and an improved genetic algorithm is designed to quickly solve the model.Based on the sequential coding manner of Boolean variable division,the chromosome is divided into independent variable and semi-independent variable coding gene segments,and the reciprocal of the shortest duration is used as the fitness function to search the optimal solution in a heuristic approach.Then,the conflict detection is performed after genetic operations,so as to eliminate individuals who violate constraint rules generated by population initialization,crossover,and mutation operations,thus ensuring the effectiveness of the algorithm.The calculation results of project cases show that compared with the traditional precision algorithm,the proposed algorithm can effectively shorten the solution procedure of construction period in large construction projects.
作者 刘尧 宋元斌 李云祥 LIU Yao;SONG Yuanbin;LI Yunxiang(School of Naval Architecture,Ocean and Civil Engineering,Shanghai Jiao Tong University,Shanghai 200240,China)
出处 《计算机工程》 CAS CSCD 北大核心 2020年第1期279-285,共7页 Computer Engineering
基金 国家自然科学基金“施工计划中的复杂时间关系表述及施工顺序优化”(71271137) 上海市自然科学基金“大型复杂工程项目计划中的复杂时间关系表述及调度算法研究”(12ZR1415100)
关键词 项目调度 逻辑关系 顺序编码 遗传算法 混合整数线性规划 project scheduling logical relation sequential coding genetic algorithm mixed integer linear programming
  • 相关文献

参考文献5

二级参考文献53

  • 1LIUMin,ZHANGLong,WUCheng.Scheduling Algorithm for Complex Product Development[J].Chinese Journal of Electronics,2004,13(3):389-394. 被引量:2
  • 2杨胜文,史美林.一种支持QoS约束的Web服务发现模型[J].计算机学报,2005,28(4):589-594. 被引量:131
  • 3苗琦龙,栾新.基于遗传算法和BP网络的文字识别方法[J].计算机应用,2005,25(B12):330-332. 被引量:16
  • 4陆琼瑜,童学锋.BP算法改进的研究[J].计算机工程与设计,2007,28(3):648-650. 被引量:35
  • 5Yang B B,Geunes J,OBrien William J.Resource-constrainedproject scheduling:past work and new directions[R].Florida:University of Florida,2001.
  • 6Sonke Hartmann.Project scheduling under limited resources:models,methods,and applications[M].Berlin:Springer,1999.
  • 7Blazewica J,Lenstra J K,Rinnooy K.Scheduling subject to resource constraints[J].Discrete Applied Mathematics,1983,5:11-24.
  • 8Johnson T J R.An algorithm for the resource-constrainedproject scheduling problem[D].Boston,USA:Ph D Dissertation,MIT,1967.
  • 9Demeulemeester E,Herroelen W.A branch-and-bound procedure for the generalized resource-constrained project scheduling problem[J].Operations Research,1997,45:201-212.
  • 10Davis E W,Patterson J H.A comparison of heuristic and optimum solutions in resource-constrained project scheduling[J].Management Science,1975,21:944-955.

共引文献86

同被引文献7

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部