In this paper, an efficient multi-objective model is proposed to solve time-cost trade off problem considering cash flows. The proposed multi-objective meta-heuristic is based on Ant colony optimization and is called Non Dominated Archiving Ant Colony Optimization (NAACO). The significant feature of this work is consideration of uncertainties in time, cost and more importantly interest rate. A ...

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 ti...

We consider approximation algorithms for the problem of finding x of minimal norm ‖x‖ satisfying a linear system Ax = b, where the norm ‖ · ‖ is arbitrary and generally non-Euclidean. We show a simple general technique for composing solvers, converting iterative solvers with residual error ‖Ax−b‖ ≤ t−Ω(1) into solvers with residual error exp(−Ω(t)), at the cost of an increase in ‖x‖, by recursi...

Test planning for core-based 3D stacked ICs under power constraint is different from test planning for non-stacked ICs as the same test schedule cannot be applied both at wafer sort and package test. In this paper, we assume a test flow where each chip is tested individually at wafer sort and jointly at package test. We define cost functions and test planning optimization algorithms for non-sta...

We consider an optimal rearrangement maximization problem involving the fractional Laplace operator ( − Δ ) s , 0 < 1 and Gagliardo-Nirenberg seminorm [ u ] . prove existence of a maximizer, analyze its properties show that it satisfies unstable obstacle equation for some α > = χ { }

in a large scale cyclic storage system ,as the number of rule parameters and/or number of operating period increase, general purpose gradient-based nlp solvers and/or genetic algorithms may loose their merits in finding optimally feasible solution to the problem. in these cases hybrid ga which decomposes the main problem into two manageable sub-problems with an iterative scheme between ga and l...

  In this paper, we consider a flow shop scheduling problem with bypass consideration for minimizing the sum of earliness and tardiness costs. We propose a new mathematical modeling to formulate this problem. There are several constraints which are involved in our modeling such as the due date of jobs, the job ready times, the earliness and the tardiness cost of jobs, and so on. We apply adapte...

In this paper, we consider large-scale remote environmental monitoring (data gathering) through deploying an unreliable wireless sensor network in a remote region. The data monitoring center is geographically located far away from the region of the sensor network, which consists of sensors and gateways. Sensors are responsible for sensing and relaying data, and gateways are equipped with 3G/4G ...

Flow variation over time is an important feature in network flow problems arising in various applications such as road or air traffic control, production systems, communication networks (e.g., the Internet), and financial flows. The common characteristic are networks with capacities and transit times on the arcs which specify the amount of time it takes for flow to travel through a particular a...