采用拓扑遍历方法优化船舶设计计划

Optimization on ship design planning by topological ergodicity

为有效解决资源约束下的船舶设计多项目调度问题,根据船舶设计任务调度的特点,综合考虑船舶设计过程中各种影响因素和约束条件,以拓扑遍历方法为基础,提出了一种多项目调度问题的拓扑遍历优化算法。该算法具有对含耦合关系的项目进行处理的特点,在确定调度计划的过程中,提出以当前任务对后续任务的影响程度,以及关键路径任务优先的优先原则,并结合工程实例,验证了该算法的可行性。

To solve resource-constrained multiproject scheduling problem in ship design, a topological ergodicity optimization algorithm was presented, whose objective function was minimal duration. The algorithm was designed based on the topological ergodieity in view of the schedule characteristics, the influence factors and constraints in the process of ship design. Projects with coupled relation could be processed by the algorithm, in which the priority rules of schedule plan were critical path and the influence degree of late tasks by current task. An engineering instance verified the feasibility of this algorithm.