Multimode resource limited project scheduling optimization method based on multi-decoding intelligent algorithm

A resource-constrained, intelligent algorithm technology, applied in the fields of computer technology, information technology and systems engineering, can solve the problems of low efficiency of single decoding intelligent algorithm, long calculation time of accurate algorithm, and inability to apply to large-scale problems.

Inactive Publication Date: 2020-04-24
ZHEJIANG GONGSHANG UNIVERSITY
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the problems that the existing accurate algorithm takes a long time to calculate, cannot be applied to large-scale problems, the incompleteness of the search space of the heuristic algorithm, the semi-heuristic and semi-intelligent algorithm, and the low efficiency of the single-decoding intelligent algorithm, the present invention provides a The multi-mode resource-constrained project scheduling optimization method based on the multi-decoding intelligent algorithm effectively reduces the solution time of resource-constrained project scheduling problems and improves the solution quality

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Multimode resource limited project scheduling optimization method based on multi-decoding intelligent algorithm
  • Multimode resource limited project scheduling optimization method based on multi-decoding intelligent algorithm
  • Multimode resource limited project scheduling optimization method based on multi-decoding intelligent algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0159] Combine below figure 1 , figure 2 The present invention will be further described in detail with reference to and examples, but the present invention is not limited to the following examples.

[0160] A project consists of 20 tasks numbered from 0 to 19, and its task structure and sequence relationship are as follows: figure 2 shown, where t 0 and t 19 It is an artificially added virtual task, that is, it does not occupy the project duration or resources, t 1 to t 18 Table 1 shows the executable mode of , the time required for execution in this mode, and the number of renewable resources and non-renewable resources occupied. In this project, the available amount of renewable resource 1 at any time is 13, the available amount of renewable resource 2 at any time is 10, the available amount of non-renewable resource 1 in the entire project duration is 75, and cannot be updated Resource 2 has an available quantity of 85 throughout the project duration.

[0161] ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a multimode resource limited project scheduling optimization method based on a multi-decoding intelligent algorithm. The multimode resource limited project scheduling optimization method comprises the following steps: acquiring information required by scheduling optimization; judging whether a feasible scheme exists or not; carrying out pretreatment; calculating a static sorting value rank of the task; initializing a contemporary population; carrying out individual updating by adopting heuristic decoding of dynamic key task priority scheduling; adopting an FBI & D method to improve the contemporary population; performing crossover mutation operation to form a new population; carrying out individual decoding and updating on the new population by adopting a multi-decoding strategy; adopting an FBI & D method to improve the new population; forming a new contemporary population by the contemporary population and the new population; and outputting a scheduling optimization result until an evolution termination condition is satisfied. According to the method, various decoding strategies are adopted, so that a better scheduling scheme can be found, and the method has higher search efficiency and optimization capability.

Description

technical field [0001] The present invention relates to the fields of computer technology, information technology and system engineering, in particular to a scheduling optimization method for multi-mode resource-constrained projects, and more specifically, to a multi-mode resource-constrained project scheduling optimization based on multi-decoding intelligent algorithms method. Background technique [0002] Resource-Constrained Project Scheduling Problem RCPSP (Resource-Constrained Project SchedulingProblem) refers to how to scientifically and rationally allocate resources, arrange task execution sequence and determine its start and completion time under the constraints of resource and task timing relationship, so as to achieve the established goals such as : Optimization of construction period, cost, etc. RCPSP involves many fields of industry and life, such as chemical industry, semiconductor production, logistics, steel manufacturing, engineering management, chip manufac...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
Patent Type & Authority Applications(China)
IPC IPC(8): G06Q10/04G06Q10/06G06N3/00G06N3/12
CPCG06N3/006G06N3/126G06Q10/04G06Q10/06312
Inventor 谢毅汪炜军孙鹤
Owner ZHEJIANG GONGSHANG UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products