CN107832970A - Synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence - Google Patents
Synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence Download PDFInfo
- Publication number
- CN107832970A CN107832970A CN201711201028.1A CN201711201028A CN107832970A CN 107832970 A CN107832970 A CN 107832970A CN 201711201028 A CN201711201028 A CN 201711201028A CN 107832970 A CN107832970 A CN 107832970A
- Authority
- CN
- China
- Prior art keywords
- synthesis
- reaction
- chemical
- num
- chemical industry
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0637—Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
- G06Q10/06375—Prediction of business process outcome or impact based on a proposed change
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Educational Administration (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Game Theory and Decision Science (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Physical Or Chemical Processes And Apparatus (AREA)
- Organic Low-Molecular-Weight Compounds And Preparation Thereof (AREA)
Abstract
The present invention relates to decompose synthesis path automatic generating method in Chemical Manufacture problem based on recurrence.The present invention has solution property judgment means based on a kind of synthesis flow of recursive function design, judge under current raw material and the limitation that can be reacted, whether target product can be generated by a series of chemical industry synthesis flows, design a kind of synthesis flow decomposer, the synthesis flow of target product is decomposed, all possible synthesis path of generation of automation.The defects of being individually present instant invention overcomes existing logic centre method and information centre's method.The present invention is according to recursive traversal algorithm, consider the type and quantity limitation of raw material in practical condition, devise unified formalization representation method, can preferably it apply in the actual Chemical Manufacture of different condition, can be after judging to decompose, all decomposing schemes are obtained, preferably meet the selection work of subsequent path.
Description
Technical field
The present invention relates to computer software field, and in particular to is decomposed based on recurrence in Chemical Manufacture problem and synthesizes road
Footpath automatic generating method.
Background technology
Chemical process synthesis problem is an edge crossing subject, from the overall goals of procedures system, according to system
The particularity and its correlation of internal reform part, determine production process in planning, design, control and management etc.
Optimal policy.Main study subject is the chemical production system that product is changed into by raw material, mainly including chemical industry, refining
The process industrials such as oil, synthetic fibers, plastics, metallurgy, pharmacy, food.Since 20th century, process industrial has obtained great hair
Exhibition, but environmental pollution, process safety and sustainable method battle array problem are still urgently to be resolved hurrily.Select rational response path can be with
The discharge of pollutant in whole process is efficiently reduced, improves the security of Chemical Manufacture flow.Therefore, reaction path synthesis is
The core of process synthesis, it is also the focus of research all the time.
Before the present invention makes, existing reaction path synthesis method can be divided into logic centre method and information centre's method
Two major classes.But existing method is primarily present the problem of following：1. the not raw material types sum from practical condition
Amount limitation is set out, but chemical process has many limitations, it is therefore desirable to first judges it is in current raw material and production
Under process conditions, whether task can be completed.Put forward more than 2. for a certain concrete application, suitable for specific ring
Border, versatility are poor.3. generally concentrating on the selection in chemical reaction path, all possible decomposing scheme can not be drawn, still
In chemical process, very big economy, environmental benefit gap are there may be between different response paths, it is necessary to not
Same path is compared.
The content of the invention
The purpose of the present invention, which is that, overcomes drawbacks described above, develops and decomposes synthesis path in Chemical Manufacture problem based on recurrence
Automatic generating method.
The technical scheme is that：
Based on recurrence decompose Chemical Manufacture problem in synthesis path automatic generating method, its be mainly characterized by as
Lower step：
(1) it is directed in chemical industry synthesis problem, involved material carries out formalization representation；By in chemical industry synthesis problem, relate to
And to reactant and product be all referred to as material, and such material is denumerable；Define a two tuple r=<
rnam, rnum>, a kind of material context wherein in r expressions system, rnamUnique insert tracer material r species, rnumRepresent material r's
Quantity；
(2) in system all kinds material, be required for carrying out the expression of form in step (1)；R={ r1, r2...,
rN, wherein N represents that the material involved by the chemical industry synthesis problem always plants number；
(3) on the basis of step (2), formalization representation is carried out to the reaction that can be generated with a triple；Trans=
<Name, condition, input, output>；Wherein, name uniquely indicates the chemical reaction；Condition represents the chemistry
Required condition occurs for reaction；The reactant situation that this reaction needs of input expressions completion consume is one by r=<rnam,
rnum>The set of composition, output represent to complete this reaction can caused by product situation, and one by r=<rnam, rnum>
The set of composition；Under many circumstances, the product of different chemical reactions does not intersect, therefore is chemically reacted for any two is different
transiAnd transj,
(4) on the basis of step (2), step (3), there are solution property judgment means using a kind of synthesis flow, to judge
Under current raw material and the limitation that can be reacted, whether target product can be carried out by a series of chemical industry synthesis flows.
Advantages of the present invention and effect limit in the type and quantity of the raw material in practical condition is considered, and devise
Unified formalization representation method, can preferably it apply in the actual Chemical Manufacture of different condition.
Can the present invention can obtain all decomposing schemes, more preferably according to recursive traversal algorithm after judging decompose
Ground meets the selection work of subsequent path.
Brief description of the drawings
The flow chart for having solution property judgment means of Fig. 1 --- synthesis flow of the present invention.
Fig. 2 --- synthesis flow of the present invention has the flow chart of solution property judgment means flow chart Neutron module 1.
Fig. 3 --- synthesis flow of the present invention has the flow chart of solution property judgment means flow chart Neutron module 2.
Embodiment
The present invention technical thought be：
The formalization material and reaction equation method for expressing of a kind of chemical industry synthesis problem domain are designed, and is set based on recursive function
That has counted a kind of synthesis flow have solution property judgment means, can judge in current raw material and the limitation that can be reacted
Under, whether target product can be generated by a series of chemical industry synthesis flows；A kind of synthesis flow decomposer is devised again, it is right
The synthesis flow of target product is decomposed, all possible synthesis path of generation of automation.
The present invention is specifically described below.
The present invention is a kind of heterogeneous multi-robot system task analytic approach based on recursive algorithm, in order that the present invention
Purpose, technical scheme and advantage are clearer, and the present invention is done below in conjunction with accompanying drawing and is further described in detail：
Step (1) is directed in chemical industry synthesis problem, and involved material carries out formalization representation.It is anti-to complete a chemistry
Should be, it is necessary to which a certain amount of reactant, under certain conditions, can obtain a certain amount of product.We are by chemical industry synthesis problem
In, the reactant and product that are related to all are referred to as material, and such material is denumerable.Define a two tuple r
=<rnam, rnum>, a kind of material context wherein in r expressions system, rnamUnique insert tracer material r species, rnumRepresent material r
Quantity.
The material of all kinds in step (2) system, it is required for carrying out the expression of form in step (1).By all materials
Material represents that two tuples form a set, represents the material overall state of system under current state, formalization representation is R={ r1,
r2..., rN, wherein N represents that the material involved by the chemical industry synthesis problem always plants number.
Step (3) carries out formalization representation on the basis of step (2), with a triple to the reaction that can be generated：
Trans=<Name, condition, input, output>.Wherein, name uniquely indicates the chemical reaction；Condition tables
Show that required condition occurs for the chemical reaction；Input represents that completing this reaction needs the reactant situation that consumes, be one by
R=<rnam, rnum>The set of composition, output represent to complete this reaction can caused by product situation, and one by r=<
rnam, rnum>The set of composition.Also, under many circumstances, the product of different chemical reactions does not intersect.Therefore for any two
Individual different chemical reaction transiAnd transj,
Step (4) has solution property judgment means, stream on the basis of step (2) and step (3), using a kind of synthesis flow
For journey as shown in figure 1, to judge under current raw material and the limitation that can be reacted, whether target product can be by a series of
Chemical industry synthesis flow is carried out.A kind of synthesis flow has solution property judgment means, it is characterised in that following steps：
Step (4.1) is with the operation according to step (1), step (2) and step (3), raw material, target product in production environment
With the data structure of executable response：Res is an array, represents situation of raw materials in production environment；Prod is an array,
Represent the situation of target product in production environment；Trans represents the chemical reaction set that can be completed, and wherein trans [i] is represented
I-th of reaction that can be carried out, trans [i] .input represent the raw material set that the reaction needs, trans [i] .output
Represent the reactant set that the reaction can generate.Res.size, prod.size, trans.size represent raw material, target respectively
The quantity of product and executable response.
Step (4.2) designs a discriminant function judge () and judges that can the requirement in target product set be satisfied,
Its input parameter is target product set prod, and a numeric parameter num.
Step (4.3) is if num is equal to prod.size, then it represents that all material in target product set has all judged
Into function returns to true and exited；Otherwise step (4.4) is entered, this step can be represented with Fig. 2；
Step (4.4) finds prod n-th um product prod [num] in res set, and obtains it and can provide most
Big number, is designated as max_res.If max_res is not equal to 0, into step (4.5), otherwise into step (4.6).
The quantity for this kind of target product that step (4.5) record wishes to generate is max_prod, records the minimum value of the two
For max_amt；Into one with i：0~max_amt is that for of cyclic variable is circulated, in this circulation：N-th um target production
The quantity of thing subtracts i, if max_pro ＜=max_res and i==max_amt, into a), and if the condition is invalid,
Then enter b).Step (4.5) content such as Fig. 3 is represented.
A) enter recursive procedure, call judge (prod, num+1), if the function returns to false, passing after representing
Return condition to be unsatisfactory for, then reduce prod [num] quantity, be entered as max_prod again；If the function returns to true, when
Preceding judge functions directly return to true and exited.
B) enters recursive procedure, calls judge (prod, num), if the function returns to false, passing after representing
Return condition to be unsatisfactory for, reduction prod [num] quantity, copy as max_prod again；If the function returns to true, currently
Judge functions directly return to true and exited.
The quantity for this kind of target product that step (4.6) record wishes to generate is max_prod, defines a variable k, with
k：0~task.size is cyclic variable, into a for circulation c).
C) is in this circulation for circulation, if finding a chemical reaction, its product contains prod [num], then exited
This circulation, this reaction is task [k].Prod [num] quantity is directly entered as 0, a variable m is defined, is initialized as 0.
Into a while circulation d).
D) this loop termination condition of is to have accessed all input raw material of task [k] for circulation, in this circulation, definition
One variable count, is initialized as 1；One is entered back into n：0~sum is that for of cyclic variable is circulated e).
E) in this circulation, task [k] .input [m] represents m-th of input needed for k-th of reaction for circulation, if
Prod [n] and task [k] .input [m] is same material, then count is entered as 0, prod [n] quantity increase task
Max_prod times of [k] .input [m] quantity.Function returns to true and exited
If going to this step, function returns to false and exited step (4.7).The return value and synthesis flow of the function
Have solution property judgment means judged result it is identical.
Claims (1)
1. synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence, it is characterised in that following steps：
(1) it is directed in chemical industry synthesis problem, involved material carries out formalization representation；By in chemical industry synthesis problem, it is related to
Reactant and product be all referred to as material, and such material is denumerable；Define a two tuple r=<rnam, rnum
>, a kind of material context wherein in r expressions system, rnamUnique insert tracer material r species, rnumRepresent material r quantity；
(2) in system all kinds material, be required for carrying out the expression of form in step (1)；R={ r1, r2..., rN, its
Middle N represents that the material involved by the chemical industry synthesis problem always plants number；
(3) on the basis of step (2), formalization representation is carried out to the reaction that can be generated with a triple：Trans=<
Name, condition, input, output>；Wherein, name uniquely indicates the chemical reaction；Condition represents the chemistry
Required condition occurs for reaction；The reactant situation that this reaction needs of input expressions completion consume is one by r=<rnam,
rnum>The set of composition, output represent to complete this reaction can caused by product situation, and one by r=<rnam, rnum>
The set of composition；Under many circumstances, the product of different chemical reactions does not intersect, therefore is chemically reacted for any two is different
transiAnd transj,
(4) on the basis of step (2), step (3), there are solution property judgment means using a kind of synthesis flow, to judge current
Under raw material and the limitation that can be reacted, whether target product can be carried out by a series of chemical industry synthesis flows.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711201028.1A CN107832970A (en) | 2017-11-23 | 2017-11-23 | Synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711201028.1A CN107832970A (en) | 2017-11-23 | 2017-11-23 | Synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107832970A true CN107832970A (en) | 2018-03-23 |
Family
ID=61645813
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711201028.1A Pending CN107832970A (en) | 2017-11-23 | 2017-11-23 | Synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107832970A (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102087233A (en) * | 2009-12-04 | 2011-06-08 | 复旦大学 | Method for characterizing progress and conversion rate of chemical reaction |
-
2017
- 2017-11-23 CN CN201711201028.1A patent/CN107832970A/en active Pending
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102087233A (en) * | 2009-12-04 | 2011-06-08 | 复旦大学 | Method for characterizing progress and conversion rate of chemical reaction |
Non-Patent Citations (2)
| Title |
|---|
| MICHAEL L. MAVROVOUNIOTIS等: "《Generating complex systems in the domain of chemical reactions》", 《KNOWLEDGE-BASED SYSTEMS》 * |
| 王友发: "《面向智能制造的多机器人系统任务分配研究》", 《中国博士学位论文全文数据库》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Alexander et al. | When climate reshuffles competitors: a call for experimental macroecology | |
| Zhang et al. | An effective genetic algorithm for the flexible job-shop scheduling problem | |
| Scott | Social network analysis: developments, advances, and prospects | |
| Hodapp et al. | Environmental and trait variability constrain community structure and the biodiversity‐productivity relationship | |
| CN108694305A (en) | Analysis of biological information platform based on cloud computing | |
| CN112163420A (en) | NLP technology-based RPA process automatic generation method | |
| CN1653418A (en) | Providing common memory management code to objects that are instances of different classes | |
| CN110908710A (en) | Web front-end code dependency relationship visualization method | |
| Minder et al. | How to translate a book within an hour: towards general purpose programmable human computers with crowdlang | |
| Saha et al. | A fuzzy AHP approach to IT-based stream selection for admission in technical institutions in India | |
| Cheng et al. | The driving effect of technological innovation on green development: dynamic efficiency spatial variation | |
| Silva et al. | JobPruner: A machine learning assistant for exploring parameter spaces in HPC applications | |
| Palagin | An ontological conception of informatization of scientific investigations | |
| CN106096159B (en) | A kind of implementation method of distributed system behavior simulation analysis system under cloud platform | |
| CN117009038B (en) | Graph computing platform based on cloud native technology | |
| Joachim et al. | What does front-end research build on? A cocitation analysis of the intellectual background and potential future research avenues | |
| CN107832970A (en) | Synthesis path automatic generating method in Chemical Manufacture problem is decomposed based on recurrence | |
| Gao et al. | miaSim: an R/Bioconductor package to easily simulate microbial community dynamics | |
| Shah et al. | DesignSystemsJS-Building a Design Systems API for aiding standardization and AI integration | |
| Gao et al. | The Connotation and Logical Construction of Government Digital Transformation--Based on the Analysis of Sociotechnical System Theory | |
| Alcaide et al. | MCLEAN: Multilevel clustering exploration as network | |
| Alarcón et al. | Changing higher education governance in Latin America: the cases of Chile and Ecuador | |
| Xu et al. | How can regional innovation ecosystem affect innovation level? an Fs QCA analysis | |
| Lee | Implementation of Complex Systems in Fashion Design Creation Using Artificial Intelligence | |
| US20220172136A1 (en) | System for analyzing characteristics of internet of services |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20180323 |
|
| WD01 | Invention patent application deemed withdrawn after publication |