Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Heuristics table

The sequences identified by heuristics (Table 7.26) are evaluated by simulation with Aspen Plus using short cut model DSTWU, based on the Underwood method for minimum reflux. In all cases the initial mixture is at 6 bar and 300 K. The pressure in all columns is also at six bar. No intermediate heat exchangers are considered. The thermodynamic option is ideal, based only on vapour pressure data. The measure for total vapour is the reboiler duty. [Pg.287]

Example 5.1 Each component for the mixture in Table 5.2 is to he separated into relatively pure products. Use the heuristics to determine sequences which are candidates for further evaluation. [Pg.133]

Heuristic Rank order of sequence from Table 5.4... [Pg.139]

In Example 5.3, heuristic 4 seemed to be the most important. Had heuristic 4 been used exclusively for this example, the sequence ranked fifth in Table 5.6 would have been obtained. [Pg.140]

Solution Figure 16.8a shows the hot-end design with the CP table. Above the pinch, adjacent to the pinch, CPfjSCPc- The duty on the units has been maximized according to the tick-oflF heuristic. [Pg.371]

Conversion in both directions needs heuristic information about conjugation. It would therefore be more sensible to input molecules directly into the RAMSES notation. Ultimately, we hope that the chemist s perception of bonding will abandon the connection table representation of a single VB structure and switch to one accounting for the problems addressed in this section in a manner such as that laid down in the RAMSES model. [Pg.70]

The optimization of the backtracking algorithm usually consists of an application of several heuristics which reduce the number of candidate atoms for mapping from Gq to Gj. These heuristics are based on local properties of the atoms such as atom types, number of bonds, bond orders, and ring membership. According to these properties the atoms in Gq and Gj are separated into different classes. This step is known in the literature as partitioning [13]. Table 6.1 illustrates the process of partitioning. [Pg.301]

And other heuristic guides could kick in to give plausible, but never deductively derived, predictions . (So, for example, Paneth in the 1920s used simple reasoning based on the Periodic Table to predict that then undiscovered hafnium would occur in the same ores as zirconium. This is nonetheless a considerably looser notion of prediction than applies to standard cases from physics. See Scerri, 1994). [Pg.79]

Apply the heuristics for the sequencing of simple distillation columns to the problem in Table 11.9. Is the sequence shown in Figure 11.26 likely to be a good or bad sequence based on the heuristics ... [Pg.231]

Table 11.10 Heuristics for separating a mixture of components A, B and C using complex distillation columns. Component A is the most volatile and Component C is the least volatile7. Table 11.10 Heuristics for separating a mixture of components A, B and C using complex distillation columns. Component A is the most volatile and Component C is the least volatile7.
Table 11.10 presents some heuristics for using complex distillation columns to separate a ternary mixture into its pure component products. On the basis of these heuristics and those for simple columns, suggest two sequences containing complex columns that can be used to separate the mixture described in Table 11.9 into relatively pure products. [Pg.231]

In neighborhood-based heuristic searches, each xeX has an associated neighborhood N(x) that contains all the feasible solutions that the search will explore when the current point is x. Each alternative solution x e N(x) is reached from x by an operation called a move. Consider again the three-job problem based on Table 10.2A. Let the current sequence x be (3, 1, 2), and suppose that we consider only neighboring permutations x that can be reached from x by swapping a pair of jobs in x. This swap neighborhood is shown in Table 10.2B, in which i and j are the indices of the jobs to be swapped. If there are n jobs, then a swap neighborhood contains n(n - l)/2 permutations. [Pg.392]

It is reasonable to schedule jobs with short processing times and high penalty costs first. This is motivation for a heuristic that computes the ratio of processing time to penalty cost (see column four of Table 10.4) and sequences the batches in order of increasing value of this ratio, which is the order given in the table. However,... [Pg.393]

The heuristic value of equation (3) is that we can see what is required for a good initiator D and I(R ) must be as large a possible, and AHS(R+) should be small compared to AHS(RI>1+) in other words, as an efficient initiator we need a large cation whose parent radical has a high ionisation potential, and which forms a strong bond to monomer. On the last two counts the trityl cation must be one of the least suitable. These considerations indicate that the first four ions listed in Table 1 should merit detailed study as initiators for vinyl polymerisations. [Pg.212]

Table 10. Heuristics for equipment selection for detergents manufacture. Table 10. Heuristics for equipment selection for detergents manufacture.
Before proceeding to the heuristic classification of functional groups by Evans, it is as well to remember here that in classical organic chemistry when the heteroatom that determines the functionality is attached to an sp carbon atom, this atom is usually not included as forming part of the functional group. However, if the heteroatom is attached to an sp or sp carbon atom, then in these cases the carbon atoms are included in the functional group (see Table 2.1). [Pg.43]

The Knowledge Base. The knowledge base holds symbolic knowledge. To be sure, the knowledge base can also contain tables of numbers, ranges of numerical values, and some numerical procedures where appropriate. But the major content consists of facts and heuristics. [Pg.5]

An heuristic program written by Shelley (10) has been adapted for our computer system to display molecular structures and substructures from connectivity tables. Since the molecular structure and substructure representations are stored in a unique, irredundant form, the structure drawings facilitate visual comparison for commonalities. [Pg.328]


See other pages where Heuristics table is mentioned: [Pg.606]    [Pg.77]    [Pg.193]    [Pg.39]    [Pg.40]    [Pg.216]    [Pg.157]    [Pg.392]    [Pg.144]    [Pg.247]    [Pg.248]    [Pg.253]    [Pg.254]    [Pg.255]    [Pg.256]    [Pg.257]    [Pg.258]    [Pg.260]    [Pg.267]    [Pg.269]    [Pg.272]    [Pg.272]    [Pg.272]    [Pg.398]    [Pg.44]    [Pg.288]    [Pg.58]    [Pg.27]    [Pg.268]    [Pg.342]   
See also in sourсe #XX -- [ Pg.193 , Pg.194 , Pg.195 , Pg.196 ]




SEARCH



Heuristics

Process synthesis Table 5.2—53 heuristics

© 2024 chempedia.info