An optimization algorithm based on multi-objective resource-constrained project scheduling model

Abstract

The invention provides an optimization algorithm based on multi-objective resource-constrained project scheduling model. The scheduling model requires scheduling the start time of each activity to achieve the optimal goal under the condition of satisfying the relevant constraints. Based on the RCPSP model, the invention introduces the optimal resource balance as the objective, and expands the model to a multi-objective model. The solution of RCPSP is mainly based on the heuristic algorithm. When the task list is used to encode chromosomes in the heuristic algorithm, the task list initialized randomly may not satisfy the constraint relation between the top and bottom. The invention provides an individual generation mode based on control relation, which presents a new crossover operator andmutation operator based on the NSGA-II algorithm. The invention can greatly reduce the time complexity of the algorithm, realize the balanced allocation of resources, improve the production efficiencyand save the production cost while ensuring the solution precision of the algorithm, thereby improving the economic benefit of the resource scheduling production process.

Description

technical field [0001] The invention relates to the technical field of optimal scheduling, in particular to a multi-objective resource constrained project scheduling model (RCPSP) and a scheduling optimization algorithm. Background technique [0002] Resource Constrained Project Scheduling Optimization Problem (RCPSP) is to achieve the goal of project optimization by scheduling the start time of each activity and rationally allocating resource usage under the condition of satisfying the resource constraints of related activities and the constraint relationship between activities. kind of problem. Since the 1970s, this type of model has received continuous attention from many researchers. RCPSP has been proven to be NP-hard, i.e. it is difficult to find a general algorithm for all instances. [0003] In recent decades, with the development of computer technology, the algorithm for solving the RCPSP problem can basically be divided into two stages. In the last century, peop...

AI Technical Summary

Problems solved by technology

[0004] At the same time, when solving the RCPSP model, the exact algorithm is not suitable for solving large-scale optimization problems due to the excessive time overhead, and when using the task list to encode in the heuristic algorithm, it is necessary to avoid the generated task list not satisfying the activity interval. Sequential constraints

[0005] In addition, in the classic RCPSP model, the minimum construction period is generally used as the optimization goal. However, for practical application problems, there are often multiple optimization objectives, and only considering the minimum construction period cannot meet the actual application requirements.

In different backgrounds, some scholars have proposed multiple optimization objectives such as robustness objectives, resource balance optimization, and minimum cost, but most of the research focuses on a single objective, and there are not many research results that combine several objectives. See

Images