Supercharge Your Innovation With Domain-Expert AI Agents!

Permutation and combination code generation algorithm with constrained conditions and MATLAB implementation method

A technology of constraint conditions and permutations and combinations, which is applied in the field of code generation algorithms, can solve problems such as insufficient algorithm description, insufficient description, specificity, and insufficient simplicity of algorithm ideas.

Inactive Publication Date: 2017-12-29
NANYANG NORMAL UNIV
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Regarding the permutation and combination with constraints, there are some literatures, but there are deficiencies: 1. The algorithm idea is not simple enough, and it is relatively complicated
2. Algorithm description is not concise enough, it is not easy for readers to understand
3. In terms of program implementation, it is not specific enough and lacks clarity
4. The constraint conditions are simple, the number of digits is small, and it is not universal

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
  • Permutation and combination code generation algorithm with constrained conditions and MATLAB implementation method
  • Permutation and combination code generation algorithm with constrained conditions and MATLAB implementation method
  • Permutation and combination code generation algorithm with constrained conditions and MATLAB implementation method

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0042] 1. Algorithm and mathematical principle of code generation

[0043] Definition 1: Let a 1 a 2 …a m , b 1 b 2 …b m are 2 different numbers permutations, when a 1 a 2 …a r with b 1 b 2 …b r the same, while a r+1 >b r+1 , it is called a 1 a 2 …a m greater than b 1 b 2 …b m , a 1 a 2 …a m with b 1 b 2 …b mThere are only relative size order values, but no absolute size order values. For example, the arrangement of four numbers of 12156 and the arrangement of four numbers of 12139, each arrangement has no absolute size, but the arrangement of 12156 can be defined to be greater than 12139.

[0044] Definition 2: Let a 1 a 2 …a m is a combination selected from 1, 2, 3, ..., n, if a 1 ≤a 2 ≤…≤a m , then call a 1 a 2 …a m is an ascending combination.

[0045] Theorem 1: Let permutation a 1 a 2 …a m with b 1 b 2 …b m , all satisfying: 0≤a i ≤N i , 0≤b i ≤N i , a 1 +a 2 +…+a m =n,b 1 +b 2 +…+b m =n. if a t t , t=max{i︱a i i , i≠m...

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 permutation and combination code generation algorithm with constrained conditions and a MATLAB program implementation method. The permutation generation method with constraint conditions starts from a smallest full permutation satisfying the constraint conditions, and then generates a next full permutation according to a gradual increasing method; the method starts from a smallest ascending order combination which satisfies the constraint conditions, and generates a next ascending order combination according to the gradual increasing method; the method can effectively solve the practical problems relating to achieving coded computer programs with the requirements of constraint conditions, such as integer programming solution, information coding with constraint conditions, vehicle dispatching, sports events, and course arrangement, and the practical problems of production and scientific research are effectively, quickly, accurately and economically solved.

Description

technical field [0001] The invention belongs to the technical field of code generation algorithms in the fields of operations research, planning, information, computers, etc., and in particular relates to a permutation and combination code generation algorithm with constraints and a MATLAB implementation method. Background technique [0002] Regarding the full permutation and combination generation of 1, 2, ..., n, there are currently dozens of different solving algorithms. Typical sorting algorithms include direct selection sorting, bubble sorting, insertion sorting, merge sorting, quick sorting, etc.; and full permutation generation algorithms are typically lexicographical ordering, carry, transposition, and neighbor swapping. Some are recursive algorithms that are more difficult to understand. However, in practical applications, it is not entirely a full arrangement or combination of different elements, and sometimes it is an arrangement with special requirements, such a...

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
IPC IPC(8): G06F17/50
CPCG06F30/20G06F2111/04
Inventor 杜瑞卿杜彦辉顾妍张征田张新刚
Owner NANYANG NORMAL UNIV
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com