Capacitated location-allocation problem with stochastic demands is originally formulated as expected value model, chance-constrained programming and dependent-chance programming according to different criteria. For solving these stochastic models efficiently, the network simplex algorithm, stochastic simulation and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Fina...

The maximum weighted matching problem is to find a maximum matching in a given graph such that the sum of weights of edges in it is maximum. In this paper, the concept of maximum random fuzzy weighted matching is proposed firstly, and then the maximum random fuzzy weighted matching problem is formulated as expected value model, chance-constrained programming and dependent-chance programming acc...

Development of every society is incumbent upon energy sector’s technological and economic effectiveness. The electricity industry is a growing and needs to have a better performance to effectively cover the demand. The industry requires a balance between cost and efficiency through careful design and planning. In this paper, a two-stage stochastic programming model is presented for the design o...

The aim of this study was to determine whether intermittent shuttle running times (during a prolonged, simulated cricket batting innings) and Achilles tendon properties were affected by 8 weeks of plyometric training (PLYO, n = 7) or normal preseason (control [CON], n = 8). Turn (5-0-5-m agility) and 5-m sprint times were assessed using timing gates. Achilles tendon properties were determined u...

In this paper, a fuzzy quadratic minimum spanning tree problem is formulated as expected value model, chance-constrained programming and dependent-chance programming according to different decision criteria. Then the crisp equivalents are derived when the fuzzy costs are characterized by trapezoidal fuzzy numbers. Furthermore, a simulation-based genetic algorithm using Prüfer number representat...

Despite the existence of e cient solution methods for bin packing problems, in practice these seldom occur in such a pure form but feature instead various considerations such as pairwise con icts or pro ts between items, or aiming for balanced loads amongst the bins. The Wedding Seating Problem is a combinatorial optimization problem incorporating elements of bin packing with con icts, bin pack...

In practice, due to the lack of information, imprecise variables which come from experts’ empirical data usually appear. In order to deal with these imprecise variables, uncertainty theory is proposed and has been proved to be an efficient method. This paper introduces uncertainty theory into travelling salesman problem (TSP), in which the link travel times are assumed to be uncertain variables...

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...

Background: Aflatoxin M1 (AFM1) is a toxic compound that could be found in milk and dairy products. AFM1 is the principle hydroxylated derivative of aflatoxin B1 (AFB1), formed in liver and excreted into the milk in the mammary glands of both human and lactating animals that have been fed with AFB1 contaminated diet. To the best of our knowledge, there is no report on stability of AFM1 during p...