一种用于求解项目时间管理问题的前k个最优解的新算法

A New Method to Calculate the k Best Solutions to the Project Time Management Problem

项目管理问题(Project Management Problcm,PMP)是一个多目标优化问题,它通常需要考虑三个相互冲突的优化目标:时间,质量和成本。大多数现存的方法只能为项目管理问题求解近似的Parcto前沿。理论上,如果能够针对每个单目标优化问题找出前k个单目标最优解,则基于所有单目标优化问题的前k个单目标最优解,就可以保证找到离散多目标优化问题(比如PMP)的完整Parcto前沿。因此,求解多目标优化问题的完整Parcto前沿的关键是要设计有效的方法以求解出每个单目标优化问题的前k个单目标最优解。本文针对如何计算项目时间管理问题(Project Time Management Problem,PTMP)的k个最优解,提出了一种涟漪扩散算法,该算法通过模仿自然涟漪扩散现象,从而确定管理项目的前k个最佳方案,使得项目总时间最短。对比实验证明了新方法的有效性。

Project Management Problem(PMP) is a multi-objective optimization Problem,which usually needs to consider three conflicting optimization objectives:time,quality and cost.Most of methods can only solve approximate Pareto frontiers for project management problems.Theoretically,if the first k single objective optimal solutions can be found for each single objective optimization problem,then the complete Pareto front of discrete multi-objective optimization problem(such as PMP) can be guaranteed based on the first k single objective optimal solutions of all single objective optimization problems.Therefore,the key to solving the complete Pareto front of multi-objective optimization problem is to design an effective method to solve the first k single objective optimal solutions of each single objective optimization problem.The main purpose of this paper is how to calculate k optimal solutions to Project Time Management Problem(PTMP),and proposes a ripple-spreading algorithm.By imitating the natural ripple spreading phenomenon,this algorithm determines the best scheme for the first k Management projects and makes the total Project Time shortest.The effectiveness of this method is verified by comparative experiments.