Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, su...
详细信息
ISBN:
(数字)9783662033159
ISBN:
(纸本)9783540606765;9783642082337
Genetic algorithms are founded upon the principle of evolution, i.e., survival of the fittest. Hence evolution programming techniques, based on genetic algorithms, are applicable to many hard optimization problems, such as optimization of functions with linear and nonlinear constraints, the traveling salesman problem, and problems of scheduling, partitioning, and control. The importance of these techniques is still growing, since evolution programs are parallel in nature, and parallelism is one of the most promising directions in computer science.;The book is self-contained and the only prerequisite is basic undergraduate mathematics. This third edition has been substantially revised and extended by three new chapters and by additional appendices containing working material to cover recent developments and a change in the perception of evolutionary computation.
A new approach using fuzzy dynamic programming to decide the optimal location and size of compensation shunt capacitors for distribution systems with harmonic distortion is proposed. To decide the optimal capacitor pl...
详细信息
A new approach using fuzzy dynamic programming to decide the optimal location and size of compensation shunt capacitors for distribution systems with harmonic distortion is proposed. To decide the optimal capacitor placement, a fuzzy dynamic programming model in which the real power loss, voltage deviation, and harmonic distortion are all expressed in fuzzy set notation is developed. The problem is formulated as a fuzzy dynamic programming of the minimization of real power loss and capacitor cost under the constraints of voltage limits and total harmonic distortion. A simple algorithm that is based on the fuzzy set is proposed to determine an optimal solution. This algorithm greatly reduces the effort of finding the optimal location via an exhaustive search. A practical distribution system is selected for computer simulation to test the efficiency of the proposed fuzzy dynamic programming method. It is found that the system loss and harmonic distortion can be reduced very effectively by this proposed algorithm.
This paper presents a new technique to optimize the number, location, and size of shunt capacitors on a radial distribution feeder in the presence of harmonics and distortion. The optimization objective is to achieve ...
详细信息
This paper presents a new technique to optimize the number, location, and size of shunt capacitors on a radial distribution feeder in the presence of harmonics and distortion. The optimization objective is to achieve maximum savings resulting from reduced line losses. The mathematical model devised is a mixed 0-1 polynomial program, with restrictions imposed to limit the harmonic current magnification that results from parallel resonance. A global optimization algorithm for polynomial programs is utilized to solve this formulation. The effectiveness of this state-of-the-art algorithm ensures optimality to a complex mathematical model which more accurately represents the physical problem than other formulations. The method presented is suitable for solution on a personal computer, and has yielded promising initial results.
This paper presents a new model and a solution methodology for optimal planning of high-voltage transmission network investments. The objective of this problem is to minimize capital costs needed for new network eleme...
详细信息
This paper presents a new model and a solution methodology for optimal planning of high-voltage transmission network investments. The objective of this problem is to minimize capital costs needed for new network elements while meeting imposed operating constraints, and it is formulated via a linear mixed-integer model. Then, a new branch-and-bound methodology is proposed as the problem solution. The fundamental idea of this methodology is to reduce the number of discrete variables contained in the original set of unknowns. This reduction is achieved by using the decomposition principle and by developing a new separation of the region of feasible solutions. The proposed methodology was verified on several test examples, as well as on the real transmission network of the eastern part of former Yugoslavia.
Based on the new algorithm for GIS image pixel topographic factors in remote sensing monitoring ofsoil losses, a software was developed for microcomputer to carry out computation at a medium river basin(county). This ...
详细信息
Based on the new algorithm for GIS image pixel
topographic factors in remote sensing monitoring ofsoil losses, a software was developed for
microcomputer to carry out computation at a medium river basin(county). This paper lays its
emphasis on algorithmic skills and programming techniques as well as applicationof the software.
Process-oriented models for real-time systems focus on the timing constraints of processes, a focus that can adversely affect resulting designs. Data dependencies between processes create scheduling interactions that ...
详细信息
Process-oriented models for real-time systems focus on the timing constraints of processes, a focus that can adversely affect resulting designs. Data dependencies between processes create scheduling interactions that limit the times at which processes may execute. Processes are then designed to fit available windows in the overall system schedule. “Fitting in” frequently involves fragmenting processes to fit scheduling windows and/or designing program and data structures for speed rather than for program comprehension. The result is often a system with very sensitive timing that is hard to understand and maintain. As an alternative to process-oriented design, we present time-sensitive objects: a data-oriented model for real-time systems. The time-sensitive object (TSO) model structures systems as time-constrained data, rather than time constrained processing. Object values are extended to object histories in which a sequence of time constrained values describe the evolution of the object over time. Systems comprise a set of objects and their dependencies. The TSO model describes the effects of object operations and the propagation of change among related objects. Periodic objects, a class of objects within the TSO model, are described in detail in this article and compared with traditional periodic processes. Advantages of time-sensitive objects are identified, including greater scheduling independence when processes have data dependencies, more opportunity for concurrency, and greater inherent capability for detection of and tolerance to timing errors.
The acceptance of a software product depends to a considerable extent on the user interface. The class of graphic-oriented user interfaces that are called Intuitive User Interfaces (IUI) is described. These interfaces...
详细信息
The acceptance of a software product depends to a considerable extent on the user interface. The class of graphic-oriented user interfaces that are called Intuitive User Interfaces (IUI) is described. These interfaces allow the user to learn to operate software programs quickly. In the following the graphical layout put to use in an IUI is elaborated. All images the layout consists of are created with the aid of a paint program. Using these images, a procedure for creating, programming and linking an IUI to software applications is discussed and recommendations are made concerning software and hardware demands for easily creating IUIs. Practical experience of the authors with this procedure, mainly in the medical area, is described.
The termination-indicator technique is presented, which can be used to solve the class of multi-exit loop problems. A multi-exit loop problem is a programming problem that has several terminating conditions for a loop...
详细信息
The termination-indicator technique is presented, which can be used to solve the class of multi-exit loop problems. A multi-exit loop problem is a programming problem that has several terminating conditions for a loop: either a loop will run through a full cycle or be terminated prematurely when some condition is met. The class of multi-exit loop problems has generated a great deal of controversy on the goto statement in the literature from time to time. The paper illustrates the generality and efficiency of the termination-indicator technique by applying it to the class of multi-exit loop problems and thus puts the goto controversy to rest.
The most critical point in the implementation on a vector computer of iterative methods to solve sparse linear algebraic systems is the sparse matrix-vector product. Therefor we have compared its performance under thr...
详细信息
The most critical point in the implementation on a vector computer of iterative methods to solve sparse linear algebraic systems is the sparse matrix-vector product. Therefor we have compared its performance under three different sparse matrix storage schemes found in literature. These schemes have been tested on a FPS M64/330 using matrices similar to those arising in finite element or finite difference discretizations.
The results are reported and discussed. On the basis of them a new storage scheme is proposed and tested in similar situations. The obtained performance is never worse and often much better than those of the other schemes we have analyzed.
暂无评论