Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Scheduling optimization method for multi-mode resource-constrained projects using two-stage genetic algorithm

A genetic algorithm and resource-constrained technology, applied in genetic rules, resources, computing, etc., can solve problems that cannot be applied to large-scale problems, and the calculation time of precise algorithms is long, so as to enhance the ability of neighborhood search and improve the search ability , the effect of improving the overall efficiency

Active Publication Date: 2022-07-15
ZHEJIANG UNIV OF TECH
View PDF6 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] In order to overcome the long calculation time of existing accurate algorithms, which cannot be applied to large-scale problems, the incompleteness of the search space of heuristic algorithms and semi-intelligent algorithms combined with heuristics and the efficiency of intelligent algorithms depend on the design of the algorithm itself and the type of problem, etc. Insufficient, the present invention provides a kind of multimodal resource-constrained project scheduling optimization method using two-stage genetic algorithm, which effectively reduces the solution time of the resource-constrained project scheduling problem 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
  • Scheduling optimization method for multi-mode resource-constrained projects using two-stage genetic algorithm
  • Scheduling optimization method for multi-mode resource-constrained projects using two-stage genetic algorithm
  • Scheduling optimization method for multi-mode resource-constrained projects using two-stage genetic algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0133] The present invention will be described in further detail below with reference to the accompanying drawings and embodiments, but the present invention is not limited to the following embodiments.

[0134] A project consists of 20 tasks numbered from 0 to 19. The task structure is the timing relationship 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 The executable mode of , as well as the time required for execution in this mode, the number of updatable resources occupied and the number of non-updatable resources are shown in Table 1. In this project, the usable amount of updateable resource 1 at any time is 12, the usable amount of updateable resource 2 at any time is 13, and the usable amount of non-updatable resource 1 in the entire project duration is 70, and the usable amount of non-updateable resource 1 is 70. Resource 2 has 85 available for the...

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 multi-mode resource-constrained project scheduling optimization method using a two-stage genetic algorithm, which comprises the following steps: obtaining information required for scheduling; judging whether there is a feasible solution; preprocessing; calculating task level values; Population; evolves in two stages: Stage 1 adopts hierarchical-based scheduling sequence crossover mutation operation and generates a list of individual execution modes based on the earliest completion time of the task and calculates its fitness value, so that the algorithm quickly converges to the vicinity of the optimal solution, stage 2 Adopt the execution mode and scheduling sequence list crossover mutation operation and use the FBI&D method to improve the population to calculate the fitness value, carry out the expansion search of the neighborhood to find the optimal solution; output the scheduling optimization result; compared with the single-stage search strategy, the present invention has higher efficiency Search efficiency and optimization capabilities.

Description

technical field [0001] The invention relates to the fields of computer technology, information technology and system engineering, in particular to a scheduling optimization method for a multi-mode resource-constrained project, more specifically, to a multi-mode resource-constrained project scheduling optimization using a two-stage genetic algorithm method. Background technique [0002] Resource-Constrained Project SchedulingProblem RCPSP (Resource-Constrained Project SchedulingProblem) refers to how to scientifically and reasonably allocate resources, arrange the execution sequence of tasks to determine their start and completion times under the constraints of the time-series relationship between resources and tasks, so as to achieve established goals such as : Optimization of construction period, cost, etc. With more and more modern enterprises adopting a project-oriented organizational structure and management model, RCPSP has a strong engineering background and is widely...

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 Patents(China)
IPC IPC(8): G06Q10/06G06N3/12
CPCG06Q10/06312G06N3/126Y04S10/50Y02E40/70
Inventor 单晓杭王嘉梁李研彪张利叶必卿谢毅
Owner ZHEJIANG UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products