Designing a sustainable supply chain using an integrated analytic network process and goal programming approach in quality function deployment

Sustainable supply chain management (SSCM) provides economic, social end environmental requirements in material and service flows occurring between suppliers, manufacturers and customers. SSCM structure is considered as a prerequisite for a sustainable success. Thus designing an effective SCM structure provides competitive advantages for the companies. In order to achieve an effective design of this structure, it is possible to apply quality function deployment (QFD) approach which is successfully applied as an effective product and system development tool. This study presents a decision framework where analytic network process (ANP) integrated QFD and zero-one goal programming (ZOGP) models are used in order to determine the design requirements which are more effective in achieving a sustainable supply chain (SSC). The first phase of the QFD is the house of quality (HOQ) which transforms customer requirements into product design requirements. In this study, after determining the sustainability requirements named customer requirements (CRs) and design requirements (DRs) of a SSC, ANP is employed to determine the importance levels in the HOQ considering the interrelationships among the DRs and CRs. Furthermore ZOGP approach is used to take into account different objectives of the problem. The proposed method is applied through a case study and obtained results are discussed.     

Fast computation of the prime implicants by exact direct-cover algorithm based on the new partial ordering operation rule

In this study, a novel OFF-set based direct-cover Exact Minimization Algorithm (EMA) is proposed for single-output Boolean functions represented in a sum-of-products form. To obtain the complete set of prime implicants covering the given Target Minterm (ON-minterm), the proposed method uses OFF-cubes (OFF-minterms) expanded by this Target Minterm. The amount of temporary results produced by this method does not exceed the size of the OFF-set. In order to achieve the goal of this study, which is to make faster computations, logic operations were used instead of the standard operations. Expansion OFF-cubes, commutative absorption operations and intersection operations are realized by logic operations for fast computation. The proposed minimization method is tested on several classes of benchmarks and then compared with the ESPRESSO algorithm. The results show that the proposed algorithm obtains more accurate and faster results than ESPRESSO does.     

Hybrid algorithm for generalized mixed equilibrium problems and variational inequality problems and fixed point problems

In this paper, we introduce a new iterative algorithm by hybrid method for finding a common element of the set of solutions of finite general mixed equilibrium problems and the set of solutions of a general variational inequality problem for finite inverse strongly monotone mappings and the set of common fixed points of infinite family of strictly pseudocontractive mappings in a real Hilbert space. Then we prove strong convergence of the scheme to a common element of the three above described sets. Our result improves and extends the corresponding results announced by many others.     

Quantized H∞ control for a class of 2-D systems with missing measurements

In this paper, the problem of quantized H∞ control is investigated for a class of 2-D systems described by Roesser model with missing measurements. The measurement missing of system state is described by a sequence of random variables obeying the Bernoulli distribution. Meanwhile, the state measurements are quantized by logarithmic quantizer before being communicated. By introducing a new 2-D Lyapunov-like function, a sufficient condition is derived to guarantee stochastically stable and H∞ performance of the closed-loop 2-D system, where the method of sector-bounded uncertainties is utilized to deal with quantization error. Based on the condition, the quantized H∞ control can be designed by using linear matrix inequality technique. A simulation example is also given to illustrate the proposed method.

     

Shakedown analysis of circular plates using a yield criterion of the mean

Structural optimization based on the shakedown theory is a powerful and promising technique. However, due to the nonlinearities of physical materials and the number of variable loads in real structures, it is computationally complex and time-consuming. To simplify the occurring non-linear, non-convex optimization problems, the paper suggests reducing the number of yield conditions. The so-called a yield criterion of the mean (integral yield condition) is analysed and explained in detail, which allows taking into account one yield condition for the entire finite element instead of multiple point-wise conditions. This approach shows promising results in numerical application to the optimization of a circular plate, considering a possibility of employing the yield criteria of the mean or pointwise yield conditions in different areas of the plate in particular. The methods applied are based on the assumptions of perfect plasticity and small deformations.     

使用系数矩阵变换极性转换的MPRM电路面积优化

为缩短布尔函数系统混合极性Reed-Muller(mixed-polarity Reed-Muller,MPRM)电路面积优化过程的时间,提出了能在任意极性值的MPRM间进行极性转换的系数矩阵变换方法.使用系数矩阵表示布尔函数系统,通过对系数矩阵进行分隔,使用置换和折叠操作完成MPRM极性转换以加快极性转换速度;在此基础上,给出了适用于较大规模MPRM电路的面积优化算法,其中使用遗传算法进行极性空间搜索,并采用基于最短个体距离的适应度计算方法进一步缩短优化过程中的极性转换时间.实验结果表明,与其他MPRM极性转换方法相比,文中方法能够提高MPRM电路面积优化的速度.