Heuristic procedures

Computational efficiency. The efficiency of inference is enhanced by program and knowledge-base structure and by machine speed. Also, heuristic procedures, as used by experts, can augment the deductive procedures of conventional inference. 

The basic heuristic procedure used in this work can be divided into four main activities ... 

To summarize, we have shown that the ideal Donnan model cannot account quantitatively for the ionic effects on gel swelling. Nevertheless, using the heuristic procedure introduced above, the Donnan theory can be used to predict qualitative trends. 

Canel C, Khumawala BM (2001) International facilities location a heuristic procedure for the dynamic uncapacitated problem. International Journal of Production Research 39 3975-4000... 

Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Tech J 49 291-307... 

The kinetic parameters were evaluated numerically using the heuristic procedures of Cropley (5). The algebraic form of the kinetic model had been shown previously to describe adequately the kinetics of reactions of this type Note that in spite of its apparent complexity, only one parameter is associated with each variable. The basic two level experimental design is thus adequate if the form of the rate law is fixed, though one might like to have the time to develop a more complete data set. 

We can use the tj values to start a heuristic procedure, which can be obtained from the regression expression of the nonsignificant coefficients. For this purpose, the following algorithm is used ... 

For the purpose of using a kinetic equation incorporating the Cole-Davidson mechanism according to the heuristic procedure of Nigmatullin and Ryabov [28], we may replace the partial time derivative in Eq. (95) by a fractional time derivative oDvt. Thus Eq. (95) becomes [cf. Eq. (93)]... 

Programming the more general heuristic procedure for enabling SYNCHEM to override its naive choice of preferred subgoal (we call it the ASM,... 

In reality, the production networks typically consist of more than three sites whereby a time horizon of one or two weeks is reasonable in most cases. The time horizon depends on the forecasting stability of production/consumption estimates as well as the transport times. Hence, the model s complexity increases with increasing numbers of nodes and periods. In cases of very large instances, a heuristical procedure can be. set up like this ... 

Contributions for MIRSPs mostly differ in two categories the number of products considered and the solution method(s). Basically, the underlying problem structure is a vehicle routing problem (VRP) and/or a pick-up and delivery problem (PDP) under maritime-specific constraints such as port and turnover capacities as well as inventory constraints. Since VRP and PDP are hard to solve to optimality even in their basic form, solution methods for MIRSP mainly rely on sophisticated and tailored heuristical procedures. First contributions (Christiansen and Nygreen (1998) Christiansen (1999))... 

In contrast to the MC-RTP, the MISP-STA is more complex due to the larger number of integer variables to be determined. To solve larger instances, a heuristical procedure can be set up as follows ... 

Excursion has a six-step heuristic procedure, as shown and explained here ... 

The GA starts with an initial population of chromosomes. Either heuristic procedures or random creations can be used to generate feasible chromosomes that form the initial population. Anderson and Ferris (1994) have mentioned that the performance of the GA scheme is not as good from the pre-selected starting... 

The model provides a set of indicators in order to represent dynamically the activities that have the potential to reduce the probability of accident inside the area. It enables competent authorities to optimize inspection scheduling and planning activities in an homogeneous industrial cluster. The heuristic procedure is based on priority index (PI) evaluated for each establishment (or imit), taking into accoimt evaluation of inherent hazards, of safety conditions and previous accidents. 

Cheung et al. (2008) developed a mathematical model for dynamic fleet management that takes into consideration dynamic data, such as vehicle locations, travel time, and incoming customer orders. The model is able to efficient re-optimize the route plan as dynamic information arrives, and it includes a genetic algorithm procedure for solving the static vehicle routing problem, and a quick heuristic procedure for dynamic updates of the vehicle routes as new data arrive. 

K. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graph. Bell System Technical Journal, 49, number 2, pages 291-307, Feb 1970. 

The stochastic approach to reaction-diffusion systems is not mathematically well-established. Though spatio-temporal stochastic phenomena ought to be associated with random fields, and not with stochastic processes, the usual investigation of such kinds of physicochemical problems starts from the master equation, and then it is extended by some heuristic procedure. From the physical point of view the role of spatial fluctuations is obviously important. It is well known that the density fluctuations are spatially correlated, and according to the modern theory of critical phenomena (e.g. Fisher, 1974 Wilson Kogut, 1974) small fluctuations are amplified owing to spatial interactions causing drastic macroscopic effects. 

---