Big Chemical Encyclopedia

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

Articles Figures Tables About

Nearest rule

To the extent that shipping cost is roughly proportional to distance, it appears reasonable to transship from the closest DC with stock on hand. This intuitive approach is widely adopted in practice. We name the first decision rule as the Nearest Rule. [Pg.28]

Suppose that current inventory positions are (2, 0, 3), and a customer from market 2 places an order. According to the Nearest Rule, the retailer needs to make a transshipment from DC 3 since C >C... [Pg.28]

Unfortunately, this myopic Nearest Rule only considers the one-time delivery cost. It does not take into account that transshipment will reduce the source DC s ability to meet its own future demand. A higher future demand rate implies a... [Pg.28]

As seen from Table 4, apparently the Ratio Rule and the LP Rule perform much better than the Nearest Rule. In addition, the relative performance of the heuristic rules seems insensitive to the variation of demand rate, although the system delivery cost does increase as the variation increases. In other words, demand variation will cause delivery costs to increase, but it will not necessarily cause poor transshipment decisions. Hence, our two new proposed heuristic rules appear robust. [Pg.29]

We find that the Nearest Rule, which is widely used, is not a wise approach for transshipment decision making. The LP Rule may be best for rare nonrealistic cost matrices. The Ratio Rule as we suggest is generally a much better substitute for the Nearest Rule. In addition, the performance of the Ratio Rule is robust to demand variation. [Pg.32]

Octet rule (Section 1 3) When forming compounds atoms gain lose or share electrons so that the number of their va lence electrons is the same as that of the nearest noble gas For the elements carbon nitrogen oxygen and the halo gens this number is 8... [Pg.1290]

Rule 10. Adjust exponents to their nearest sensible value and run the non-linear estimation once more to get the best value for E, and K s. [Pg.142]

As a rule, though, these MC models deal instead with hard bonds between the nearest neighbor monomers in a chain. [Pg.565]

Figure 1.1 shows the time evolution of a nearest-neighbor (radins r=l) rnle where c is equal to either 0 or 1. The row of eight boxes at the top of the figure shows the explicit rule-set, where - for visual clarity - a box has been arbitrarily colored... [Pg.9]

Fig. 3.45 Time evolution of rule T12 on (a) r — 2 lattice, (b,c) intermediate lattices, defined by populating an r=2 lattice with a fraction p of vertices that have 6 nearest-neighbors, with p6 0.15, pc 0.30, and (d) r = 3. We see that the class-3 behavior on the pure range-r graphs in (a) and (b) can become effectively class-2 on certain intermediate (or hybrid) topologies. Fig. 3.45 Time evolution of rule T12 on (a) r — 2 lattice, (b,c) intermediate lattices, defined by populating an r=2 lattice with a fraction p of vertices that have 6 nearest-neighbors, with p6 0.15, pc 0.30, and (d) r = 3. We see that the class-3 behavior on the pure range-r graphs in (a) and (b) can become effectively class-2 on certain intermediate (or hybrid) topologies.
Plate 5. A snapshot of David GrifFeath s Stepping Stone CA. The rule is defined as follows. First, choose a number between 0 and 1 to set the update probability p for all sites. For each site i, generate a random number 0 < pi < 1 at each time step. If Pi > p, change the color of the site to that of one of its (four nearest) neighbors selected at random. In effect, the Stepping Stone rule has each site randomly eat one of its neighbors. See http //psoup.math.wisc.edu/. [Pg.160]

We recall that elementary CA are defined by nearest-neighbor rules of the form... [Pg.228]

General Nearest-Neighbor Rules [geor89] - in the same way as we derived equation 7.60, we can show that a general nearest-neighbor conditional probability can be... [Pg.354]

To set up the problem and in order to appreciate more fully the difficulty in quantifying complexity, consider figure 12.1. The figure shows three patterns (a) an area of a regular two-dimensional Euclidean lattice, (b) a space-time view of the evolution of the nearest-neighbor one-dimensional cellular automata rule RllO, starting from a random initial state,f and (c) a completely random collection of dots. [Pg.613]

Consider the evolution of the nearest-neighbor one-dimensional cellular automata rule RllO, starting from a random initial state. A few early steps of a sample evolution are shown in figure 12.11. [Pg.661]

The pattern of ion formation by main-group dements can be summarized by a single rule for atoms toward the left or right of the periodic table, atoms lose or gain electrons until they have the same number of electrons as the nearest noble-gas atom. Thus, magnesium loses two electrons and becomes Mg2+, which has the same number of electrons as an atom of neon. Selenium gains two electrons and becomes Se2+, which has the same number of electrons as krypton. [Pg.50]


See other pages where Nearest rule is mentioned: [Pg.28]    [Pg.29]    [Pg.29]    [Pg.29]    [Pg.30]    [Pg.30]    [Pg.30]    [Pg.30]    [Pg.28]    [Pg.29]    [Pg.29]    [Pg.29]    [Pg.30]    [Pg.30]    [Pg.30]    [Pg.30]    [Pg.1451]    [Pg.76]    [Pg.101]    [Pg.3]    [Pg.424]    [Pg.339]    [Pg.78]    [Pg.76]    [Pg.69]    [Pg.781]    [Pg.9]    [Pg.152]    [Pg.231]    [Pg.360]    [Pg.427]    [Pg.447]    [Pg.449]    [Pg.455]    [Pg.457]    [Pg.701]    [Pg.79]    [Pg.183]    [Pg.63]    [Pg.249]    [Pg.63]   
See also in sourсe #XX -- [ Pg.28 ]




SEARCH



© 2024 chempedia.info