Referenced Items are not available for this document.
In this paper the dynamic programming application on optimal tower spotting location such as is formulated in (Mitra, G and Wolfende, 1968) is reformulated. Results based on this reformulation and corresponding algorithm and computer program are presented. Dynamic programming consist in segmenting the route profile, defining sites, and finding optimal transmission line from start of profile to each site progressively. Stages are the sites and the optimal policy will be the line of minimal cost thru each heights of tower that support conductor. Reformulation refers to redefine optimal policy to represent adequately constrains determined by 3 towers (wind span, load span, distance to mass)
Published in:
Transmission & Distribution Conference and Exposition: Latin America, 2006. TDC '06. IEEE/PES
Date of Conference: 15-18 Aug. 2006
- Page(s):
- 1 - 4
- E-ISBN :
- 1-4244-0288-3
- Print ISBN:
- 1-4244-0287-5
- INSPEC Accession Number:
- 9441142
- Conference Location :
- Caracas
- Digital Object Identifier :
- 10.1109/TDCLA.2006.311568
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
