this paper proposes an efficient network architecture to improve energy consumption in wireless sensor networks (wsn). the proposed architecture uses a mobile data collector to a partitioned network. the mobile data collector moves to center of each logical partition after each decision period. the mobile data collector must declare its new location by packet broadcasting to all sensor nodes. h...

transmission network expansion planning (tnep) is an important component of power system planning. itdetermines the characteristics and performance of the future electric power network and influences the powersystem operation directly. different methods have been proposed for the solution of the static transmissionnetwork expansion planning (stnep) problem till now. but in all of them, stnep pr...

An interactive approach for Bicriteria Transportation Problems, allowing for non-integer solutions, is presented. The decision-maker (DM) conducts the search by introducing upper bounds on the values of one or both criteria, adding one/two additional constraints to the original problem structure. So, usual algorithms for solving transportation problems cannot be used. Two extensions of the netw...

The major part of the underlying idea is going to detect fire from upcoming smoke and shade color using convolutional neural network. detection followed by depend on direction vector analysis in this paper. Image processing available set data very vague ideation so order strengthen we are incorporating two main features that vector. For process will involve preprocessing through bi-variate hypo...

In this paper, a parametric simplex algorithm for solving linear vector optimization problems (LVOPs) is presented. This algorithm can be seen as a variant of the multi-objective simplex (Evans-Steuer) algorithm [12]. Different from it, the proposed algorithm works in the parameter space and does not aim to find the set of all efficient solutions. Instead, it finds a solution in the sense of Lö...

We present a column generation algorithm for solving the bi-objective multicommodity minimum cost flow problem. This method is based on the biobjective simplex method and Dantzig-Wolfe decomposition. The method is initialised by optimising the problem with respect to the first objective, a single objective multi-commodity flow problem, which is solved using DantzigWolfe decomposition. Then, sim...

the dynamic facility layout problem (dflp) is the problem of finding positions of departments onthe plant floor for multiple periods (material flows between departments change during the planning horizon)such that departments do not overlap, and the sum of the material handling and rearrangement costs isminimized. in this paper a new optimization algorithm inspired from colonizing weeds, invasi...