in this study, the performance of an irreversible regenerative brayton cycle is sought through power maximizations using finite-time thermodynamic concept in finite-size components. optimizations are performed using a genetic algorithm. in order to take into account the finite-time and finite-size concepts in the current problem, a dimensionless mass-flow rate parameter is used to deploy time v...

In this paper, the problem of finding the minimum cost flow line able to produce different products is considered. This problem can be formulated as a shortest path problem on an acyclic di-graph when the machines graph associated with each product family is a chain or a comb. These graphs are relevant in production planning when dealing with pipelined assembly systems. We solve the problem usi...

This paper presents a numerical solution of a class of fractional optimal control problems (FOCPs) in a bounded domain having a noise function by the spectral Ritz method‎. ‎The Bernstein polynomials with the fractional operational matrix are applied to approximate the unknown functions‎. ‎By substituting these estimated functions into the cost functional‎, ‎an unconstrained nonlinear optimizat...

this study develops and analyzes preconditioned krylov subspace methods to solve linear systemsarising from discretization of the time-independent space-fractional models. first, we apply shifted grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. then, we employee two preconditioned iterative methods, namely, the preconditioned gene...

This paper introduces the model of priced timed pushdown systems as an extension of discrete-timed pushdown systems with a cost model that assigns multidimensional costs to both transitions and stack symbols. For this model, we consider the minimal cost reachability problem: i.e., given a priced timed pushdown system and a target set of configurations, determine the minimal possible cost of any...

Abstract: This paper presents an algorithm to find optimum cost time trade off pairs in a fractional capacitated transportation problem with bounds on total availabilities at sources and total destination requirements. The objective function is a ratio of two linear functions consisting of variable costs and profits respectively. Sometimes, situations arise where either reserve stocks have to b...

mathematical simulation of flow toward drains is an important and indispensable stage in drainage design and management. many related models have been developed, but most of them simulate the saturated flow toward drains without a due consideration of the unsaturated zone. in this study, the two dimensional differential equation governing saturated and unsaturated flow in porous media is numeri...

in this paper, we introduce a family of fractional-order chebyshev functions based on the classical chebyshev polynomials. we calculate and derive the operational matrix of derivative of fractional order $gamma$ in the caputo sense using the fractional-order chebyshev functions. this matrix yields to low computational cost of numerical solution of fractional order differential equations to the ...

English In this paper, we introduce a new algorithm for solving Multicommodity Minimal Cost Flow problems; the Auction Algorithm (AA). This algorithm is special: It is not efficient on its own, but it uses the strength of the many. The Auction Algorithm can be run fully distributed. The main idea of the algorithm is that commodities bid on the arcs they want to use. A second algorithm determine...