فهرست مطالب

Industrial Mathematics - Volume:11 Issue:4, 2019
  • Volume:11 Issue:4, 2019
  • تاریخ انتشار: 1398/09/10
  • تعداد عناوین: 9
|
  • M. Sharifi *, MR. ‎Shahriari‎, Sh. Khoshniat Pages 239-248
    Redundancy allocation problem is one of the most important problem in Reliability area. In this problem the reliability and availability of the systems maximized via allocating redundant components to sub-systems. a systems operates normally in its operational mode but fails in either opened or shorted modes. this paper presents a repairable k_out_of_n systems network model with common cause failures. We used Biographic Based Optimization algorithm for solving the presented problem.
    Keywords: Availability, Short Circuit, Common cause failure, Repairable, Biographic Based Optimization algorithm
  • J. Esmaily *, S. M. Vaezpour, R. Saadati Pages 249-261
    ‎‎‎Recently Samet et al. introduced the notion of $alpha$-$psi$-contractive type mappings and established some fixed point theorems in complete metric spaces. In this paper, we introduce $alpha$-$(psi,varphi)$-contractive mappings and stablish coincidence and common fixed point theorems for two mapping in complete metric spaces. We present some examples to illustrate our results. As application, we establish an existence and uniqueness theorem for a solution of some integral ‎equations.‎
    Keywords: Fixed point, Coincidence point, Common fixed point, α-(ψ, φ)-contraction, Altering distance function, Integral equations
  • L. Zeinalzadeh, R. Kazemi Matin *, AR. Amirteimoori Pages 263-274
    The current study investigates performance in two-stage production systems through the measurement of capacity utilization (CU). In short-run, the degree of capacity utilization depends on the ability of decision making units to utilize fixed production factors. To develop this indicator in two-stage production processes, a modified SBM network DEA model is proposed. A numerical example is also presented to point out the applicability and effectiveness of current model.
    Keywords: Network Data Envelopment Analysis, Capacity Utilization, Intermediate product, Two-stage production system
  • M. Khaleghi, E. Babolian *, S. Abbasbandy Pages 275-281
    Based on reproducing kernel theory, an effective numerical technique is proposed for solving second order linear two-point boundary value problems with deviating argument. In this method, reproducing kernels with Chebyshev polynomial form are used (C-RKM). The convergence and an error estimation of the method are discussed. The efficiency and the accuracy of the method is demonstrated on some numerical examples.
    Keywords: Two-point boundary value problem, Deviating argument, Polynomial reproducing kernel, Chebyshev polynomials, Chebyshev reproducing kernel method
  • F. Shariffar, ‎A. H. Refahi Sheikhani * Pages 283-291
    In the current study we investigate the two-stage iterative method for solving linear systems. Our new results shows which splitting generates convergence fast in iterative methods. Finally, we solve the Poisson-Block tridiagonal matrix from Poisson's equation which arises in mechanical engineering and theoretical physics. Numerical computations are presented based on a particular linear system, which clearly show the reliability and efficiency of the presented algorithm.
    Keywords: Two stage iterative method, Splitting, Poisson's equation, Spectral radius
  • N. Akhoundi Shiviyari, S. S. Hashemin * Pages 293-305
    In this paper, it is supposed that a project can be shown as a metagraph. The duration of activities are discrete random variables with known probability function, also one kind of consumable and constrained resource is required to execute each activity of the project.The objective of this paper is to maximize the probability of completion of stochastic metagraph before the due date of the project.
    Keywords: Constrained Resource Allocation, Stochastic Metagraph, Project Completion Time
  • S. K. Yekani, E. Abdi Aghdam *, F. Sadegh Moghanlou Pages 307-317
    Considering the disadvantages of gasoline and natural gas as mono-fuel in SI engines has made the researchers to improve the performance and reduce the pollutant as the advantages of the application of dual fuel engines. On the other hand, lean-burn in engine may lead to the reduced pollutant. In the present study various mixtures of gasoline and natural gas with the gasoline as the dominant fuel, including 100‎‎ ‎‎‎%‎‎‎, 87,5%, 75‎‎% and 62.5% in weight-base gasoline and the rest natural gas (respectively named as G100, G87.5, G75, G62.5) in lean-burn condition with 0.9 as the equivalence ratio are investigated. At 1800 rpm and 11 compression ratio, cylinder pressure variations of 350 successive cycles of each mixture were recorded using a single cylinder research engine. First of all, the raw data were processed and the optimized knock-free advance for each individual mixture was determined. Later on the performance of all four mixtures in the corresponding optimized advance was explored. The results revealed that by increasing the amount of natural gas in the mixture, the CO pollutant reduced however the amount of HC initially increased which was followed by a decreasing trend. The amount of NOx had a direct relation with the appearance of the natural gas. In the lean-burn condition, a better performance was observed for G75 in compare with G100 and the other mixtures.
    Keywords: SI engine, Lean-‎burn, ‎P‎ollutant, Dual ‎fuel, Gas‎
  • E. Korani, A. R. Eydi *, I. Nakhai Kamalabadi Pages 319-335

    The present study introduced a novel hierarchical hub set covering problem with capacity constraints. This study showed the significance of fixed charge costs for locating facilities, assigning hub links and designing a productivity network. The proposed model employs mixed integer programming to locate facilities and establish links between nodes according to the travel time between an origin-destination pair within a given time bound.

    Keywords: Hub location, Hub set covering, Hierarchical, Capacity constraint
  • M‎. ‎J‎. Lalehchini, T. Lotfi *, K. Mahdiani Pages 337-345

    The primary goal of this work is to introduce two adaptive Steffensen-like methods with memory of the highest efficiency indices. In the existing methods, to improve the convergence order applied to memory concept, the focus has only been on the current and previous iteration. However, it is possible to improve the accelerators. Therefore, we achieve superior convergence orders and obtain as high efficiency indices as possible.

    Keywords: Nonlinear equations, Iterative methods, Steffensen-like method, Methods with memory, Adaptive methods