Network Planning Using Iterative Improvement Methods and Heuristic Techniques
Authors
Abstract:
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried out on the prototype show that the application of GA techniques is feasible in transmission network planning. An empirical analysis of the effects of the parameters of the algorithm is also presented in the context of this novel application. Existing mathematical programming, heuristic techniques, artificial intelligence (AI) and iterative improvement methods are also reviewed briefly.
similar resources
Iterative placement improvement by network flow methods
We describe an efficient iterative improvement procedure for row-based cell placement with special emphasis on the objective function used to model net lengths. Two new net models are introduced and we prove theoretically that the net models are accurate approximations of the widely used half perimeter of a rectangle enclosing all pins of a net. In addition, unlike the half perimeter model, our...
full textUsing Cases Utility for Heuristic Planning Improvement
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue, in order to select efficiently nodes to evaluate from the successors of the current search node. In a previous work, we successfully applied a CBR approach to order nodes for evaluation, thus reducing the number of c...
full textRichardson and Chebyshev Iterative Methods by Using G-frames
In this paper, we design some iterative schemes for solving operator equation $ Lu=f $, where $ L:Hrightarrow H $ is a bounded, invertible and self-adjoint operator on a separable Hilbert space $ H $. In this concern, Richardson and Chebyshev iterative methods are two outstanding as well as long-standing ones. They can be implemented in different ways via different concepts.In this paper...
full textDesigning a Forest Road Network using Heuristic Optimization Techniques
This study developed a methodology for generating good alternative locations for road networks using heuristic solution techniques. Locations for road networks are determined based on road standards, timber harvesting and transportation costs, and topographic conditions. The main access road route is designed first and then single stand access roads are located as branches. A Genetic Algorithm ...
full textIterative Improvement Methods for Knowledge-Based Scheduling
For large industrial applications the constraint-based formulation of scheduling problems fits better than mathematical representations from Operational Research, because the constraint approach is more flexible and can be adapted more easily to organizational changes in the production. However, the search for a good solution for realistic applications can be very expensive and furthermore, in ...
full textHeuristic methods for evolutionary computation techniques
Evolutionary computation techniques, which are based on a powerful principle of evolution: survival of the ttest, constitute an interesting category of heuristic search. In other words, evolutionary techniques are stochastic algorithms whose search methods model some natural phenomena: genetic inheritance and Darwinian strife for survival. Any evolutionary algorithm applied to a particular prob...
full textMy Resources
Journal title
volume 15 issue 1
pages 63- 74
publication date 2002-02-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023