Abstract: Because quality can be recovered by repair work during construction, which affects project makespan and costs, we construct a new bi-objective non-linear programming model based on the classic multi-mode resource constrained project scheduling problem to minimize total cost and makespan. Moreover, the binary non-independent normal distribution function is adopted to describe the activity quality, and the quality of hidden work is defined according to the different relationships among activity qualities, namely, the coordinative and precedence relationship. Furthermore, a shuffled frog-leaping algorithm based on non-dominated sorting genetic algorithm is developed to solve the discrete trade-off problem. The algorithm is designed on an adaptive serial schedule generation scheme and adjusted activity list, where the frog-leaping progress combines the crossover operator of a genetic algorithm and permutation-based local search. Finally, an example of a construction project for a framed railway overpass is provided to examine the algorithm performance with classic NSGA.

Key words: project scheduling, shuffled frog-leaping algorithm, hidden works, bi-objective programming

摘要： 当施工过程中质量不达标需要返修以改进项目质量,但相应地会影响项目工期和成本。本文基于经典多模式资源受限项目调度问题构建一种新的非线性规划模型,目标为项目成本最小和工期最短,其中项目成本考虑返修成本以提高项目质量。首先,使用二元非独立正态分布函数描述活动质量,根据活动间的串联或并联关系定义隐蔽工程质量为活动质量的函数。其次,本文提出一种基于NSGA的混合蛙跳算法,采用串行进度产生方案和调整的活动列表编码,其中蛙跳过程结合了遗传算法中的交叉操作和基于置换的局域搜索。最后,整个模型算法应用于框架铁路立交桥施工项目,验证本文算法性能在支配解数量和质量上都优于标准NSGA。

关键词: 项目调度, 混合蛙跳算法, 隐蔽工程, 双目标规划