Target assignment method, system, device and storage medium based on greedy-dynamic kernel
CN116796970BActive Publication Date: 2026-08-28NORTHWESTERN POLYTECHNICAL UNIV
View PDF 0 Cites 0 Cited by
Patent Information
- Application Number
- CN202310736344.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-06-20
- Publication Date
- 2026-08-28
- Estimated Expiration
- 2043-06-20
AI Technical Summary
Technical Problem
该方法在小规模和大规模实例中都能自适应生成较为满意的解，但该方法对于目标具体信息未知的情况适应性尚待探讨
Benefits of technology
[0021]本发明通过对已建立的多级目标分配模型的解空间特性进行分析，以选择本优化问题的基础算法；通过对一对一约束条件的分析，对基础算进行改进以适应本问题；通过对改进方法的局部最优性和完整性进行分析，以对改进的基础算法再完善。
✦ Generated by Eureka AI based on patent content.
Smart Images
Figure CN116796970B_ABST
Abstract
The application discloses a target allocation method, system and device based on a greedy-dynamic core and a storage medium, and comprises the following steps: constructing a multi-level target allocation model; and dividing the solution space of the multi-level target allocation model by using an integer programming algorithm based on the greedy-dynamic core. The application analyzes the solution space characteristics of the established multi-level target allocation model to select a basic algorithm of the optimization problem, improves the basic algorithm by analyzing one-to-one constraint conditions to adapt to the problem, and further improves the improved basic algorithm by analyzing the local optimality and integrity of the improved method.
Need to check novelty before this filing date? Find Prior Art