Solution of Combined Heat and Power Economic Dispatch Problem Using Genetic Algorithm

This research proposes a synergistic meta-heuristic algorithm for solving the extreme operational complications of combined heat and power economic dispatch problem towards the advantageous economic outcomes on the cost of generation. The combined heat and power (CHP) is a system that provides electricity and thermal energy concurrently. For its extraordinary efficiency and significant emission reduction, it is considered a promising energy prospect. The broad application of combined heat and power units requires the joint dispatch of power and heating systems, in which the modelling of combined heat and power units plays a vital role. The present research employs the genetic optimization algorithm to evaluate the cost function, heat and power dispatch values encountered in a system with simple cycle cogeneration unit and quadratic cost function. The system was first modeled to determine the various parameters of combined heat and power units towards solving its economic dispatch problem directly. In order for modelling to be done, a general structure of combined heat and power must be defined. The test system considered consists of four units: two conventional power units, one combined heat and power unit and one heat-only unit. The algorithm was applied to test system while taking into account the power and heat units, bounds of the units and feasible operation region of cogeneration unit. Output decision variables of 4-unit test systems plus cost function from Genetic Algorithm (GA), was determined using appropriate codes. The proposed algorithm produced a well spread and diverse optimal solution and also converged reasonably to the actual optimal solution in 51 iterations. The result obtained compared favourably with that obtained with the direct solution algorithm discussed in a previous paper. We conclude that the genetic algorithm is quite efficient in dealing with non-convex and constrained combined heat and power economic dispatch problem.

Simple generalized inductive limits of C^(*)-algebras

We give a necessary and sufficient condition where a generalized inductive limit becomes a simple C^(*)-algebra. We also show that if a unital C^(*)-algebra can be approximately embedded into some tensorially self absorbing C^(*)-algebra C(e.g., uniformly hyperfinite(UHF)-algebras of infinite type, the Cuntz algebra O_(2)),then we can construct a simple separable unital generalized inductive limit. When C is simple and infinite(resp.properly infinite), the construction is also infinite(resp. properly infinite). When C is simple and approximately divisible, the construction is also approximately divisible. When C is a UHF-algebra and the connecting maps satisfy a trace condition, the construction has tracial rank zero.

The α-comparison Property and Finite Nuclear Dimension of Generalized Inductive Limits for C~*-algebras

The paper is devoted to the study of generalized inductive limit of C＊-algebras with coherent maps being completely positive contractions of order zero： the nuclear dimension of generalized inductive limit of C＊-algebras with finite nuclear dimension is finite; the generalized inductive limits of C＊-algebras with the α-comparison property also have the s-comparison property.

THE LIMITING DISTRIBUTIONS OF SOME SUBCLASSES OF THE GENERALIZED NON-CENTRAL t-DISTRIBUTION

A general theorem on the limiting distribution of the generalized t-distribution is obtained,many applications of this theorem to some subclasses of elliptically contoured distributions in cluding multivariate normal and multivariate t distributions are discussed.Further,their limiting distributions by density function are derived.