Search

Abstract: The split feasibility problem models inverse problems arising from phase retrieval problems and the intensity modulated radiation therapy. In this paper, two methods have been presented for solving the split feasibility problem. The strong convergence results of presented algorithms have been obtained under some mild conditions. Especially, the minimum norm solution of the split feasibility problem can be found. [Copyright &y& Elsevier]

Abstract: Model updating should be correlated with experimental data to ensure that it models the dynamics of the real structure and the updated model predicts the dynamics of a structure more accurately. Considering that the iterative methods for model updating have aroused little public attention, this paper studies an iterative algorithm for quadratic model updating problems which can incorporate the measured modal data into the finite element model to produce an adjusted finite element model on the mass, gyroscopic and stiffness matrices that closely match the experimental modal data. By this method, the best approximation symmetric and skew-symmetric solutions can be obtained by choosing a convergence factor. Numerical example shows that the introduced iterative algorithm is quite efficient. [Copyright &y& Elsevier]

Abstract: The quayside operation problem is one of the key components in the management system for a container terminal. In this paper, the integrated models proposed in the previous studies to address the quayside operation problem are examined and one of the potential frameworks is identified. A new method called combinatorial benders’ cuts algorithm is developed to solve the berth-level model in the framework. The computational experiment conducted in this research shows that the proposed approach is more efficient than the branch and cut algorithm embedded in CPLEX. [Copyright &y& Elsevier]

Abstract: In this paper, we present a generic mixed-integer linear multistage stochastic programming (MSSP) model considering endogenous uncertainty in some of the parameters. To address the issue that the number of non-anticipativity (NA) constraints increases exponentially with the number of uncertain parameters and/or its realizations, we present a new theoretical property that significantly reduces the problem size and complements two previous properties. Since one might generate reduced models that are still too large to be solved directly, we also propose three solution strategies: a k-stage constraint strategy where we only include the NA constraints up to a specified number of stages, an iterative NAC relaxation strategy, and a Lagrangean decomposition algorithm that decomposes the problem into scenarios. Numerical results for two process network examples are presented to illustrate that the proposed solution strategies yield significant computational savings. [Copyright &y& Elsevier]

Abstract: Adaptability is the most attractive feature of the smoothed particle hydrodynamics (SPH) method. Therefore it can naturally handle problems with extremely large deformation. Fluid–structure interaction (FSI) problems are placed in this category. In FSI problems, using a good contact algorithm is necessary to achieve fidelity of the results. This paper presents a new numerical simulation based on the SPH method for FSI problems. The main contribution of this work is proposing new algorithms to model the contact between a viscous fluid and hypo-elastic solid particles. In the proposed contact model, the interpenetrations of fluid and solid particles are prevented by introducing a repulsive force and new intermediate particles. The validity of the proposed algorithms is verified, and in order to show their ability several examples are solved. [Copyright &y& Elsevier]