文献类型：会议论文

英文题名：A ripple-spreading algorithm to calculate the k best solutions to the project time management problem

作者：Hu, Xiao-Bing[1,3]; Wang, Ming[1]; Sun, Qiong[2]; Leeson, Mark S.[3]; Di Paolo, Ezequiel[4]

第一作者：Hu, Xiao-Bing

机构：[1] State Key Laboratory of Earth Surface Processes and Resource Ecology, Beijing Normal University, Beijing, China; [2] Tourism Institute, Beijing Union University, Beijing, China; [3] School of Engineering, University of Warwick, Coventry, United Kingdom; [4] Ikerbasque - University of the Basque Country, San-Sebastián, Spain

第一机构：State Key Laboratory of Earth Surface Processes and Resource Ecology, Beijing Normal University, Beijing, China

会议论文集：Proceedings of the 2013 IEEE Symposium on Computational Intelligence in Scheduling, CISched 2013 - 2013 IEEE Symposium Series on Computational Intelligence, SSCI 2013

会议日期：April 16, 2013 - April 19, 2013

会议地点：Singapore, Singapore

语种：英文

外文关键词：Benchmarking - Multiobjective optimization - Optimization - Pareto principle - Scheduling

摘要：As a benchmark multi-objective optimization problem, the project management problem (PMP) usually needs to consider at least three conflicting objectives: cost, time and quality. Most existing methods can only provide an approximation of the true Pareto front to the PMP. We have recently reported an approach which can theoretically guarantee to find the complete Pareto front for discrete multi-objective problems like the PMP, while the practicability relies on the availability of effective algorithms which are capable of finding the k best solutions to each of the single-objective problems. This paper particularly focuses on how to calculate the k best solutions to the project time management problem (PTMP). To this end, a ripple-spreading algorithm is proposed, which by mimicking the natural ripple spreading phenomenon, can identify the k best ways to manage a project, so that the total project time is the shortest. The effectiveness of the proposed method is demonstrated in a comparative experiment. ? 2013 IEEE.