In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

Background Experimental studies have shown that fractional flow reserve (defined as the ratio of maximal achievable flow in a stenotic area to normal maximal achievable flow) can be calculated from coronary pressure measurements only. The objectives of this study were to validate fractional flow reserve calculation in humans and to compare this information with that derived from quantitative co...

A procedure is presented that synthesizes fractional crystallization separation processes to obtain pure solids from multi-component solutions. The method includes a procedure to generate a network flow model to identify alternative process designs for fractional crystallization. The main advantage of this systematic procedure with respect to other reported procedures is using non-equilibri...

In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

We consider the 1-median problem in R with the Chebyshev-norm: Given n points with nonnegative weights, find a point that minimizes the sum of the weighted distances to the given points. We propose a combinatorial algorithm for this problem by reformulating it as a fractional b-matching problem. This graph-theoretical problem can be solved by a min-cost-flow algorithm. Moreover, we show that th...

a procedure is presented that synthesizes fractional crystallization separation processes to obtain pure solids from multi-component solutions. the method includes a procedure to generate a network flow model to identify alternative process designs for fractional crystallization. the main advantage of this systematic procedure with respect to other reported procedures is using non-equilibrium s...

in this paper, an efficient extension of network simplex algorithm is presented. in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by network simplex algorithm (nsa) and nsa+, which extended the stand...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

We deal with a bicriterion spanning tree problem relevant in some application fields such as telecommunication networks or electric networks. Each edge is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the spanning tree (the summation of its edge costs), while the second intends to get the solution with a minimum number of dif...