Abstract:  In this study, the change in the crystalline structure of gas hydrate was predicted for ternary mixture of methane-ethane-water. For this purpose, the tangent plane distance (TPD) minimization method was used. First, the calculations were performed for the binary mixtures of methane-water and ethane-water as the gas and liquid phases. The results show that for a binary mixture of th...

vendor managed inventory is a continuous replenishment program that is designed to provide major cost saving benefits for both vendors and retailers. previous research on this area mainly included single objective optimization models where the objective is to minimize the total supply chain costs or to maximize the total supply chain benefits. this paper presents a bi-objective mathematical mod...

Numerical methods for optimal control of hybrid dynamical systems are considered where the discrete dynamics and the nonlinear continuous dynamics are tightly coupled. A decomposition approach for numerically solving general mixed-integer continuous optimal control problems (MIOCPs) is discussed. In the outer optimization loop a branch-and-bound binary tree search is used for the discrete varia...

Witold Pedrycz, Giancarlo Succi, and Ofer Shai Owing to the immense size of the search space in the SAT problem, evolutionary computing arises as a viable and attractive option. The objective of this study is to formulate the SAT problem in the evolutionary setting and carry out comprehensive xperimental studies. The approach relies on the embedding principle: we generalize the Boolean problem ...

Nowadays, many real problems can be modelled as Constraint Satisfaction Problems (CSPs). Some CSPs are considered nonbinary disjunctive CSPs. Many researchers study the problems of deciding consistency for Disjunctive Linear Relations (DLRs). In this paper, we propose a new class of constraints called Extended DLRs consisting of disjunctions of linear inequalities, linear disequations and non-l...

multiple traveling salesman problem (mtsp) is one of the most popular operation research problem and is known as combinatorial optimization problems. mtsp is an extension version of the famous and widely used problem named traveling salesman problem (tsp). because of its benefices in various domains, many researchers have tried to solve that, and many methods have proposed so far. mtsp is a np-...

clustering is the process of dividing a set of input data into a number of subgroups. the members of each subgroup are similar to each other but different from members of other subgroups. the genetic algorithm has enjoyed many applications in clustering data. one of these applications is the clustering of images. the problem with the earlier methods used in clustering images was in selecting in...

The recently proposed Bayesian approach to online learning is applied to learning a rule deened as a noisy single layer perceptron with either continuous or binary weights. In the Bayesian online approach the exact posterior distribution is approximated by a simpler paramet-ric posterior that is updated online as new examples are incorporated to the dataset. In the case of continuous weights, t...